Distribution Regression with Sliced Wasserstein Kernels
Dimitri Meunier, Massimiliano Pontil, Carlo Ciliberto

TL;DR
This paper introduces a novel distribution regression method using Sliced Wasserstein kernels, offering improved geometric representation of distributions with strong theoretical guarantees and promising experimental results.
Contribution
It proposes an OT-based distribution regression approach leveraging Sliced Wasserstein kernels, addressing limitations of MMD-based methods with proven consistency and risk bounds.
Findings
The proposed method is universally consistent.
It achieves favorable excess risk bounds.
Preliminary experiments show competitive performance.
Abstract
The problem of learning functions over spaces of probabilities - or distribution regression - is gaining significant interest in the machine learning community. A key challenge behind this problem is to identify a suitable representation capturing all relevant properties of the underlying functional mapping. A principled approach to distribution regression is provided by kernel mean embeddings, which lifts kernel-induced similarity on the input domain at the probability level. This strategy effectively tackles the two-stage sampling nature of the problem, enabling one to derive estimators with strong statistical guarantees, such as universal consistency and excess risk bounds. However, kernel mean embeddings implicitly hinge on the maximum mean discrepancy (MMD), a metric on probabilities, which may fail to capture key geometrical relations between distributions. In contrast, optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBone and Joint Diseases · Domain Adaptation and Few-Shot Learning · Advanced Neuroimaging Techniques and Applications
