We stand with Ukraine

We stand with Ukraine

Gilles Stoltz

Orcid: 0000-0003-1240-1007

According to our database¹, Gilles Stoltz authored at least 42 papers between 2005 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org

On csauthors.net:

Bibliography

2024

Diversity-Preserving K-Armed Bandits, Revisited.

[BibT_eX]

[DOI]

,

Sébastien Gerchinovitz

,

Jean-Michel Loubes

,

Trans. Mach. Learn. Res., 2024

Conformal Prediction for Hierarchical Data.

[BibT_eX]

[DOI]

Guillaume Principato

,

Yvenn Amara-Ouali

,

,

Bachir Hamrouche

,

Jean-Michel Poggi

,

CoRR, 2024

Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization.

[BibT_eX]

[DOI]

,

,

CoRR, 2024

2023

Adaptation to the Range in K-Armed Bandits.

[BibT_eX]

[DOI]

,

J. Mach. Learn. Res., 2023

Symphony of experts: orchestration with adversarial insights in reinforcement learning.

[BibT_eX]

[DOI]

Matthieu Jonckheere

,

Chiara Mignacco

,

CoRR, 2023

Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness.

[BibT_eX]

[DOI]

,

Christophe Giraud

,

,

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits.

[BibT_eX]

[DOI]

Antoine Barrier

,

Aurélien Garivier

,

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022

KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints.

[BibT_eX]

[DOI]

Aurélien Garivier

,

,

,

J. Mach. Learn. Res., 2022

Contextual Bandits with Knapsacks for a Conversion Model.

[BibT_eX]

[DOI]

,

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

A Unified Approach to Fair Online Learning via Blackwell Approachability.

[BibT_eX]

[DOI]

,

Christophe Giraud

,

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2019

Explore First, Exploit Next: The True Shape of Regret in Bandit Problems.

[BibT_eX]

[DOI]

Aurélien Garivier

,

,

Math. Oper. Res., 2019

Target Tracking for Contextual Bandits: Application to Demand Side Management.

[BibT_eX]

[DOI]

Margaux Brégère

,

Pierre Gaillard

,

,

Proceedings of the 36th International Conference on Machine Learning, 2019

Uniform regret bounds over R<sup>d</sup> for the sequential linear regression problem with the square loss.

[BibT_eX]

[DOI]

Pierre Gaillard

,

Sébastien Gerchinovitz

,

,

Proceedings of the Algorithmic Learning Theory, 2019

2018

Sequential model aggregation for production forecasting.

[BibT_eX]

[DOI]

Raphaël Deswarte

,

Véronique Gervais

,

,

Sébastien Da Veiga

CoRR, 2018

2017

Fano's inequality for random variables.

[BibT_eX]

[DOI]

Sébastien Gerchinovitz

,

,

CoRR, 2017

2014

Guest Editors' foreword.

[BibT_eX]

[DOI]

Nader H. Bshouty

,

,

Nicolas Vayatis

,

Thomas Zeugmann

Theor. Comput. Sci., 2014

Set-valued approachability and online learning with partial monitoring.

[BibT_eX]

[DOI]

,

Vianney Perchet

,

J. Mach. Learn. Res., 2014

Approachability in unknown games: Online learning meets multi-objective optimization.

[BibT_eX]

[DOI]

,

Vianney Perchet

,

Proceedings of The 27th Conference on Learning Theory, 2014

A second-order bound with excess losses.

[BibT_eX]

[DOI]

Pierre Gaillard

,

,

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Forecasting electricity consumption by aggregating specialized experts - A review of the sequential aggregation of specialized experts, with an application to Slovakian and French country-wide one-day-ahead (half-)hourly predictions.

[BibT_eX]

[DOI]

,

Pierre Gaillard

,

,

Mach. Learn., 2013

A Primal Condition for Approachability with Partial Monitoring

[BibT_eX]

[DOI]

,

Vianney Perchet

,

CoRR, 2013

2012

Forecasting electricity consumption by aggregating specialized experts

[BibT_eX]

[DOI]

,

Pierre Gaillard

,

,

CoRR, 2012

A new look at shifting regret

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

,

Pierre Gaillard

,

,

CoRR, 2012

Mirror Descent Meets Fixed Share (and feels no regret).

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

,

Pierre Gaillard

,

,

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Editors' Introduction.

[BibT_eX]

[DOI]

Nader H. Bshouty

,

,

Nicolas Vayatis

,

Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Pure exploration in finitely-armed and continuous-armed bandits.

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

Theor. Comput. Sci., 2011

Robust approachability and regret minimization in games with partial monitoring.

[BibT_eX]

[DOI]

,

Vianney Perchet

,

Proceedings of the COLT 2011, 2011

A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences.

[BibT_eX]

[DOI]

Odalric-Ambrym Maillard

,

,

Proceedings of the COLT 2011, 2011

<i>X</i>-Armed Bandits.

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

,

Csaba Szepesvári

J. Mach. Learn. Res., 2011

Lipschitz Bandits without the Lipschitz Constant.

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

A Geometric Proof of Calibration.

[BibT_eX]

[DOI]

,

Math. Oper. Res., 2010

X-Armed Bandits

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

,

Csaba Szepesvári

CoRR, 2010

2009

Online Multi-task Learning with Hard Constraints.

[BibT_eX]

[DOI]

,

Omiros Papaspiliopoulos

,

Proceedings of the COLT 2009, 2009

Pure Exploration in Multi-armed Bandits Problems.

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Strategies for Prediction Under Imperfect Monitoring.

[BibT_eX]

[DOI]

,

,

Math. Oper. Res., 2008

Pure Exploration for Multi-Armed Bandit Problems

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

CoRR, 2008

Online Optimization in X-Armed Bandits.

[BibT_eX]

[DOI]

Sébastien Bubeck

,

,

,

Csaba Szepesvári

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

2007

Improved second-order bounds for prediction with expert advice.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

,

,

Mach. Learn., 2007

Learning correlated equilibria in games with compact sets of strategies.

[BibT_eX]

[DOI]

,

Games Econ. Behav., 2007

2006

Regret Minimization Under Partial Monitoring.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

,

,

Math. Oper. Res., 2006

2005

Minimizing regret with label efficient prediction.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

,

,

IEEE Trans. Inf. Theory, 2005

Internal Regret in On-Line Portfolio Selection.

[BibT_eX]

[DOI]

,

Mach. Learn., 2005

Loading...