This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Nicolo Cesa-Bianchi | |
|---|---|
| Name | Nicolo Cesa-Bianchi |
| Birth date | 1949 |
| Birth place | Milan, Italy |
| Nationality | Italian |
| Fields | Computer science, Machine learning, Statistics |
| Workplaces | University of Milan, University of Pavia, University of California, Berkeley, University of California, Los Angeles, Microsoft Research |
| Alma mater | University of Milan |
| Doctoral advisor | Giorgio G. Porcelli |
| Known for | Theory of online learning, Predictive learning, Machine learning theory |
| Awards | Humboldt Research Award, ECCAI Fellowship, IEEE Fellow |
Nicolo Cesa-Bianchi Nicolo Cesa-Bianchi is an Italian computer scientist and scholar noted for contributions to online learning, statistical learning theory, and algorithmic game theory. He has held professorships at Italian universities and visiting positions at international institutions, influencing research in machine learning through foundational results, textbooks, and supervision of scholars. His work connects to developments at research centers and conferences across Europe and North America.
Cesa-Bianchi was born in Milan and studied at the University of Milan, where he completed undergraduate and doctoral studies in computer science and statistics. During his doctoral work he interacted with scholars at the Scuola Normale Superiore di Pisa and collaborated with researchers affiliated with the Italian National Research Council. His education coincided with developments at institutions such as Politecnico di Milano and exchanges with groups at ETH Zurich, École Polytechnique, and the University of Cambridge through visiting scholar programs.
He served on the faculty of the University of Milan and later at the University of Pavia, holding chairs in computer science and contributing to departments linked with CNR laboratories. Cesa-Bianchi has been a visiting researcher at University of California, Berkeley, Massachusetts Institute of Technology, Stanford University, and University College London, and has spent research periods at Microsoft Research and the French National Institute for Research in Digital Science and Technology. He participated in collaborations with the European Research Council and contributed to panels at conferences organized by NeurIPS, ICML, and COLT.
Cesa-Bianchi developed theoretical frameworks for online prediction and adversarial learning, connecting to the work of Littlestone, Vapnik, Haussler, Kearns, and Schapire. He coauthored influential results on regret bounds, expert advice aggregation, and sequential prediction that influenced subsequent research by Auer, Freund, Warmuth, Cesa-Bianchi's coauthors, and groups at Google Research, DeepMind, and Facebook AI Research. His research spans links to algorithmic aspects investigated at IBM Research, Bell Labs, and AT&T Labs; to statistical aspects studied at Columbia University, Princeton University, and New York University; and to applied perspectives developed with teams at Siemens and Thomson Reuters.
Key contributions include formalizing online convex optimization themes that intersect with results by Zinkevich and Nemirovsky and advancing methods related to ensemble learning that build on Breiman and Hastie. He has explored bandit algorithms in connection with works by Auer (2002), Bubeck, Cesa-Bianchi coauthors, and theoretical treatments reminiscent of studies at CNRS laboratories. His analyses influenced curriculum and research at departments including University of Oxford, Imperial College London, Technical University of Munich, and Karlsruhe Institute of Technology.
Cesa-Bianchi received recognition including a Humboldt Research Award and fellowship designations from bodies such as ECCAI and elevation to IEEE Fellow status. He has been invited to give plenary addresses at meetings organized by SIAM, IMS, and ECAI, and awarded visiting professorships by institutions like École Normale Supérieure, SISSA, and the Institute for Advanced Study. His honors link him to academies and societies including the Accademia dei Lincei and professional organizations such as ACM and IEEE.
- Cesa-Bianchi, N.; Lugosi, G. "Prediction, Learning, and Games." Monograph connecting to themes by Shannon, Kolmogorov, Wald, and later texts from Bousquet, Ben-David, and Mohri; used at MIT Press courses and cited in work at Harvard University and Yale University. - Cesa-Bianchi, N.; Lugosi, G.; Others: seminal papers on regret bounds published in proceedings of COLT and NeurIPS, cited alongside contributions by Freund, Schapire, Kivinen, and Warmuth. - Articles on bandit problems and online convex optimization appearing in journals associated with SIAM, Annals of Statistics, and conference proceedings from ICML and STOC, cross-referencing results by Auer, Bubeck, and Flaxman.
He supervised doctoral students who later joined faculties at institutions including University of Milan, Politecnico di Milano, University of California, Los Angeles, University of Toronto, EPFL, and École Polytechnique Fédérale de Lausanne. Cesa-Bianchi taught courses on online learning, statistical learning theory, and algorithms that integrated material from textbooks by Cormen, Leiserson, Rivest, Stein, and monographs used in curricula at ETH Zurich and Technical University of Denmark. His mentorship fostered collaborations with industry labs at Microsoft Research Cambridge, Google DeepMind, and startups spun out near Silicon Valley.
Category:Italian computer scientists Category:Machine learning researchers Category:University of Milan faculty