Follow
Hedi HADIJI
Hedi HADIJI
Verified email at centralesupelec.fr - Homepage
Title
Cited by
Cited by
Year
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints
A Garivier, H Hadiji, P Menard, G Stoltz
Journal of Machine Learning Research 23 (179), 1-66, 2022
402022
Polynomial cost of adaptation for x-armed bandits
H Hadiji
Advances in Neural Information Processing Systems, 2019, 2019
152019
Adaptation to the range in k-armed bandits
H Hadiji, G Stoltz
Journal of Machine Learning Research 24 (13), 1-33, 2023
102023
Between stochastic and adversarial online convex optimization: Improved regret bounds via smoothness
S Sachs, H Hadiji, T van Erven, C Guzmán
Advances in Neural Information Processing Systems 35, 691-702, 2022
92022
Scale-free Unconstrained Online Learning for Curved Losses
JJ Mayo, H Hadiji, T van Erven
Conference on Learning Theory, 2022
82022
Accelerated rates between stochastic and adversarial online convex optimization
S Sachs, H Hadiji, T van Erven, C Guzman
arXiv preprint arXiv:2303.03272, 2023
32023
Distributed online learning for joint regret with communication constraints
D Van der Hoeven, H Hadiji, T van Erven
International Conference on Algorithmic Learning Theory, 1003-1042, 2022
32022
On some adaptivity questions in stochastic multi-armed bandits
H Hadiji
Université Paris-Saclay, 2020
12020
Diversity-Preserving K-Armed Bandits, Revisited
H Hadiji, S Gerchinovitz, JM Loubes, G Stoltz
arXiv preprint arXiv:2010.01874, 2020
12020
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
H Hadiji, S Sachs, T van Erven, WM Koolen
Advances in Neural Information Processing Systems 36, 2024
2024
KL-UCB-switch: un nouvel algorithme de bandit asymptotiquement optimal et minimax optimal
H Hadiji, A Garivier, P Ménard, G Stoltz
The system can't perform the operation now. Try again later.
Articles 1–11