CESA BIANCHI, NICOLO' ANTONIO
CESA BIANCHI, NICOLO' ANTONIO
Dipartimento di Informatica Giovanni Degli Antoni
Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
2026 H. Qiu, M. Zhang, N. Cesa Bianchi
Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs
2026 N. Cesa Bianchi, J. Honda, Y. Kuroki, A. Miyauchi, L. Zierahn
Active Learning on Adversarially Corrupted Graphs
2026 M. Bressan, N. Cesa Bianchi, T. D'Orsi, E. Esposito, S. Lattanzi
Learning Conditional Averages
2026 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Online Linear Regression with Paid Stochastic Features
2026 N. Merlis, K. Jang, N. Cesa Bianchi
The role of transparency in repeated first-price auctions with unknown valuations
2026 N. Cesa Bianchi, T. Cesari, R. Colomboni, F. Fusco, S. Leonardi
Gradient-Variation Regret Bounds for Unconstrained Online Learning
2026 Y. Zhao, A. Jacobsen, N. Cesa Bianchi, P. Zhao
Dynamic Regret Reduces to Kernelized Static Regret
2025 A. Jacobsen, A. Rudi, F. Orabona, N. Cesa Bianchi
Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
2025 F. Di Gennaro, K. Eldowa, N. Cesa Bianchi
Market Making without Regret
2025 N. Cesa Bianchi, T. Cesari, R. Colomboni, L. Foscari, V. Pathak
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
Adaptive Maximization of Social Welfare
2025 N. Cesa Bianchi, R. Colomboni, M. Kasy
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs
2025 L. Zierahn, D. Van Der Hoeven, T. Lancewicki, A. Rosenberg, N.A. Cesa Bianchi
Clinical presentation and outcomes of pituitary apoplexy in patients with PitNETs: a real world Italian multicenter study
2025 M.F. Birtolo, F. Gatto, R.S. Auriemma, C.D. Somma, R. Arianna, D.C. Rossi, M. Sibilla, S. Grottoli, F. Ceccato, I. Tizianel, S. Cannavò, F.F. Angileri, R. Baldelli, F. Rota, M.R. Ambrosio, M. Bondanelli, S. Chiloiro, A. Bianchi, A. Mangone, G. Mantovani, G. Mazziotti, A. Lania
A Fine-grained Characterization of PAC Learnability
2025 M. Bressan, N. Brukhim, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Improved Regret Bounds for Bandits with Expert Advice
2025 N. Cesa Bianchi, K. Eldowa, E. Esposito, J. Olkhovskaya
Linear Bandits with Memory
2024 G. Clerici, P. Laforgue, N. Cesa Bianchi
Cooperative Online Learning with Feedback Graphs
2024 N. Cesa Bianchi, T. Cesari, R. Della Vecchia
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
2024 Y. Kuroki, A. Rumi, T. Tsuchiya, F. Vitale, N. Cesa Bianchi
Sum-max Submodular Bandits
2024 S. Pasteris, A. Rumi, F. Vitale, N. Cesa Bianchi