Uniform regret bounds over R^d for the sequential linear regression problem with the square loss

05/29/2018
by   Pierre Gaillard, et al.
0

We consider the setting of online linear regression for arbitrary deterministic sequences, with the square loss. We are interested in regret bounds that hold uniformly over all vectors in u ∈ R^d. Vovk (2001) showed a d ln T lower bound on this uniform regret. We exhibit forecasters with closed-form regret bounds that match this d ln T quantity. To the best of our knowledge, earlier works only provided closed-form regret bounds of 2d ln T + O(1).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2011

Sparsity regret bounds for individual sequences in online linear regression

We consider the problem of online linear regression on arbitrary determi...
research
05/20/2011

Adaptive and Optimal Online Linear Regression on L1-balls

We consider the problem of online linear regression on individual sequen...
research
11/02/2021

Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge

We consider the problem of online linear regression in the stochastic se...
research
10/27/2016

Regret Bounds for Lifelong Learning

We consider the problem of transfer learning in an online setting. Diffe...
research
12/16/2019

Does the Multisecretary Problem Always Have Bounded Regret?

Arlotto and Gurvich (2019) showed that the regret in the multisecretary ...
research
10/13/2015

On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities

We study an equivalence of (i) deterministic pathwise statements appeari...
research
06/21/2019

Thompson Sampling for Adversarial Bit Prediction

We study the Thompson sampling algorithm in an adversarial setting, spec...

Please sign up or login with your details

Forgot password? Click here to reset