Online learning with exponential weights in metric spaces
Not on the map. Why?
Abstract (arXiv)
This paper addresses the problem of online learning in metric spaces using exponential weights. We extend the analysis of the exponentially weighted average forecaster, traditionally studied in a Euclidean settings, to a more abstract framework. Our results rely on the notion of barycenters, a suitable version of Jensen's inequality and a synthetic notion of lower curvature bound in metric spaces known as the measure contraction property. We also adapt the online-to-batch conversion principle to apply our results to a statistical learning framework.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 3 of its 56 references that are in the map. First posted on arXiv 26 Mar 2021.
Builds on
3 of 56 references.
References · 3
- 2019Introduction to Online Convex Optimizationcited by 793
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
- 2015Measure contraction properties of Carnot groupscited by 1
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Wasserstein Iterative Networks for Barycenter Estimationcited by 23
- 2022Wasserstein Iterative Networks for Barycenter Estimation28 Jan 2022