N
Nicolò Cesa-Bianchi
Researcher at University of Milan
Publications - 241
Citations - 25892
Nicolò Cesa-Bianchi is an academic researcher from University of Milan. The author has contributed to research in topics: Regret & Computer science. The author has an hindex of 51, co-authored 225 publications receiving 22383 citations. Previous affiliations of Nicolò Cesa-Bianchi include Graz University of Technology & University of California, Santa Cruz.
Papers
More filters
Journal ArticleDOI
Finite-time Analysis of the Multiarmed Bandit Problem
TL;DR: This work shows that the optimal logarithmic regret is also achievable uniformly over time, with simple and efficient policies, and for all reward distributions with bounded support.
Book
Prediction, learning, and games
Nicolò Cesa-Bianchi,Gábor Lugosi +1 more
TL;DR: In this paper, the authors provide a comprehensive treatment of the problem of predicting individual sequences using expert advice, a general framework within which many related problems can be cast and discussed, such as repeated game playing, adaptive data compression, sequential investment in the stock market, sequential pattern analysis, and several other problems.
Book
Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems
TL;DR: In this article, the authors focus on regret analysis in the context of multi-armed bandit problems, where regret is defined as the balance between staying with the option that gave highest payoff in the past and exploring new options that might give higher payoffs in the future.
Journal ArticleDOI
The Nonstochastic Multiarmed Bandit Problem
TL;DR: A solution to the bandit problem in which an adversary, rather than a well-behaved stochastic process, has complete control over the payoffs.
Proceedings ArticleDOI
Gambling in a rigged casino: The adversarial multi-armed bandit problem
TL;DR: A solution to the bandit problem in which an adversary, rather than a well-behaved stochastic process, has complete control over the payoffs is given.