2023 - Research.com Computer Science in Italy Leader Award
Nicolò Cesa-Bianchi focuses on Algorithm, Regret, Mathematical optimization, Perceptron and Artificial intelligence. His Regret research is multidisciplinary, incorporating elements of Repeated game and Time horizon. His studies deal with areas such as Stochastic process and Multi-armed bandit as well as Mathematical optimization.
His Multi-armed bandit research integrates issues from Thompson sampling, Stochastic game and Reinforcement learning. His work deals with themes such as Monte Carlo tree search and General game playing, which intersect with Thompson sampling. The Artificial intelligence study combines topics in areas such as Machine learning, General theorem and Pattern recognition.
His primary areas of study are Regret, Artificial intelligence, Algorithm, Mathematical optimization and Machine learning. His research integrates issues of Theoretical computer science, Minimax and Combinatorics in his study of Regret. His Algorithm study deals with Perceptron intersecting with Support vector machine.
His Mathematical optimization research incorporates elements of Common value auction, Multi-armed bandit and Reinforcement learning. The concepts of his Multi-armed bandit study are interwoven with issues in Stochastic process, Stochastic game and Statistical assumption. His Machine learning study integrates concerns from other disciplines, such as Data mining and Online algorithm.
His primary scientific interests are in Regret, Combinatorics, Mathematical optimization, Artificial intelligence and Order. He performs multidisciplinary studies into Regret and Online learning in his work. His Mathematical optimization study combines topics from a wide range of disciplines, such as Telecommunications network, Reduction, Multi-armed bandit and Random variable.
His Artificial intelligence research is multidisciplinary, incorporating perspectives in Machine learning, Regression and Pattern recognition. His Machine learning study which covers Data mining that intersects with Data stream. He works mostly in the field of Time horizon, limiting it down to topics relating to Adversarial system and, in certain cases, Algorithm, as a part of the same area of interest.
Nicolò Cesa-Bianchi mainly investigates Regret, Mathematical optimization, Artificial intelligence, Online learning and Order. His work carried out in the field of Regret brings together such families of science as Discrete mathematics, Independence number, Winnow and Combinatorics. His work in Mathematical optimization covers topics such as Common value auction which are related to areas like Nonparametric statistics.
He combines subjects such as Mathematical economics and Machine learning with his study of Artificial intelligence. Nicolò Cesa-Bianchi interconnects Bounding overwatch and Synthetic data in the investigation of issues within Machine learning. His Theoretical computer science research includes elements of Graph, Computation and Dimension.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Finite-time Analysis of the Multiarmed Bandit Problem
Peter Auer;Nicolò Cesa-Bianchi;Paul Fischer.
Machine Learning (2002)
Prediction, learning, and games
Nicolo Cesa-Bianchi;Gabor Lugosi.
(2006)
Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems
Sébastien Bubeck;Nicolò Cesa-Bianchi.
(2012)
The Nonstochastic Multiarmed Bandit Problem
Peter Auer;Nicolò Cesa-Bianchi;Yoav Freund;Robert E. Schapire.
SIAM Journal on Computing (2003)
Gambling in a rigged casino: The adversarial multi-armed bandit problem
P. Auer;N. Cesa-Bianchi;Y. Freund;R. Schapire.
Research Papers in Economics (2010)
How to use expert advice
Nicolò Cesa-Bianchi;Yoav Freund;David Haussler;David P. Helmbold.
Journal of the ACM (1997)
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi;A. Conconi;C. Gentile.
IEEE Transactions on Information Theory (2004)
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon;Shai Ben-David;Nicolò Cesa-Bianchi;David Haussler.
Journal of the ACM (1997)
Combinatorial bandits
Nicolò Cesa-Bianchi;GáBor Lugosi.
Journal of Computer and System Sciences (2012)
Regret Minimization for Reserve Prices in Second-Price Auctions
Nicolò Cesa-Bianchi;Claudio Gentile;Yishay Mansour.
IEEE Transactions on Information Theory (2015)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Google (United States)
Pompeu Fabra University
Tel Aviv University
University of Leoben
Weizmann Institute of Science
Tel Aviv University
University College London
University of California, San Diego
Microsoft (United States)
Hebrew University of Jerusalem
Google (United States)
National Taiwan University
University of Seville
Lyon College
Saga University
University College London
University of Colorado Boulder
Commonwealth Scientific and Industrial Research Organisation
University of Lausanne
Google (United States)
West Virginia University
Duke University
Lund University
Memorial Sloan Kettering Cancer Center
Pennsylvania State University
University of Paris-Saclay