Rémy Degenne

According to our database1, Rémy Degenne authored at least 22 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Information Lower Bounds for Robust Mean Estimation.
CoRR, 2024

2023
An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Non-Asymptotic Analysis of a UCB-based Top Two Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Formalization of Doob's Martingale Convergence Theorems in mathlib.
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

On the Existence of a Complexity in Fixed Budget Bandit Identification.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Dealing with Unknown Variances in Best-Arm Identification.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Choosing Answers in ε-Best-Answer Identification for Linear Bandits.
CoRR, 2022

On Elimination Strategies for Bandit Fixed-Confidence Identification.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Top Two Algorithms Revisited.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits.
Proceedings of the International Conference on Machine Learning, 2022

2021
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits.
CoRR, 2021

Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Structure Adaptive Algorithms for Stochastic Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

Gamification of Pure Exploration for Linear Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Non-Asymptotic Pure Exploration by Solving Games.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Pure Exploration with Multiple Correct Answers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Bridging the gap between regret minimization and best arm identification, with application to A/B tests.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Bandits with Side Observations: Bounded vs. Logarithmic Regret.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

2016
Combinatorial semi-bandit with known covariance.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Anytime optimal algorithms in stochastic multi-armed bandits.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2014
Accelerated gradient temporal difference learning algorithms.
Proceedings of the 2014 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, 2014


  Loading...