default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurélien Garivier
Person information
- affiliation: Paul Sabatier University, Toulouse, France
- affiliation (former): Information Processing and Communication Laboratory, Telecom ParisTech
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Stochastic Direct Search Methods for Blind Resource Allocation. Trans. Mach. Learn. Res. 2024 (2024)- [c36]Élise Crepon, Aurélien Garivier, Wouter M. Koolen:
Sequential learning of the Pareto front for multi-objective bandits. AISTATS 2024: 3583-3591 - 2023
- [j18]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
On Adaptivity in Quantum Testing. Trans. Mach. Learn. Res. 2023 (2023) - [j17]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
On the Statistical Complexity of Estimation and Testing under Privacy Constraints. Trans. Mach. Learn. Res. 2023 (2023) - [j16]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
About the Cost of Central Privacy in Density Estimation. Trans. Mach. Learn. Res. 2023 (2023) - [c35]Antoine Barrier, Aurélien Garivier, Gilles Stoltz:
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits. ALT 2023: 136-181 - [c34]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Quantum Channel Certification with Incoherent Measurements. COLT 2023: 1822-1884 - [c33]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
Private Statistical Estimation of Many Quantiles. ICML 2023: 18399-18418 - [c32]Alexandre Marthe, Aurélien Garivier, Claire Vernade:
Beyond Average Return in Markov Decision Processes. NeurIPS 2023 - [i41]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
Private Statistical Estimation of Many Quantiles. CoRR abs/2302.06943 (2023) - [i40]Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Quantum Channel Certification with Incoherent Strategies. CoRR abs/2303.01188 (2023) - [i39]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
About the Cost of Global Privacy in Density Estimation. CoRR abs/2306.14535 (2023) - [i38]Alexandre Marthe, Aurélien Garivier, Claire Vernade:
Beyond Average Return in Markov Decision Processes. CoRR abs/2310.20266 (2023) - 2022
- [j15]Aurélien Garivier, Hédi Hadiji, Pierre Ménard, Gilles Stoltz:
KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints. J. Mach. Learn. Res. 23: 179:1-179:66 (2022) - [c31]Antoine Barrier, Aurélien Garivier, Tomás Kocák:
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits. AISTATS 2022: 10078-10109 - [c30]Aymen Al Marjani, Tomás Kocák, Aurélien Garivier:
On the Complexity of All ε-Best Arms Identification. ECML/PKDD (4) 2022: 317-332 - [i37]Aymen Al Marjani, Tomás Kocák, Aurélien Garivier:
On the complexity of All ε-Best Arms Identification. CoRR abs/2202.06280 (2022) - [i36]Clément Lalanne, Clément Gastaud, Nicolas Grislain, Aurélien Garivier, Rémi Gribonval:
Private Quantiles Estimation in the Presence of Atoms. CoRR abs/2202.08969 (2022) - [i35]Omar Fawzi
, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir:
Sequential algorithms for testing identity and closeness of distributions. CoRR abs/2205.06069 (2022) - [i34]Antoine Barrier, Aurélien Garivier, Gilles Stoltz:
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits. CoRR abs/2210.00895 (2022) - [i33]Clément Lalanne, Aurélien Garivier, Rémi Gribonval:
On the Statistical Complexity of Estimation and Testing under Privacy Constraints. CoRR abs/2210.02215 (2022) - [i32]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Regret Analysis of the Stochastic Direct Search Method for Blind Resource Allocation. CoRR abs/2210.05222 (2022) - 2021
- [c29]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Fast Rate Learning in Stochastic First Price Bidding. ACML 2021: 1754-1769 - [c28]Yoan Russac, Louis Faury, Olivier Cappé, Aurélien Garivier:
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting. AISTATS 2021: 658-666 - [c27]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Efficient Algorithms for Stochastic Repeated Second-price Auctions. ALT 2021: 99-150 - [c26]Tomás Kocák, Aurélien Garivier:
Epsilon Best Arm Identification in Spectral Bandits. IJCAI 2021: 2636-2642 - [c25]Aadil Oufkir, Omar Fawzi, Nicolas Flammarion, Aurélien Garivier:
Sequential Algorithms for Testing Closeness of Distributions. NeurIPS 2021: 11655-11664 - [c24]Yoan Russac, Christina Katsimerou, Dennis Bohle, Olivier Cappé, Aurélien Garivier, Wouter M. Koolen:
A/B/n Testing with Control in the Presence of Subpopulations. NeurIPS 2021: 25100-25110 - [c23]Aymen Al Marjani, Aurélien Garivier, Alexandre Proutière:
Navigating to the Best Policy in Markov Decision Processes. NeurIPS 2021: 25852-25864 - [i31]Aymen Al Marjani, Aurélien Garivier, Alexandre Proutière:
Navigating to the Best Policy in Markov Decision Processes. CoRR abs/2106.02847 (2021) - [i30]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Fast Rate Learning in Stochastic First Price Bidding. CoRR abs/2107.01835 (2021) - [i29]Yoan Russac, Christina Katsimerou, Dennis Bohle, Olivier Cappé, Aurélien Garivier, Wouter M. Koolen:
A/B/n Testing with Control in the Presence of Subpopulations. CoRR abs/2110.15573 (2021) - 2020
- [j14]Louis Béthune, Yacouba Kaloga, Pierre Borgnat, Aurélien Garivier, Amaury Habrard:
Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening. Algorithms 13(9): 206 (2020) - [j13]Léonard Torossian, Victor Picheny, Robert Faivre, Aurélien Garivier:
A review on quantile regression for stochastic computer experiments. Reliab. Eng. Syst. Saf. 201: 106858 (2020) - [c22]Tomás Kocák, Aurélien Garivier:
Best Arm Identification in Spectral Bandits. IJCAI 2020: 2220-2226 - [i28]Yoan Russac, Olivier Cappé, Aurélien Garivier:
Algorithms for Non-Stationary Generalized Linear Bandits. CoRR abs/2003.10113 (2020) - [i27]Tomás Kocák, Aurélien Garivier:
Best Arm Identification in Spectral Bandits. CoRR abs/2005.09841 (2020) - [i26]Louis Béthune, Yacouba Kaloga, Pierre Borgnat, Aurélien Garivier, Amaury Habrard:
Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening. CoRR abs/2007.03373 (2020) - [i25]Yoan Russac, Louis Faury, Olivier Cappé, Aurélien Garivier:
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting. CoRR abs/2011.00819 (2020) - [i24]Juliette Achddou, Olivier Cappé, Aurélien Garivier:
Efficient Algorithms for Stochastic Repeated Second-price Auctions. CoRR abs/2011.05072 (2020)
2010 – 2019
- 2019
- [j12]Aurélien Garivier, Pierre Ménard, Gilles Stoltz:
Explore First, Exploit Next: The True Shape of Regret in Bandit Problems. Math. Oper. Res. 44(2): 377-399 (2019) - [c21]Léonard Torossian, Aurélien Garivier, Victor Picheny:
$\mathcal{X}$-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks. ACML 2019: 252-267 - [c20]Aurélien Garivier, Satyen Kale:
Algorithmic Learning Theory 2019: Preface. ALT 2019: 1-2 - [e1]Aurélien Garivier, Satyen Kale:
Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA. Proceedings of Machine Learning Research 98, PMLR 2019 [contents] - [i23]Léonard Torossian, Victor Picheny, Robert Faivre, Aurélien Garivier:
A Review on Quantile Regression for Stochastic Computer Experiments. CoRR abs/1901.07874 (2019) - [i22]Léonard Torossian, Aurélien Garivier, Victor Picheny:
X-Armed Bandits: Optimizing Quantiles and Other Risks. CoRR abs/1904.08205 (2019) - 2018
- [c19]Mastane Achab, Stéphan Clémençon, Aurélien Garivier:
Profitable Bandits. ACML 2018: 694-709 - [c18]Grégoire Jauvion, Nicolas Grislain, Pascal Dkengne Sielenou, Aurélien Garivier, Sébastien Gerchinovitz:
Optimization of a SSP's Header Bidding Strategy using Thompson Sampling. KDD 2018: 425-432 - [c17]Emilie Kaufmann, Wouter M. Koolen, Aurélien Garivier:
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling. NeurIPS 2018: 6335-6345 - [i21]Mastane Achab, Stéphan Clémençon, Aurélien Garivier:
Profitable Bandits. CoRR abs/1805.02908 (2018) - [i20]Aurélien Garivier, Hédi Hadiji, Pierre Ménard, Gilles Stoltz:
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints. CoRR abs/1805.05071 (2018) - [i19]Emilie Kaufmann, Wouter M. Koolen, Aurélien Garivier:
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling. CoRR abs/1806.00973 (2018) - [i18]Grégoire Jauvion, Nicolas Grislain, Pascal Dkengne Sielenou, Aurélien Garivier, Sébastien Gerchinovitz:
Optimization of a SSP's Header Bidding Strategy using Thompson Sampling. CoRR abs/1807.03299 (2018) - [i17]Philippe C. Besse, Céline Castets-Renard, Aurélien Garivier, Jean-Michel Loubes:
Can everyday AI be ethical. Fairness of Machine Learning Algorithms. CoRR abs/1810.01729 (2018) - 2017
- [c16]Pierre Ménard, Aurélien Garivier:
A minimax and asymptotically optimal algorithm for stochastic bandits. ALT 2017: 223-237 - [c15]Mastane Achab, Stéphan Clémençon, Aurélien Garivier, Anne Sabourin, Claire Vernade:
Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond. ECML/PKDD (2) 2017: 389-404 - [i16]Emilie Kaufmann, Aurélien Garivier:
Learning the distribution with largest mean: two bandit frameworks. CoRR abs/1702.00001 (2017) - [i15]Pierre Ménard, Aurélien Garivier:
A minimax and asymptotically optimal algorithm for stochastic bandits. CoRR abs/1702.07211 (2017) - [i14]Mastane Achab, Stéphan Clémençon, Aurélien Garivier, Anne Sabourin, Claire Vernade:
Max K-armed bandit: On the ExtremeHunter algorithm and beyond. CoRR abs/1707.08820 (2017) - 2016
- [j11]Emilie Kaufmann, Olivier Cappé, Aurélien Garivier:
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models. J. Mach. Learn. Res. 17: 1:1-1:42 (2016) - [c14]Aurélien Garivier, Emilie Kaufmann:
Optimal Best Arm Identification with Fixed Confidence. COLT 2016: 998-1027 - [c13]Aurélien Garivier, Emilie Kaufmann, Wouter M. Koolen:
Maximin Action Identification: A New Bandit Framework for Games. COLT 2016: 1028-1050 - [c12]Aurélien Garivier, Tor Lattimore, Emilie Kaufmann:
On Explore-Then-Commit strategies. NIPS 2016: 784-792 - [i13]Aurélien Garivier, Emilie Kaufmann:
Optimal Best Arm Identification with Fixed Confidence. CoRR abs/1602.04589 (2016) - [i12]Aurélien Garivier, Emilie Kaufmann, Wouter M. Koolen:
Maximin Action Identification: A New Bandit Framework for Games. CoRR abs/1602.04676 (2016) - [i11]Aurélien Garivier, Pierre Ménard, Gilles Stoltz:
Explore First, Exploit Next: The True Shape of Regret in Bandit Problems. CoRR abs/1602.07182 (2016) - [i10]Aurélien Garivier, Emilie Kaufmann, Tor Lattimore:
On Explore-Then-Commit Strategies. CoRR abs/1605.08988 (2016) - 2015
- [j10]Jonathan Louëdec, Max Chevalier, Aurélien Garivier, Josiane Mothe:
Algorithmes de bandits pour la recommandation à tirages multiples. Document Numérique 18(2-3): 59-79 (2015) - [j9]Aurélien Garivier:
Perfect simulation of processes with long memory: A "coupling into and from the past" algorithm. Random Struct. Algorithms 46(2): 300-319 (2015) - [c11]Jonathan Louëdec, Max Chevalier, Aurélien Garivier, Josiane Mothe:
Algorithmes de bandit pour les systèmes de recommandation : le cas de multiples recommandations simultanées. CORIA 2015: 73-88 - [c10]Jonathan Louëdec, Max Chevalier, Josiane Mothe, Aurélien Garivier, Sébastien Gerchinovitz:
A Multiple-Play Bandit Algorithm Applied to Recommender Systems. FLAIRS 2015: 67-72 - 2014
- [j8]Philippe C. Besse, Aurélien Garivier, Jean-Michel Loubes:
Big data analytics - Retour vers le futur 3. De statisticien à data scientist. Ingénierie des Systèmes d Inf. 19(3): 93-105 (2014) - [c9]Emilie Kaufmann, Olivier Cappé, Aurélien Garivier:
On the Complexity of A/B Testing. COLT 2014: 461-481 - [i9]Philippe C. Besse, Aurélien Garivier, Jean-Michel Loubes:
Big Data - Retour vers le Futur 3; De Statisticien à Data Scientist. CoRR abs/1403.3758 (2014) - [i8]Emilie Kaufmann, Olivier Cappé, Aurélien Garivier:
On the Complexity of A/B Testing. CoRR abs/1405.3224 (2014) - [i7]Emilie Kaufmann, Olivier Cappé, Aurélien Garivier:
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models. CoRR abs/1407.4443 (2014) - 2013
- [j7]Sébastien Bubeck, Damien Ernst, Aurélien Garivier:
Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality. J. Mach. Learn. Res. 14(1): 601-623 (2013) - [c8]Aurélien Garivier:
Informational confidence bounds for self-normalized averages and applications. ITW 2013: 1-5 - 2012
- [c7]Sébastien Bubeck, Damien Ernst, Aurélien Garivier:
Optimal discovery with probabilistic expert advice. CDC 2012: 6808-6812 - [c6]Emilie Kaufmann, Olivier Cappé, Aurélien Garivier:
On Bayesian Upper Confidence Bounds for Bandit Problems. AISTATS 2012: 592-600 - [i6]Sébastien Bubeck, Damien Ernst, Aurélien Garivier:
Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality. CoRR abs/1207.5259 (2012) - 2011
- [j6]Sarah Filippi, Olivier Cappé, Aurélien Garivier:
Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds. IEEE J. Sel. Top. Signal Process. 5(1): 68-76 (2011) - [c5]Aurélien Garivier, Eric Moulines:
On Upper-Confidence Bound Policies for Switching Bandit Problems. ALT 2011: 174-188 - [c4]Aurélien Garivier, Olivier Cappé:
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond. COLT 2011: 359-376 - [i5]Aurélien Garivier, Olivier Cappé:
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond. CoRR abs/1102.2490 (2011) - [i4]Aurélien Garivier:
A Propp-Wilson perfect simulation scheme for processes with long memory. CoRR abs/1106.5971 (2011) - [i3]Sébastien Bubeck, Damien Ernst, Aurélien Garivier:
Optimal discovery with probabilistic expert advice. CoRR abs/1110.5447 (2011) - 2010
- [c3]Sarah Filippi, Olivier Cappé, Aurélien Garivier:
Optimism in reinforcement learning and Kullback-Leibler divergence. Allerton 2010: 115-122 - [c2]Sarah Filippi, Olivier Cappé, Aurélien Garivier, Csaba Szepesvári:
Parametric Bandits: The Generalized Linear Case. NIPS 2010: 586-594 - [i2]Sarah Filippi, Olivier Cappé, Aurélien Garivier:
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence. CoRR abs/1004.5229 (2010)
2000 – 2009
- 2009
- [j5]Aurélien Garivier:
A Lower-Bound for the Maximin Redundancy in Pattern Coding. Entropy 11(4): 634-642 (2009) - [j4]Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat:
Coding on Countably Infinite Alphabets. IEEE Trans. Inf. Theory 55(1): 358-373 (2009) - [j3]Steffen Barembruch, Aurélien Garivier, Eric Moulines:
On approximate maximum-likelihood methods for blind identification: how to cope with the curse of dimensionality. IEEE Trans. Signal Process. 57(11): 4247-4259 (2009) - [i1]Sarah Filippi, Olivier Cappé, Aurélien Garivier:
Regret Bounds for Opportunistic Channel Access. CoRR abs/0908.0319 (2009) - 2006
- [j2]Aurélien Garivier:
Consistency of the Unlimited BIC Context Tree Estimator. IEEE Trans. Inf. Theory 52(10): 4630-4635 (2006) - [j1]Aurélien Garivier:
Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes. IEEE Trans. Inf. Theory 52(12): 5579-5586 (2006) - 2002
- [c1]Mark R. Greenstreet, Anthony Winstanley, Aurélien Garivier:
An Event Spacing Experiment. ASYNC 2002: 47-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
