ESPOSITO, EMMANUEL
ESPOSITO, EMMANUEL
Dipartimento di Informatica Giovanni Degli Antoni
Improved Regret Bounds for Bandits with Expert Advice
2025 N. Cesa Bianchi, K. Eldowa, E. Esposito, J. Olkhovskaya
A Fine-grained Characterization of PAC Learnability
2025 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Of Dice and Games: A Theory of Generalized Boosting
2025 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
A Theory of Interpretable Approximations
2024 M. Bressan, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
ONLINE LEARNING, UNIFORM CONVERGENCE, AND A THEORY OF INTERPRETABILITY
2024 E. Esposito
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
2024 M. Bressan, E. Esposito, M. Thiessen
On the Minimax Regret for Online Learning with Feedback Graphs
2023 K. Eldowa, E. Esposito, T. Cesari, N. Cesa Bianchi
Delayed Bandits: When Do Intermediate Observations Help?
2023 E. Esposito, S. Masoudian, H. Qiu, D. VAN DER HOEVEN, N. Cesa-Bianchi, Y. Seldin
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
2022 E. Esposito, F. Fusco, D. van der Hoeven, N. Cesa Bianchi
RecSplit: Minimal Perfect Hashing via Recursive Splitting
2020 E. Esposito, T.M. Graf, S. Vigna