Gilles Stoltz

Orcid: 0000-0003-1240-1007

According to our database1, Gilles Stoltz authored at least 40 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Adaptation to the Range in K-Armed Bandits.
J. Mach. Learn. Res., 2023

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

Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness.
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.
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.
J. Mach. Learn. Res., 2022

Contextual Bandits with Knapsacks for a Conversion Model.
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.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Diversity-Preserving K-Armed Bandits, Revisited.
CoRR, 2020

2019
Explore First, Exploit Next: The True Shape of Regret in Bandit Problems.
Math. Oper. Res., 2019

Target Tracking for Contextual Bandits: Application to Demand Side Management.
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.
Proceedings of the Algorithmic Learning Theory, 2019

2018
Sequential model aggregation for production forecasting.
CoRR, 2018

2017
Fano's inequality for random variables.
CoRR, 2017

2014
Guest Editors' foreword.
Theor. Comput. Sci., 2014

Set-valued approachability and online learning with partial monitoring.
J. Mach. Learn. Res., 2014

Approachability in unknown games: Online learning meets multi-objective optimization.
Proceedings of The 27th Conference on Learning Theory, 2014

A second-order bound with excess losses.
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.
Mach. Learn., 2013

A Primal Condition for Approachability with Partial Monitoring
CoRR, 2013

2012
Forecasting electricity consumption by aggregating specialized experts
CoRR, 2012

A new look at shifting regret
CoRR, 2012

Mirror Descent Meets Fixed Share (and feels no regret).
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.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Pure exploration in finitely-armed and continuous-armed bandits.
Theor. Comput. Sci., 2011

Robust approachability and regret minimization in games with partial monitoring.
Proceedings of the COLT 2011, 2011

A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences.
Proceedings of the COLT 2011, 2011

<i>X</i>-Armed Bandits.
J. Mach. Learn. Res., 2011

Lipschitz Bandits without the Lipschitz Constant.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
A Geometric Proof of Calibration.
Math. Oper. Res., 2010

X-Armed Bandits
CoRR, 2010

2009
Online Multi-task Learning with Hard Constraints.
Proceedings of the COLT 2009, 2009

Pure Exploration in Multi-armed Bandits Problems.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Strategies for Prediction Under Imperfect Monitoring.
Math. Oper. Res., 2008

Pure Exploration for Multi-Armed Bandit Problems
CoRR, 2008

Online Optimization in X-Armed Bandits.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

2007
Improved second-order bounds for prediction with expert advice.
Mach. Learn., 2007

Learning correlated equilibria in games with compact sets of strategies.
Games Econ. Behav., 2007

2006
Regret Minimization Under Partial Monitoring.
Math. Oper. Res., 2006

2005
Minimizing regret with label efficient prediction.
IEEE Trans. Inf. Theory, 2005

Internal Regret in On-Line Portfolio Selection.
Mach. Learn., 2005


  Loading...