Ikuti
Emmanuel Esposito
Emmanuel Esposito
Postdoctoral Researcher, Università degli Studi di Milano
Email yang diverifikasi di unimi.it - Beranda
Judul
Dikutip oleh
Dikutip oleh
Tahun
Recsplit: Minimal perfect hashing via recursive splitting
E Esposito, TM Graf, S Vigna
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020
452020
Learning on the edge: Online learning with stochastic feedback graphs
E Esposito, F Fusco, D van der Hoeven, N Cesa-Bianchi
Advances in Neural Information Processing Systems 35, 34776-34788, 2022
142022
On the minimax regret for online learning with feedback graphs
K Eldowa, E Esposito, T Cesari, N Cesa-Bianchi
Advances in Neural Information Processing Systems 36, 2024
102024
An improved uniform convergence bound with fat-shattering dimension
R Colomboni, E Esposito, A Paudice
Information Processing Letters 188, 106539, 2025
42025
Efficient algorithms for learning monophonic halfspaces in graphs
M Bressan, E Esposito, M Thiessen
The Thirty Seventh Annual Conference on Learning Theory, 669-696, 2024
42024
A Theory of Interpretable Approximations
M Bressan, N Cesa-Bianchi, E Esposito, Y Mansour, S Moran, M Thiessen
The Thirty Seventh Annual Conference on Learning Theory, 648-668, 2024
22024
Improved regret bounds for bandits with expert advice
N Cesa-Bianchi, K Eldowa, E Esposito, J Olkhovskaya
arXiv preprint arXiv:2406.16802, 2024
22024
Delayed Bandits: When Do Intermediate Observations Help?
E Esposito, S Masoudian, H Qiu, D van der Hoeven, N Cesa-Bianchi, ...
International Conference on Machine Learning, 9374-9395, 2023
22023
Of Dice and Games: A Theory of Generalized Boosting
M Bressan, N Brukhim, N Cesa-Bianchi, E Esposito, Y Mansour, S Moran, ...
arXiv preprint arXiv:2412.08012, 2024
2024
Online Learning, Uniform Convergence, and a Theory of Interpretability
E Esposito
Università degli Studi di Milano, 2024
2024
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–10