research
∙
05/31/2023
Parameter-free projected gradient descent
We consider the problem of minimizing a convex function over a closed co...
share
research
∙
05/25/2023
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness
We consider contextual bandit problems with knapsacks [CBwK], a problem ...
research
∙
09/30/2022
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits
We lay the foundations of a non-parametric theory of best-arm identifica...
research
∙
06/01/2022
Contextual Bandits with Knapsacks for a Conversion Model
We consider contextual bandits with knapsacks, with an underlying struct...
research
∙
06/23/2021
A Unified Approach to Fair Online Learning via Blackwell Approachability
We provide a setting and a general approach to fair online learning with...
research
∙
10/05/2020
Diversity-Preserving K-Armed Bandits, Revisited
We consider the bandit-based framework for diversity-preserving recommen...
research
∙
06/05/2020
Adaptation to the Range in K-Armed Bandits
We consider stochastic bandit problems with K arms, each associated with...
research
∙
06/05/2020
Hierarchical robust aggregation of sales forecasts at aggregated levels in e-commerce, based on exponential smoothing and Holt's linear trend method
We revisit the interest of classical statistical techniques for sales fo...
research
∙
01/28/2019
Target Tracking for Contextual Bandits: Application to Demand Side Management
We propose a contextual-bandit approach for demand side management by of...
research
∙
05/29/2018
Uniform regret bounds over R^d for the sequential linear regression problem with the square loss
We consider the setting of online linear regression for arbitrary determ...
research
∙
05/14/2018
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints
In the context of K-armed stochastic bandits with distribution only assu...
research
∙
02/10/2014
A Second-order Bound with Excess Losses
We study online aggregation of the predictions of experts, and first sho...
research
∙
02/10/2014
Approachability in unknown games: Online learning meets multi-objective optimization
In the standard setting of approachability there are two players and a t...
research
∙
05/23/2013
A Primal Condition for Approachability with Partial Monitoring
In approachability with full monitoring there are two types of condition...
research
∙
07/09/2012
Forecasting electricity consumption by aggregating specialized experts
We consider the setting of sequential prediction of arbitrary sequences ...
research
∙
02/15/2012
Mirror Descent Meets Fixed Share (and feels no regret)
Mirror descent with an entropic regularizer is known to achieve shifting...
research
∙
12/18/2009