An Event Spacing Experiment. - Mark R. Greenstreet; Anthony Winstanley; Aurélien Garivier (ASYNC, 2002)

Consistency of the Unlimited BIC Context Tree Estimator. - Aurélien Garivier (IEEE Trans. Inf. Theory, 2006)

Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes. - Aurélien Garivier (IEEE Trans. Inf. Theory, 2006)

Regret Bounds for Opportunistic Channel Access - Sarah Filippi; Olivier Cappé; Aurélien Garivier (CoRR, 2009)

A Lower-Bound for the Maximin Redundancy in Pattern Coding. - Aurélien Garivier (Entropy, 2009)

Coding on Countably Infinite Alphabets. - Stéphane Boucheron; Aurélien Garivier; Elisabeth Gassiat (IEEE Trans. Inf. Theory, 2009)

On approximate maximum-likelihood methods for blind identification: how to cope with the curse of dimensionality. - Steffen Barembruch; Aurélien Garivier; Eric Moulines (IEEE Trans. Signal Process., 2009)

Optimism in reinforcement learning and Kullback-Leibler divergence. - Sarah Filippi; Olivier Cappé; Aurélien Garivier (Allerton, 2010)

Parametric Bandits: The Generalized Linear Case. - Sarah Filippi; Olivier Cappé; Aurélien Garivier; Csaba Szepesvári (NIPS, 2010)

Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence - Sarah Filippi; Olivier Cappé; Aurélien Garivier (CoRR, 2010)

On Upper-Confidence Bound Policies for Switching Bandit Problems. - Aurélien Garivier; Eric Moulines (ALT, 2011)

A Propp-Wilson perfect simulation scheme for processes with long memory - Aurélien Garivier (CoRR, 2011)

The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond. - Aurélien Garivier; Olivier Cappé (COLT, 2011)

Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds. - Sarah Filippi; Olivier Cappé; Aurélien Garivier (IEEE J. Sel. Top. Signal Process., 2011)

Optimal discovery with probabilistic expert advice. - Sébastien Bubeck; Damien Ernst; Aurélien Garivier (CDC, 2012)

On Bayesian Upper Confidence Bounds for Bandit Problems. - Emilie Kaufmann; Olivier Cappé; Aurélien Garivier (AISTATS, 2012)

Informational confidence bounds for self-normalized averages and applications. - Aurélien Garivier (ITW, 2013)

Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality. - Sébastien Bubeck; Damien Ernst; Aurélien Garivier (J. Mach. Learn. Res., 2013)

On the Complexity of A/B Testing. - Emilie Kaufmann; Olivier Cappé; Aurélien Garivier (COLT, 2014)

Big Data - Retour vers le Futur 3; De Statisticien à Data Scientist. - Philippe C. Besse; Aurélien Garivier; Jean-Michel Loubes (CoRR, 2014)

Big data analytics - Retour vers le futur 3. De statisticien à data scientist. - Philippe C. Besse; Aurélien Garivier; Jean-Michel Loubes (Ingénierie des Systèmes d Inf., 2014)

Algorithmes de bandit pour les systèmes de recommandation : le cas de multiples recommandations simultanées. - Jonathan Louëdec; Max Chevalier; Aurélien Garivier; Josiane Mothe (CORIA, 2015)

A Multiple-Play Bandit Algorithm Applied to Recommender Systems. - Jonathan Louëdec; Max Chevalier; Josiane Mothe; Aurélien Garivier; Sébastien Gerchinovitz (FLAIRS, 2015)

Algorithmes de bandits pour la recommandation à tirages multiples. - Jonathan Louëdec; Max Chevalier; Aurélien Garivier; Josiane Mothe (Document Numérique, 2015)

Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm. - Aurélien Garivier (Random Struct. Algorithms, 2015)

Optimal Best Arm Identification with Fixed Confidence. - Aurélien Garivier; Emilie Kaufmann (COLT, 2016)

Maximin Action Identification: A New Bandit Framework for Games. - Aurélien Garivier; Emilie Kaufmann; Wouter M. Koolen (COLT, 2016)

On Explore-Then-Commit strategies. - Aurélien Garivier; Tor Lattimore; Emilie Kaufmann (NIPS, 2016)

On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models. - Emilie Kaufmann; Olivier Cappé; Aurélien Garivier (J. Mach. Learn. Res., 2016)

A minimax and asymptotically optimal algorithm for stochastic bandits. - Pierre Ménard; Aurélien Garivier (ALT, 2017)

Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond. - Mastane Achab; Stéphan Clémençon; Aurélien Garivier; Anne Sabourin; Claire Vernade (ECML/PKDD (2), 2017)

Learning the distribution with largest mean: two bandit frameworks. - Emilie Kaufmann; Aurélien Garivier (CoRR, 2017)

Profitable Bandits. - Mastane Achab; Stéphan Clémençon; Aurélien Garivier (ACML, 2018)

Optimization of a SSP's Header Bidding Strategy using Thompson Sampling. - Grégoire Jauvion; Nicolas Grislain; Pascal Dkengne Sielenou; Aurélien Garivier; Sébastien Gerchinovitz (KDD, 2018)

Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling. - Emilie Kaufmann; Wouter M. Koolen; Aurélien Garivier (NeurIPS, 2018)

Can everyday AI be ethical. Fairness of Machine Learning Algorithms. - Philippe C. Besse; Céline Castets-Renard; Aurélien Garivier; Jean-Michel Loubes (CoRR, 2018)

$ mathcal{X}$-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks. - Léonard Torossian; Aurélien Garivier; Victor Picheny (ACML, 2019)

Algorithmic Learning Theory 2019: Preface. - Aurélien Garivier; Satyen Kale (ALT, 2019)

X-Armed Bandits: Optimizing Quantiles and Other Risks. - Léonard Torossian; Aurélien Garivier; Victor Picheny (CoRR, 2019)

Explore First, Exploit Next: The True Shape of Regret in Bandit Problems. - Aurélien Garivier; Pierre Ménard; Gilles Stoltz (Math. Oper. Res., 2019)

Best Arm Identification in Spectral Bandits. - Tomás Kocák; Aurélien Garivier (IJCAI, 2020)

Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening. - Louis Béthune; Yacouba Kaloga; Pierre Borgnat; Aurélien Garivier; Amaury Habrard (Algorithms, 2020)

Algorithms for Non-Stationary Generalized Linear Bandits. - Yoan Russac; Olivier Cappé; Aurélien Garivier (CoRR, 2020)

A review on quantile regression for stochastic computer experiments. - Léonard Torossian; Victor Picheny; Robert Faivre; Aurélien Garivier (Reliab. Eng. Syst. Saf., 2020)

Fast Rate Learning in Stochastic First Price Bidding. - Juliette Achddou; Olivier Cappé; Aurélien Garivier (ACML, 2021)

Self-Concordant Analysis of Generalized Linear Bandits with Forgetting. - Yoan Russac; Louis Faury; Olivier Cappé; Aurélien Garivier (AISTATS, 2021)

Efficient Algorithms for Stochastic Repeated Second-price Auctions. - Juliette Achddou; Olivier Cappé; Aurélien Garivier (ALT, 2021)

Epsilon Best Arm Identification in Spectral Bandits. - Tomás Kocák; Aurélien Garivier (IJCAI, 2021)

Navigating to the Best Policy in Markov Decision Processes. - Aymen Al Marjani; Aurélien Garivier; Alexandre Proutière (NeurIPS, 2021)

Sequential Algorithms for Testing Closeness of Distributions. - Aadil Oufkir; Omar Fawzi; Nicolas Flammarion; Aurélien Garivier (NeurIPS, 2021)

A/B/n Testing with Control in the Presence of Subpopulations. - Yoan Russac; Christina Katsimerou; Dennis Bohle; Olivier Cappé; Aurélien Garivier; Wouter M. Koolen (NeurIPS, 2021)

A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits. - Antoine Barrier; Aurélien Garivier; Tomás Kocák (AISTATS, 2022)

On the Complexity of All ε-Best Arms Identification. - Aymen Al Marjani; Tomás Kocák; Aurélien Garivier (ECML/PKDD (4), 2022)

Private Quantiles Estimation in the Presence of Atoms. - Clément Lalanne; Clément Gastaud; Nicolas Grislain; Aurélien Garivier; Rémi Gribonval (CoRR, 2022)

Sequential algorithms for testing identity and closeness of distributions. - Omar Fawzi; Nicolas Flammarion; Aurélien Garivier; Aadil Oufkir (CoRR, 2022)

Regret Analysis of the Stochastic Direct Search Method for Blind Resource Allocation. - Juliette Achddou; Olivier Cappé; Aurélien Garivier (CoRR, 2022)

KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints. - Aurélien Garivier; Hédi Hadiji; Pierre Ménard; Gilles Stoltz (J. Mach. Learn. Res., 2022)

On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits. - Antoine Barrier; Aurélien Garivier; Gilles Stoltz (ALT, 2023)

Quantum Channel Certification with Incoherent Measurements. - Omar Fawzi; Nicolas Flammarion; Aurélien Garivier; Aadil Oufkir (COLT, 2023)

Private Statistical Estimation of Many Quantiles. - Clément Lalanne; Aurélien Garivier; Rémi Gribonval (ICML, 2023)

Beyond Average Return in Markov Decision Processes. - Alexandre Marthe; Aurélien Garivier; Claire Vernade (NeurIPS, 2023)

Quantum Channel Certification with Incoherent Strategies. - Omar Fawzi; Nicolas Flammarion; Aurélien Garivier; Aadil Oufkir (CoRR, 2023)

About the Cost of Global Privacy in Density Estimation. - Clément Lalanne; Aurélien Garivier; Rémi Gribonval (CoRR, 2023)

On Adaptivity in Quantum Testing. - Omar Fawzi; Nicolas Flammarion; Aurélien Garivier; Aadil Oufkir (Trans. Mach. Learn. Res., 2023)

On the Statistical Complexity of Estimation and Testing under Privacy Constraints. - Clément Lalanne; Aurélien Garivier; Rémi Gribonval (Trans. Mach. Learn. Res., 2023)

About the Cost of Central Privacy in Density Estimation. - Clément Lalanne; Aurélien Garivier; Rémi Gribonval (Trans. Mach. Learn. Res., 2023)

Sequential learning of the Pareto front for multi-objective bandits. - Élise Crepon; Aurélien Garivier; Wouter M. Koolen (AISTATS, 2024)

Stochastic Direct Search Methods for Blind Resource Allocation. - Juliette Achddou; Olivier Cappé; Aurélien Garivier (Trans. Mach. Learn. Res., 2024)

Identifying the Best Transition Law. - Mehrasa Ahmadipour; Élise Crepon; Aurélien Garivier (CoRR, 2025)

Efficient Risk-sensitive Planning via Entropic Risk Measures. - Alexandre Marthe; Samuel Bounan; Aurélien Garivier; Claire Vernade (CoRR, 2025)