default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDorian Baudry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Dorian Baudry, Nadav Merlis, Mathieu Benjamin Molina, Hugo Richard, Vianney Perchet:
Multi-armed bandits with guaranteed revenue per arm. AISTATS 2024: 379-387- [i10]Nadav Merlis, Dorian Baudry, Vianney Perchet:
The Value of Reward Lookahead in Reinforcement Learning. CoRR abs/2403.11637 (2024) - [i9]Ziyad Benomar, Dorian Baudry, Vianney Perchet:
Lookback Prophet Inequalities. CoRR abs/2406.06805 (2024) - 2023
- [c7]Dorian Baudry, Fabien Pesquerel, Rémy Degenne, Odalric-Ambrym Maillard:
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits. NeurIPS 2023 - [i8]Dorian Baudry, Kazuya Suzuki, Junya Honda:
A General Recipe for the Analysis of Randomized Multi-Armed Bandit Algorithms. CoRR abs/2303.06058 (2023) - 2022
- [b1]Dorian Baudry:
Non-Parametric Algorithms for Multi-Armed Bandits. (Algorithmes Non-Paramétriques de Bandits Multi-Bras). University of Lille, France, 2022 - [c6]Dorian Baudry, Yoan Russac, Emilie Kaufmann:
Efficient Algorithms for Extreme Bandits. AISTATS 2022: 2210-2248 - [c5]Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann:
Top Two Algorithms Revisited. NeurIPS 2022 - [i7]Dorian Baudry, Yoan Russac, Emilie Kaufmann:
Efficient Algorithms for Extreme Bandits. CoRR abs/2203.10883 (2022) - [i6]Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann:
Top Two Algorithms Revisited. CoRR abs/2206.05979 (2022) - [i5]Romain Gautron
, Dorian Baudry, Myriam Adam, Gatien N. Falconnier, Marc Corbeels:
Towards an efficient and risk aware strategy for guiding farmers in identifying best crop management. CoRR abs/2210.04537 (2022) - 2021
- [c4]Dorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric Maillard:
Optimal Thompson Sampling strategies for support-aware CVaR bandits. ICML 2021: 716-726 - [c3]Dorian Baudry, Yoan Russac, Olivier Cappé:
On Limited-Memory Subsampling Strategies for Bandits. ICML 2021: 727-737 - [c2]Dorian Baudry, Patrick Saux, Odalric-Ambrym Maillard:
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits. NeurIPS 2021: 14029-14041 - [i4]Dorian Baudry, Yoan Russac, Olivier Cappé:
On Limited-Memory Subsampling Strategies for Bandits. CoRR abs/2106.10935 (2021) - [i3]Dorian Baudry, Patrick Saux, Odalric-Ambrym Maillard:
From Optimality to Robustness: Dirichlet Sampling Strategies in Stochastic Bandits. CoRR abs/2111.09724 (2021) - 2020
- [c1]Dorian Baudry, Emilie Kaufmann, Odalric-Ambrym Maillard:
Sub-sampling for Efficient Non-Parametric Bandit Exploration. NeurIPS 2020 - [i2]Dorian Baudry, Emilie Kaufmann, Odalric-Ambrym Maillard:
Sub-sampling for Efficient Non-Parametric Bandit Exploration. CoRR abs/2010.14323 (2020) - [i1]Dorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric-Ambrym Maillard:
Thompson Sampling for CVaR Bandits. CoRR abs/2012.05754 (2020)
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-07-09 21:16 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:
