The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Hilbert space embeddings of conditional distributions with applications to dynamical systems
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. Condi-tional embeddings largely extend our ability to manipulate distributions in Hilbert spaces, and as an example, we derive a nonpara-metric method for modeling dynamical sys-tems 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 ef-fectiveness of our method in various dynami-cal systems. We expect that conditional em-beddings will have wider applications beyond modeling dynamical systems. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Advances in Neural Information Processing Systems 20
Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008) · neural information processing systems · Cited by 2,846
Large Margin Methods for Structured and Interdependent Output Variables
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altün, Y. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1088722 · Cited by 2,225
A Kernel Method for the Two-Sample-Problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., & Smola, A. J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0069 · Cited by 2,167
Self-citationKernel Methods in Computational Biology
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/4057.001.0001 · Cited by 1,032
Uncertainty in Artificial Intelligence
Kanal, L. N., Lemmer, J. F., & Sage, A. P. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.4309045 · Cited by 938
Dimensionality Reduction for Supervised Learning With Reproducing Kernel Hilbert Spaces
Fukumizu, K., Bach, F. R., & Jordan, M. I. (2003) · doi:10.21236/ada446572 · Cited by 723
Self-citationA Hilbert Space Embedding for Distributions
Smola, A., Gretton, A., Song, L., & Schölkopf, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75225-7_5 · Cited by 706
Self-citationKernel Measures of Conditional Dependence
Fukumizu, K., Gretton, A., Sun, X., & Schölkopf, B. (2007) · Cited by 435
Self-citationJoint measures and cross-covariance operators
Baker, C. R. (1973) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1973-0336795-3 · Cited by 226
Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
Abrudan, T. E., Eriksson, J., & Koivunen, V. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.908999 · Cited by 208
Estimating Labels from Label Proportions
Quadrianto, N., Smola, A. J., Caetano, T. S., & Le, Q. V. (2009) · doi:10.5555/1577069.1755865 · Cited by 172
Self-citationInjective hilbert space embeddings of probability measures
Sriperumbudur, B. K., Gretton, A., Fukumizu, K., Lanckriet, G. R. G., & Schölkopf, B. (2008) · Cited by 117
Self-citationEstimating labels from label proportions
Quadrianto, N., Smola, A. J., Caetano, T. S., & Le, Q. V. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390254 · Cited by 106
Self-citationA general regression technique for learning transductions
Cortes, C., Mohri, M., & Weston, J. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102371 · Cited by 88
Colored Maximum Variance Unfolding
Song, L., Gretton, A., Borgwardt, K., & Smola, A. J. (2007) · Cited by 78
Self-citationExponential families for conditional random fields
Altün, Y., Smola, A. J., & Hofmann, T. (2004) · Uncertainty in Artificial Intelligence · doi:10.5555/1036843.1036844 · Cited by 33
Self-citation
Cited by
Discriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
Self-citationKernel Mean Embedding of Distributions: A Review and Beyond
Muandet, K., Fukumizu, K., Sriperumbudur, B., & Schölkopf, B. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000060 · Cited by 409
Self-citationInterpretable bilinear attention network with domain adaptation improves drug–target prediction
Bai, P., Miljković, F., John, B., & Lu, H. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-022-00605-1 · Cited by 362
Predicting future traffic using Hidden Markov Models
Chen, Z., Wen, J., & Geng, Y. (2016) · 2016 IEEE 24th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7785328 · Cited by 72
Calibration tests beyond classification
Widmann, D., Lindsten, F., & Zachariah, D. (2022) · arXiv · doi:10.48550/arxiv.2210.13355 · Cited by 3
Metadata
- Authors
- Song, L., Huang, J., Smola, A., & Fukumizu, K.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 961-968
- OpenAlex
- W2146641075
- Cited by
- 255
- References
- 18
- FWCI
- 4.47
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.