Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Algorithms for Conservative Exploration in Bandits.

E. Garcelon, M. Ghavamzadeh, A. Lazaric, and M. Pirotta. AAAI, page 3962-3969. AAAI Press, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Evrard

James Evrard

Matthieu Evrard

Other publications of authors with the same name

A Unified Framework for Conservative Exploration.Y. Yang, T. Wu, H. Zhong, E. Garcelon, M. Pirotta, A. Lazaric, L. Wang, and S. Du. CoRR, (2021)Adversarial Attacks on Linear Contextual Bandits.E. Garcelon, B. Rozière, L. Meunier, J. Tarbouriech, O. Teytaud, A. Lazaric, and M. Pirotta. NeurIPS, (2020)No-Regret Exploration in Goal-Oriented Reinforcement Learning.J. Tarbouriech, E. Garcelon, M. Valko, M. Pirotta, and A. Lazaric. CoRR, (2019)Bandits with Side Observations: Bounded vs. Logarithmic Regret.R. Degenne, E. Garcelon, and V. Perchet. UAI, page 467-476. AUAI Press, (2018)Top K Ranking for Multi-Armed Bandit with Noisy Evaluations.E. Garcelon, V. Avadhanula, A. Lazaric, and M. Pirotta. AISTATS, volume 151 of Proceedings of Machine Learning Research, page 6242-6269. PMLR, (2022)Improved Algorithms for Conservative Exploration in Bandits.E. Garcelon, M. Ghavamzadeh, A. Lazaric, and M. Pirotta. AAAI, page 3962-3969. AAAI Press, (2020)Privacy Amplification via Shuffling for Linear Contextual Bandits.E. Garcelon, K. Chaudhuri, V. Perchet, and M. Pirotta. ALT, volume 167 of Proceedings of Machine Learning Research, page 381-407. PMLR, (2022)Local Differential Privacy for Regret Minimization in Reinforcement Learning.E. Garcelon, V. Perchet, C. Pike-Burke, and M. Pirotta. NeurIPS, page 10561-10573. (2021)A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning.Y. Yang, T. Wu, H. Zhong, E. Garcelon, M. Pirotta, A. Lazaric, L. Wang, and S. Du. ICLR, OpenReview.net, (2022)Conservative Exploration in Reinforcement Learning.E. Garcelon, M. Ghavamzadeh, A. Lazaric, and M. Pirotta. AISTATS, volume 108 of Proceedings of Machine Learning Research, page 1431-1441. PMLR, (2020)

BibSonomy

Disambiguation of "Garcelon, Evrard"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Algorithms for Conservative Exploration in Bandits.

Please choose a person to relate this publication to

Paul Evrard

James Evrard

Matthieu Evrard

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Garcelon, Evrard"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Improved Algorithms for Conservative Exploration in Bandits.

Please choose a person to relate this publication to

Paul Evrard

James Evrard

Matthieu Evrard

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Improved Algorithms for Conservative Exploration in Bandits.