Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Painless Embeddings of Distributions: the Function Space View

Smola, A., Gretton, A., & Fukumizu, K. (2008). Painless Embeddings of Distributions: the Function Space View. Talk presented at 25th International Conference on Machine Learning (ICML 2008). Helsinki, Finland. 2008-07-05 - 2008-07-09.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C8A9-9 Versions-Permalink: https://hdl.handle.net/21.11116/0000-0003-A7C2-5
Genre: Vortrag

Externe Referenzen

einblenden:
ausblenden:
externe Referenz:
http://icml2008.cs.helsinki.fi/papers/icml2008proceedings.pdf (Zusammenfassung)
Beschreibung:
-
OA-Status:

Urheber

einblenden:
ausblenden:
 Urheber:
Smola, A, Autor           
Gretton, A1, 2, Autor           
Fukumizu, K, Autor           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: This tutorial will give an introduction to the recent understanding and methodology of the kernel method: dealing with higher order statistics by embedding painlessly random variables/probability distributions.
In the early days of kernel machines research, the "kernel trick" was considered a useful way of constructing nonlinear algorithms from linear ones. More recently, however, it has become clear that a potentially more far reaching use of kernels is as a linear way of dealing with higher order statistics by embedding distributions in a suitable reproducing kernel Hilbert space (RKHS). Notably, unlike the straightforward expansion of higher order moments or conventional characteristic function approach, the use of kernels or RKHS provides a painless, tractable way of embedding distributions.
This line of reasoning leads naturally to the questions: what does it mean to embed a distribution in an RKHS? when is this embedding injective (and thus, when do different distributions have unique mappings)? what implications are there for learning algorithms that make use of these embeddings? This tutorial aims at answering these questions.
There are a great variety of applications in machine learning and computer science, which require distribution estimation and/or comparison.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2008-07
 Publikationsstatus: Online veröffentlicht
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: 5271
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 25th International Conference on Machine Learning (ICML 2008)
Veranstaltungsort: Helsinki, Finland
Start-/Enddatum: 2008-07-05 - 2008-07-09

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: ICML 2008: 25th International Conference on Machine Learning
Genre der Quelle: Konferenzband
 Urheber:
McCallum , A, Herausgeber
Roweis, S, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Madison, WI, USA : Oregon State University
Seiten: - Band / Heft: - Artikelnummer: T1 Start- / Endseite: XXXVII Identifikator: ISBN: 978-1-60558-205-4