Emmanuel Esposito

Orcid: 0000-0002-4748-3279

According to our database1, Emmanuel Esposito authored at least 13 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs.
CoRR, June, 2025

Exploiting Curvature in Online Convex Optimization with Delayed Feedback.
CoRR, June, 2025

When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses.
CoRR, June, 2025

Improved Regret Bounds for Bandits with Expert Advice.
J. Artif. Intell. Res., 2025

An improved uniform convergence bound with fat-shattering dimension.
Inf. Process. Lett., 2025

A Fine-grained Characterization of PAC Learnability.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Of Dice and Games: A Theory of Generalized Boosting.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

A Theory of Interpretable Approximations.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
On the Minimax Regret for Online Learning with Feedback Graphs.
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?
Proceedings of the International Conference on Machine Learning, 2023

2022
Learning on the Edge: Online Learning with Stochastic Feedback Graphs.
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.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020


  Loading...