Aurélien Garivier

Orcid: 0000-0002-4906-9573

Affiliations:
  • Paul Sabatier University, Toulouse, France
  • Information Processing and Communication Laboratory, Telecom ParisTech (former)


According to our database1, Aurélien Garivier authored at least 64 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the Statistical Complexity of Estimation and Testing under Privacy Constraints.
Trans. Mach. Learn. Res., 2023

About the Cost of Global Privacy in Density Estimation.
CoRR, 2023

Quantum Channel Certification with Incoherent Strategies.
CoRR, 2023

Beyond Average Return in Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Private Statistical Estimation of Many Quantiles.
Proceedings of the International Conference on Machine Learning, 2023

Quantum Channel Certification with Incoherent Measurements.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 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

Regret Analysis of the Stochastic Direct Search Method for Blind Resource Allocation.
CoRR, 2022

Sequential algorithms for testing identity and closeness of distributions.
CoRR, 2022

Private Quantiles Estimation in the Presence of Atoms.
CoRR, 2022

On the Complexity of All ε-Best Arms Identification.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
A/B/n Testing with Control in the Presence of Subpopulations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sequential Algorithms for Testing Closeness of Distributions.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Navigating to the Best Policy in Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Epsilon Best Arm Identification in Spectral Bandits.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Efficient Algorithms for Stochastic Repeated Second-price Auctions.
Proceedings of the Algorithmic Learning Theory, 2021

Self-Concordant Analysis of Generalized Linear Bandits with Forgetting.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Fast Rate Learning in Stochastic First Price Bidding.
Proceedings of the Asian Conference on Machine Learning, 2021

2020
A review on quantile regression for stochastic computer experiments.
Reliab. Eng. Syst. Saf., 2020

Algorithms for Non-Stationary Generalized Linear Bandits.
CoRR, 2020

Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening.
Algorithms, 2020

Best Arm Identification in Spectral Bandits.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

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

X-Armed Bandits: Optimizing Quantiles and Other Risks.
CoRR, 2019

Algorithmic Learning Theory 2019: Preface.
Proceedings of the Algorithmic Learning Theory, 2019

$\mathcal{X}$-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks.
Proceedings of The 11th Asian Conference on Machine Learning, 2019

2018
Can everyday AI be ethical. Fairness of Machine Learning Algorithms.
CoRR, 2018

Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Optimization of a SSP's Header Bidding Strategy using Thompson Sampling.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Profitable Bandits.
Proceedings of The 10th Asian Conference on Machine Learning, 2018

2017
Learning the distribution with largest mean: two bandit frameworks.
CoRR, 2017

Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

A minimax and asymptotically optimal algorithm for stochastic bandits.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models.
J. Mach. Learn. Res., 2016

On Explore-Then-Commit strategies.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Maximin Action Identification: A New Bandit Framework for Games.
Proceedings of the 29th Conference on Learning Theory, 2016

Optimal Best Arm Identification with Fixed Confidence.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm.
Random Struct. Algorithms, 2015

Algorithmes de bandits pour la recommandation à tirages multiples.
Document Numérique, 2015

A Multiple-Play Bandit Algorithm Applied to Recommender Systems.
Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

Algorithmes de bandit pour les systèmes de recommandation : le cas de multiples recommandations simultanées.
Proceedings of the CORIA 2015 - Conférence en Recherche d'Infomations et Applications, 2015

2014
Big data analytics - Retour vers le futur 3. De statisticien à data scientist.
Ingénierie des Systèmes d Inf., 2014

Big Data - Retour vers le Futur 3; De Statisticien à Data Scientist.
CoRR, 2014

On the Complexity of A/B Testing.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality.
J. Mach. Learn. Res., 2013

Informational confidence bounds for self-normalized averages and applications.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2012
On Bayesian Upper Confidence Bounds for Bandit Problems.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Optimal discovery with probabilistic expert advice.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds.
IEEE J. Sel. Top. Signal Process., 2011

The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond.
Proceedings of the COLT 2011, 2011

A Propp-Wilson perfect simulation scheme for processes with long memory
CoRR, 2011

On Upper-Confidence Bound Policies for Switching Bandit Problems.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
CoRR, 2010

Parametric Bandits: The Generalized Linear Case.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Optimism in reinforcement learning and Kullback-Leibler divergence.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
On approximate maximum-likelihood methods for blind identification: how to cope with the curse of dimensionality.
IEEE Trans. Signal Process., 2009

Coding on Countably Infinite Alphabets.
IEEE Trans. Inf. Theory, 2009

A Lower-Bound for the Maximin Redundancy in Pattern Coding.
Entropy, 2009

Regret Bounds for Opportunistic Channel Access
CoRR, 2009

2006
Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes.
IEEE Trans. Inf. Theory, 2006

Consistency of the Unlimited BIC Context Tree Estimator.
IEEE Trans. Inf. Theory, 2006

2002
An Event Spacing Experiment.
Proceedings of the 8th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC 2002), 2002


  Loading...