Skip to main navigation Skip to search Skip to main content

Wasserstein Distributional Learning via Majorization-Minimization

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Learning function-on-scalar predictive models for conditional densities and identifying factors that influence the entire probability distribution are vital tasks in many data-driven applications. We present an efficient Majorization-Minimization optimization algorithm, Wasserstein Distributional Learning (WDL), that trains Semi-parametric Conditional Gaussian Mixture Models (SCGMM) for conditional density functions and uses the Wasserstein distance W2 as a proper metric for the space of density outcomes. We further provide theoretical convergence guarantees and illustrate the algorithm using boosted machines. Experiments on the synthetic data and real-world applications demonstrate the effectiveness of the proposed WDL algorithm.

Original languageEnglish
Pages (from-to)10703-10731
Number of pages29
JournalProceedings of Machine Learning Research
Volume206
StatePublished - 2023
Event26th International Conference on Artificial Intelligence and Statistics, AISTATS 2023 - Valencia, Spain
Duration: Apr 25 2023Apr 27 2023

Fingerprint

Dive into the research topics of 'Wasserstein Distributional Learning via Majorization-Minimization'. Together they form a unique fingerprint.

Cite this