ACM Home Page
Please provide us with feedback. Feedback
Hilbert space embeddings of conditional distributions with applications to dynamical systems
Full text PdfPdf (1.02 MB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 961-968  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Le Song  Carnegie Mellon University, Pittsburgh, PA
Jonathan Huang  Carnegie Mellon University, Pittsburgh, PA
Alex Smola  Yahoo! Research, Santa Clara, CA
Kenji Fukumizu  Institute of Statistical Mathematics, Tokyo, Japan
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 36,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553497
What is a DOI?

ABSTRACT

In this paper, we extend the Hilbert space embedding approach to handle conditional distributions. We derive a kernel estimate for the conditional embedding, and show its connection to ordinary embeddings. Conditional embeddings largely extend our ability to manipulate distributions in Hilbert spaces, and as an example, we derive a nonparametric method for modeling dynamical systems where the belief state of the system is maintained as a conditional embedding. Our method is very general in terms of both the domains and the types of distributions that it can handle, and we demonstrate the effectiveness of our method in various dynamical systems. We expect that conditional embeddings will have wider applications beyond modeling dynamical systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Abrudan, T., Eriksson, J., & Koivunen, V. (2008). Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Transactions on Signal Processing, 56(3).
 
2
 
3
Baker, C. (1973). Joint measures and cross-covariance operators. Transactions of the American Mathematical Society, 186, 273--289.
4
 
5
 
6
Fukumizu, K., Gretton, A., Sun, X., & Schöölkopf, B. (2008). Kernel measures of conditional dependence. In Advances in Neural Information Processing Systems 20.
 
7
Gretton, A., Borgwardt, K., Rasch, M., Schölkopf, B., & Smola, A. (2007). A kernel method for the two-sample-problem. In Advances in Neural Information Processing Systems 19.
8
 
9
 
10
Schölkopf, B., Tsuda, K., & Vert, J.-P. (2004). Kernel Methods in Computational Biology. Cambridge, MA: MIT Press.
 
11
 
12
Song, L., Smola, A., Borgwardt, K., & Gretton, A. (2008). Colored maximum variance unfolding. In Advances in Neural Information Processing Systems 20.
 
13
Sriperumbudur, B., Gretton, A., Fukumizu, K., Lanckriet, G., & Schöölkopf, B. (2008). Injective hilbert space embeddings of probability measures. In Conference on Learning Theory.
 
14
 
15
 
16
Zhang, X., Song, L., Gretton, A., & Smola, A. (2009). Kernel measures of independence for non-iid data. In Advances in Neural Information Processing Systems 21.

Collaborative Colleagues:
Le Song: colleagues
Jonathan Huang: colleagues
Alex Smola: colleagues
Kenji Fukumizu: colleagues