TU Darmstadt / ULB / TUbiblio

Expected Information Maximization: Using the I-Projection for Mixture Density Estimation

Becker, Philipp ; Arenz, Oleg ; Neumann, Gerhard (2022)
Expected Information Maximization: Using the I-Projection for Mixture Density Estimation.
8. International Conference on Learning Representations (ICLR 2020). Virtual Conference (26.04.2020-30.04.2020)
doi: 10.26083/tuprints-00022969
Konferenzveröffentlichung, Zweitveröffentlichung, Verlagsversion

WarnungEs ist eine neuere Version dieses Eintrags verfügbar.

Kurzbeschreibung (Abstract)

Modelling highly multi-modal data is a challenging problem in machine learning. Most algorithms are based on maximizing the likelihood, which corresponds to the M(oment)-projection of the data distribution to the model distribution. The M-projection forces the model to average over modes it cannot represent. In contrast, the I(nformation)-projection ignores such modes in the data and concentrates on the modes the model can represent. Such behavior is appealing whenever we deal with highly multi-modal data where modelling single modes correctly is more important than covering all the modes. Despite this advantage, the I-projection is rarely used in practice due to the lack of algorithms that can efficiently optimize it based on data. In this work, we present a new algorithm called Expected Information Maximization (EIM) for computing the I-projection solely based on samples for general latent variable models, where we focus on Gaussian mixtures models and Gaussian mixtures of experts. Our approach applies a variational upper bound to the I-projection objective which decomposes the original objective into single objectives for each mixture component as well as for the coefficients, allowing an efficient optimization. Similar to GANs, our approach employs discriminators but uses a more stable optimization procedure, using a tight upper bound. We show that our algorithm is much more effective in computing the I-projection than recent GAN approaches and we illustrate the effectiveness of our approach for modelling multi-modal behavior on two pedestrian and traffic prediction datasets.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2022
Autor(en): Becker, Philipp ; Arenz, Oleg ; Neumann, Gerhard
Art des Eintrags: Zweitveröffentlichung
Titel: Expected Information Maximization: Using the I-Projection for Mixture Density Estimation
Sprache: Englisch
Publikationsjahr: 2022
Ort: Darmstadt
Publikationsdatum der Erstveröffentlichung: 2020
Kollation: 16 Seiten
Veranstaltungstitel: 8. International Conference on Learning Representations (ICLR 2020)
Veranstaltungsort: Virtual Conference
Veranstaltungsdatum: 26.04.2020-30.04.2020
DOI: 10.26083/tuprints-00022969
URL / URN: https://tuprints.ulb.tu-darmstadt.de/22969
Zugehörige Links:
Herkunft: Zweitveröffentlichungsservice
Kurzbeschreibung (Abstract):

Modelling highly multi-modal data is a challenging problem in machine learning. Most algorithms are based on maximizing the likelihood, which corresponds to the M(oment)-projection of the data distribution to the model distribution. The M-projection forces the model to average over modes it cannot represent. In contrast, the I(nformation)-projection ignores such modes in the data and concentrates on the modes the model can represent. Such behavior is appealing whenever we deal with highly multi-modal data where modelling single modes correctly is more important than covering all the modes. Despite this advantage, the I-projection is rarely used in practice due to the lack of algorithms that can efficiently optimize it based on data. In this work, we present a new algorithm called Expected Information Maximization (EIM) for computing the I-projection solely based on samples for general latent variable models, where we focus on Gaussian mixtures models and Gaussian mixtures of experts. Our approach applies a variational upper bound to the I-projection objective which decomposes the original objective into single objectives for each mixture component as well as for the coefficients, allowing an efficient optimization. Similar to GANs, our approach employs discriminators but uses a more stable optimization procedure, using a tight upper bound. We show that our algorithm is much more effective in computing the I-projection than recent GAN approaches and we illustrate the effectiveness of our approach for modelling multi-modal behavior on two pedestrian and traffic prediction datasets.

Freie Schlagworte: density estimation, optimization
Status: Verlagsversion
URN: urn:nbn:de:tuda-tuprints-229690
Zusätzliche Informationen:

Recording of the presentation and slides: https://iclr.cc/virtual_2020/poster_ByglLlHFDS.html

Reviews: https://openreview.net/forum?id=ByglLlHFDS

Sachgruppe der Dewey Dezimalklassifikatin (DDC): 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Intelligente Autonome Systeme
Hinterlegungsdatum: 07 Dez 2022 13:11
Letzte Änderung: 09 Dez 2022 08:45
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen