default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémy Degenne
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i21]Rémy Degenne, Timothée Mathieu:
Information Lower Bounds for Robust Mean Estimation. CoRR abs/2403.01892 (2024)- [i20]Adrienne Tuynman, Rémy Degenne, Emilie Kaufmann:
Finding good policies in average-reward Markov Decision Processes without prior knowledge. CoRR abs/2405.17108 (2024) - [i19]Riccardo Poiani, Rémy Degenne, Emilie Kaufmann, Alberto Maria Metelli, Marcello Restelli:
Optimal Multi-Fidelity Best-Arm Identification. CoRR abs/2406.03033 (2024) - [i18]Riccardo Poiani, Marc Jourdan, Emilie Kaufmann, Rémy Degenne:
Best-Arm Identification in Unimodal Bandits. CoRR abs/2411.01898 (2024) - 2023
- [c19]Marc Jourdan, Rémy Degenne, Emilie Kaufmann:
Dealing with Unknown Variances in Best-Arm Identification. ALT 2023: 776-849 - [c18]Rémy Degenne:
On the Existence of a Complexity in Fixed Budget Bandit Identification. COLT 2023: 1131-1154 - [c17]Kexing Ying, Rémy Degenne:
A Formalization of Doob's Martingale Convergence Theorems in mathlib. CPP 2023: 334-347 - [c16]Dorian Baudry, Fabien Pesquerel, Rémy Degenne, Odalric-Ambrym Maillard:
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits. NeurIPS 2023 - [c15]Marc Jourdan, Rémy Degenne:
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm. NeurIPS 2023 - [c14]Marc Jourdan, Rémy Degenne, Emilie Kaufmann:
An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond. NeurIPS 2023 - [i17]Rémy Degenne:
On the Existence of a Complexity in Fixed Budget Bandit Identification. CoRR abs/2303.09468 (2023) - [i16]Marc Jourdan, Rémy Degenne, Emilie Kaufmann:
An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond. CoRR abs/2305.16041 (2023) - 2022
- [c13]Marc Jourdan, Rémy Degenne:
Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits. ICML 2022: 10384-10430 - [c12]Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann:
Top Two Algorithms Revisited. NeurIPS 2022 - [c11]Andrea Tirinzoni, Rémy Degenne:
On Elimination Strategies for Bandit Fixed-Confidence Identification. NeurIPS 2022 - [i15]Andrea Tirinzoni, Rémy Degenne:
On Elimination Strategies for Bandit Fixed-Confidence Identification. CoRR abs/2205.10936 (2022) - [i14]Marc Jourdan, Rémy Degenne:
Choosing Answers in ε-Best-Answer Identification for Linear Bandits. CoRR abs/2206.04456 (2022) - [i13]Marc Jourdan, Rémy Degenne, Dorian Baudry, Rianne de Heide, Emilie Kaufmann:
Top Two Algorithms Revisited. CoRR abs/2206.05979 (2022) - [i12]Marc Jourdan, Rémy Degenne, Emilie Kaufmann:
Dealing with Unknown Variances in Best-Arm Identification. CoRR abs/2210.00974 (2022) - [i11]Marc Jourdan, Rémy Degenne:
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm. CoRR abs/2210.05431 (2022) - [i10]Kexing Ying, Rémy Degenne:
A Formalization of Doob's Martingale Convergence Theorems in mathlib. CoRR abs/2212.05578 (2022) - 2021
- [c10]Clémence Réda, Andrea Tirinzoni, Rémy Degenne:
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification. NeurIPS 2021: 25489-25501 - [i9]Reda Ouhamma, Rémy Degenne, Pierre Gaillard, Vianney Perchet:
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. CoRR abs/2110.09133 (2021) - [i8]Clémence Réda, Andrea Tirinzoni, Rémy Degenne:
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification. CoRR abs/2111.01479 (2021) - 2020
- [c9]Rémy Degenne, Pierre Ménard, Xuedong Shang, Michal Valko:
Gamification of Pure Exploration for Linear Bandits. ICML 2020: 2432-2442 - [c8]Rémy Degenne, Han Shao, Wouter M. Koolen:
Structure Adaptive Algorithms for Stochastic Bandits. ICML 2020: 2443-2452 - [i7]Rémy Degenne, Pierre Ménard, Xuedong Shang, Michal Valko:
Gamification of Pure Exploration for Linear Bandits. CoRR abs/2007.00953 (2020) - [i6]Rémy Degenne, Han Shao, Wouter M. Koolen:
Structure Adaptive Algorithms for Stochastic Bandits. CoRR abs/2007.00969 (2020)
2010 – 2019
- 2019
- [c7]Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet:
Bridging the gap between regret minimization and best arm identification, with application to A/B tests. AISTATS 2019: 1988-1996 - [c6]Rémy Degenne, Wouter M. Koolen, Pierre Ménard:
Non-Asymptotic Pure Exploration by Solving Games. NeurIPS 2019: 14465-14474 - [c5]Rémy Degenne, Wouter M. Koolen:
Pure Exploration with Multiple Correct Answers. NeurIPS 2019: 14564-14573 - [i5]Rémy Degenne, Wouter M. Koolen:
Pure Exploration with Multiple Correct Answers. CoRR abs/1902.03475 (2019) - [i4]Rémy Degenne, Wouter M. Koolen, Pierre Ménard:
Non-Asymptotic Pure Exploration by Solving Games. CoRR abs/1906.10431 (2019) - 2018
- [c4]Rémy Degenne, Evrard Garcelon, Vianney Perchet:
Bandits with Side Observations: Bounded vs. Logarithmic Regret. UAI 2018: 467-476 - [i3]Rémy Degenne, Evrard Garcelon, Vianney Perchet:
Bandits with Side Observations: Bounded vs. Logarithmic Regret. CoRR abs/1807.03558 (2018) - [i2]Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet:
Bridging the gap between regret minimization and best arm identification, with application to A/B tests. CoRR abs/1810.04088 (2018) - 2016
- [c3]Rémy Degenne, Vianney Perchet:
Anytime optimal algorithms in stochastic multi-armed bandits. ICML 2016: 1587-1595 - [c2]Rémy Degenne, Vianney Perchet:
Combinatorial semi-bandit with known covariance. NIPS 2016: 2964-2972 - [i1]Rémy Degenne, Vianney Perchet:
Combinatorial semi-bandit with known covariance. CoRR abs/1612.01859 (2016) - 2014
- [c1]Dominik Meyer, Rémy Degenne, Ahmed Omrane, Hao Shen:
Accelerated gradient temporal difference learning algorithms. ADPRL 2014: 1-8
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 2025-01-09 13:01 CET 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:
