Online learning with exponential weights in metric spaces

03/26/2021
by   Quentin Paris, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2020

The exponentially weighted average forecaster in geodesic spaces of non-positive curvature

This paper addresses the problem of prediction with expert advice for ou...
research
02/17/2023

Minimizing Dynamic Regret on Geodesic Metric Spaces

In this paper, we consider the sequential decision problem where the goa...
research
10/08/2012

A notion of continuity in discrete spaces and applications

We propose a notion of continuous path for locally finite metric spaces,...
research
10/10/2022

Do you pay for Privacy in Online learning?

Online learning, in the mistake bound model, is one of the most fundamen...
research
02/15/2023

Quantum Learning Theory Beyond Batch Binary Classification

Arunachalam and de Wolf (2018) showed that the sample complexity of quan...
research
07/16/2019

Leveraging online learning for CSS in frugal IoT network

We present a novel method for centralized collaborative spectrum sensing...
research
05/04/2023

The complexity of first-order optimization methods from a metric perspective

A central tool for understanding first-order optimization algorithms is ...

Please sign up or login with your details

Forgot password? Click here to reset