Nicolò Cesa-Bianchi

Nicolò Cesa-Bianchi

Università degli Studi di Milano

H-index: 56

Europe-Italy

About Nicolò Cesa-Bianchi

Nicolò Cesa-Bianchi, With an exceptional h-index of 56 and a recent h-index of 40 (since 2020), a distinguished researcher at Università degli Studi di Milano, specializes in the field of Machine Learning, Learning Theory, Online Learning, Multi-Armed Bandits.

His recent articles reflect a diverse array of research interests and contributions to the field:

Information Capacity Regret Bounds for Bandits with Mediator Feedback

Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning

On the minimax regret for online learning with feedback graphs

Bilateral trade: A regret minimization perspective

Regret Analysis of Bilateral Trade with a Smoothed Adversary

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits

Sum-max Submodular Bandits

Nonstochastic contextual combinatorial bandits

Nicolò Cesa-Bianchi Information

University

Position

Professor of Computer Science

Citations(all)

31550

Citations(since 2020)

15163

Cited By

22551

hIndex(all)

56

hIndex(since 2020)

40

i10Index(all)

118

i10Index(since 2020)

86

Email

University Profile Page

Università degli Studi di Milano

Google Scholar

View Google Scholar Profile

Nicolò Cesa-Bianchi Skills & Research Interests

Machine Learning

Learning Theory

Online Learning

Multi-Armed Bandits

Top articles of Nicolò Cesa-Bianchi

Title

Journal

Author(s)

Publication Date

Information Capacity Regret Bounds for Bandits with Mediator Feedback

arXiv preprint arXiv:2402.10282

Khaled Eldowa

Nicolò Cesa-Bianchi

Alberto Maria Metelli

Marcello Restelli

2024/2/15

Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning

Advances in Neural Information Processing Systems

Pier Giuseppe Sessa

Pierre Laforgue

Nicolò Cesa-Bianchi

Andreas Krause

2024/2/13

On the minimax regret for online learning with feedback graphs

Advances in Neural Information Processing Systems

Khaled Eldowa

Emmanuel Esposito

Tommaso Cesari

Nicolò Cesa-Bianchi

2024/2/13

Bilateral trade: A regret minimization perspective

Mathematics of Operations Research

Nicolò Cesa-Bianchi

Tommaso Cesari

Roberto Colomboni

Federico Fusco

Stefano Leonardi

2024/2

Regret Analysis of Bilateral Trade with a Smoothed Adversary

Nicolò Cesa-Bianchi

Tommaso Cesari

Roberto Colomboni

Federico Fusco

Stefano Leonardi

2024/1/9

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits

Yuko Kuroki

Alberto Rumi

Taira Tsuchiya

Fabio Vitale

Nicolò Cesa-Bianchi

2024/4/18

Sum-max Submodular Bandits

arXiv preprint arXiv:2311.05975

Stephen Pasteris

Alberto Rumi

Fabio Vitale

Nicolò Cesa-Bianchi

2023/11/10

Nonstochastic contextual combinatorial bandits

Lukas Zierahn

Dirk van der Hoeven

Nicolò Cesa-Bianchi

Gergely Neu

2023/4/11

Repeated bilateral trade against a smoothed adversary

Nicolò Cesa-Bianchi

Tommaso R Cesari

Roberto Colomboni

Federico Fusco

Stefano Leonardi

2023/7/12

Multitask Online Learning: Listen to the Neighborhood Buzz

arXiv preprint arXiv:2310.17385

Juliette Achddou

Nicolò Cesa-Bianchi

Pierre Laforgue

2023/10/26

Trading-off payments and accuracy in online classification with paid stochastic experts

Dirk Van Der Hoeven

Ciara Pike-Burke

Hao Qiu

Nicolo Cesa-Bianchi

2023/7/3

Adaptive maximization of social welfare

arXiv preprint arXiv:2310.09597

Nicolo Cesa-Bianchi

Roberto Colomboni

Maximilian Kasy

2023/10/14

Linear bandits with memory: from rotting to rising

arXiv preprint arXiv:2302.08345

Giulia Clerici

Pierre Laforgue

Nicolo Cesa-Bianchi

2023/2/16

Delayed bandits: when do intermediate observations help?

arXiv preprint arXiv:2305.19036

Emmanuel Esposito

Saeed Masoudian

Hao Qiu

Dirk van der Hoeven

Nicolò Cesa-Bianchi

...

2023/5/30

High-Probability Risk Bounds via Sequential Predictors

arXiv preprint arXiv:2308.07588

Dirk van der Hoeven

Nikita Zhivotovskiy

Nicolò Cesa-Bianchi

2023/8/15

Learning the Stackelberg Equilibrium in a Newsvendor Game

Nicolò Cesa-Bianchi

Tommaso Cesari

Takayuki Osogami

Marco Scarsini

Segev Wasserkrug

2023/5/30

The role of transparency in repeated first-price auctions with unknown valuations

arXiv preprint arXiv:2307.09478

Nicolo Cesa-Bianchi

Tommaso Cesari

Roberto Colomboni

Federico Fusco

Stefano Leonardi

2023/7/14

Information-theoretic regret bounds for bandits with fixed expert advice

Khaled Eldowa

Nicolò Cesa-Bianchi

Alberto Maria Metelli

Marcello Restelli

2023/4/23

A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs

Dirk van der Hoeven

Lukas Zierahn

Tal Lancewicki

Aviv Rosenberg

Nicoló Cesa-Bianchi

2023/7/12

A near-optimal best-of-both-worlds algorithm for online learning with feedback graphs

Advances in Neural Information Processing Systems

Chloé Rouyer

Dirk van der Hoeven

Nicolò Cesa-Bianchi

Yevgeny Seldin

2022/12/6

See List of Professors in Nicolò Cesa-Bianchi University(Università degli Studi di Milano)

Co-Authors

H-index: 189
David Haussler

David Haussler

University of California, Santa Cruz

H-index: 115
Noga Alon

Noga Alon

Tel Aviv University

H-index: 67
Gabor Lugosi

Gabor Lugosi

Universidad Pompeu Fabra

H-index: 58
Ohad Shamir

Ohad Shamir

Weizmann Institute of Science

H-index: 52
Yoav Freund

Yoav Freund

University of California, San Diego

H-index: 40
Peter Auer

Peter Auer

Montanuniversität Leoben

academic-engine