Emmanuel Esposito

According to our database, Emmanuel Esposito authored at least 16 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Learning Conditional Averages.

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen

CoRR, February, 2026

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory.

Emmanuel Esposito, Andrew Jacobsen, Hao Qiu, Mengxiao Zhang

CoRR, February, 2026

2025

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs.

Marco Bressan, Victor Chepoi, Emmanuel Esposito, Maximilian Thiessen

CoRR, June, 2025

Improved Regret Bounds for Bandits with Expert Advice.

Nicolò Cesa-Bianchi, Khaled Eldowa, Emmanuel Esposito, Julia Olkhovskaya

J. Artif. Intell. Res., 2025

An improved uniform convergence bound with fat-shattering dimension.

Roberto Colomboni, Emmanuel Esposito, Andrea Paudice

Inf. Process. Lett., 2025

When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses.

Antoine Moulin, Emmanuel Esposito, Dirk van der Hoeven

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Exploiting Curvature in Online Convex Optimization with Delayed Feedback.

Hao Qiu, Emmanuel Esposito, Mengxiao Zhang

Proceedings of the Forty-second International Conference on Machine Learning, 2025

A Fine-grained Characterization of PAC Learnability.

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Of Dice and Games: A Theory of Generalized Boosting.

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Online Learning, Uniform convergence, and a Theory of interpretability.

Emmanuel Esposito

PhD thesis, 2024

Efficient Algorithms for Learning Monophonic Halfspaces in Graphs.

Marco Bressan, Emmanuel Esposito, Maximilian Thiessen

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

A Theory of Interpretable Approximations.

Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

On the Minimax Regret for Online Learning with Feedback Graphs.

Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Delayed Bandits: When Do Intermediate Observations Help?

Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin

Proceedings of the International Conference on Machine Learning, 2023

2022

Learning on the Edge: Online Learning with Stochastic Feedback Graphs.

Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2020

RecSplit: Minimal Perfect Hashing via Recursive Splitting.

Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna

Proceedings of the 22nd Symposium on Algorithm Engineering and Experiments, 2020