1

Jointly Efficient and Optimal Algorithms for Logistic Bandits

To appear in AISTATS 2022.

Louis Faury, Marc Abeille, Clément Calauzènes, Kwang-Sung Jun

Jointly Efficient and Optimal Algorithms for Logistic Bandits

Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits

AISTATS 2021 [oral presentation - 3.1% acceptance rate].

Louis Faury, Marc Abeille, Clément Calauzènes

Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits

Self-Concordant Analysis of Generalized Linear Bandits with Forgetting

Yoan Russac, Louis Faury, Olivier Cappé, Aurélien Garivier

Self-Concordant Analysis of Generalized Linear Bandits with Forgetting

A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions

Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes

A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions

Improving Offline Contextual Bandits with Distributional Robustness

Otmane Sakhi, Louis Faury, Flavian Vasile

Improving Offline Contextual Bandits with Distributional Robustness

Improved Optimistic Algorithms for Logistic Bandits

Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq

Improved Optimistic Algorithms for Logistic Bandits

Distributionally Robust Counterfactual Risk Minimization

AAAI 2020 [oral presentation].

Louis Faury, Ugo Tanielian, Flavian Vasile, Elena Smirnova, Elvis Dohmatob

Distributionally Robust Counterfactual Risk Minimization

Benchmarking GNN-CMA-ES on the BBOB noiseless testbed

GECCO Companion 2019.

Louis Faury, Clément Calauzènes, Olivier Fercoq

Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces

Louis Faury, Flavian Vasile

Rover Descent: Learning to Optimize by Learning to Navigate on Prototypical Loss Surfaces