Metraipolis › archive › dc_2bda143be470

Kernel embedding of distributions — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:07:32.249Z
SHA-256 of the archived text
2f89bdbc17589e40cbedbf0a27ba9a642a213b60747bfb7079a3c506464320cd
Stable URL of this page
https://metraipolis.com/documento/dc_2bda143be470

How to cite

Kernel embedding of distributions — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_2bda143be470 (Metraipolis archive dc_2bda143be470, sha256 2f89bdbc17589e40cbedbf0a27ba9a642a213b60747bfb7079a3c506464320cd)
BibTeX
@misc{dc2bda143be470,
  title = {Kernel embedding of distributions — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_2bda143be470; sha256 2f89bdbc17589e40cbedbf0a27ba9a642a213b60747bfb7079a3c506464320cd},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In machine learning, the kernel embedding of distributions (also called the kernel mean or mean map) comprises a class of nonparametric methods in which a probability distribution is represented as an element of a reproducing kernel Hilbert space (RKHS). A generalization of the individual data-point feature mapping done in classical kernel methods, the embedding of distributions into infinite-dimensional feature spaces can preserve all of the statistical features of arbitrary distributions, while allowing one to compare and manipulate distributions using Hilbert space operations such as inner products, distances, projections, linear transformations, and spectral analysis. This learning framework is very general and can be applied to distributions over any space Ω {\displaystyle \Omega } on which a sensible kernel function (measuring similarity between elements of Ω {\displaystyle \Omega } ) may be defined. For example, various kernels have been proposed for learning from data which are: vectors in R d {\displaystyle \mathbb {R} ^{d}} , discrete classes/categories, strings, graphs/networks, images, time series, manifolds, dynamical systems, and other structured objects. The theory behind kernel embeddings of distributions has been primarily developed by Alex Smola, Le Song, Arthur Gretton, and Bernhard Schölkopf. A review of recent works on kernel embedding of distributions can be found in. The analysis of distributions is fundamental in machine learning and statistics, and many algorithms in these fields rely on information theoretic approaches such as entropy, mutual information, or Kullback–Leibler divergence. However, to estimate these quantities, one must first either perform density estimation, or employ sophisticated space-partitioning/bias-correction strategies which are typically infeasible for high-dimensional data. Commonly, methods for modeling complex distributions rely on parametric assumptions that may be unfounded or computationally challenging (e.g. Gaussian mixture models), while nonparametric methods like kernel density estimation (Note: the smoothing kernels in this context have a different interpretation than the kernels discussed here) or characteristic function representation (via the Fourier transform of the distribution) break down in high-dimensional settings. Methods based on the kernel embedding of distributions sidestep these problems and also possess the following advantages: Data may be modeled without restrictive assumptions about the form of the distributions and relationships between variables Intermediate density estimation is not needed Practitioners may specify the properties of a distribution most relevant for their problem (incorporating prior knowledge via choice of the kernel) If a characteristic kernel is used, then the embedding can uniquely preserve all information about a distribution, thanks to the kernel trick, while computations on the potentially infinite-dimensional RKHS can be implemented in pract

Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Machine learning»).
Fonte: Wikipedia in inglese, voce «Kernel embedding of distributions» — https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions
Wikidata Q16000131: «comprises a class of nonparametric methods in which a probability distribution is represented as an element of a reproducing kernel Hilbert space» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q16000131
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Kernel_embedding_of_distributions?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1366649339, consultata il 2026-10-05T23:28:14.941Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8e4caa590c0ca950f49963e51c6442108d64574e2e7ca152c75bfc745f60025a