Timothée Mathieu

Orcid: 0009-0006-3628-174X

According to our database1, Timothée Mathieu authored at least 10 papers between 2019 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
Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithms.
Trans. Mach. Learn. Res., 2024

Information Lower Bounds for Robust Mean Estimation.
CoRR, 2024

CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption.
Proceedings of the International Conference on Algorithmic Learning Theory, 2024

Statistical comparison in empirical computer science with minimal computation usage.
Proceedings of the 2nd ACM Conference on Reproducibility and Replicability, 2024

2023
AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents.
CoRR, 2023

2022
Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm.
CoRR, 2022

2020
Correction to: Robust classification via MOM minimization.
Mach. Learn., 2020

Robust classification via MOM minimization.
Mach. Learn., 2020

2019
Excess risk bounds in robust empirical risk minimization.
CoRR, 2019

MONK Outlier-Robust Mean Embedding Estimation by Median-of-Means.
Proceedings of the 36th International Conference on Machine Learning, 2019


  Loading...