Nicol Cesa-Bianchi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
81
Venues
17
Active years
1990–2026
Best venue rank
A*
Where they publish
Papers
81 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Online Linear Regression with Paid Stochastic Features. | Nadav Merlis, Kyoungseok Jang, Nicol Cesa-Bianchi |
| 2026 | COLT | Learning Conditional Averages. | Marco Bressan, Nataly Brukhim, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2026 | COLT | Active Learning on Adversarially Corrupted Graphs. | Marco Bressan, Nicol Cesa-Bianchi, Tommaso d'Orsi, Emmanuel Esposito, Silvio Lattanzi |
| 2026 | COLT | Learning Periodic Strategies in Blocking Bandits Is as Hard as Bandits with Switching Costs. | Nicol Cesa-Bianchi, Junya Honda, Yuko Kuroki, Atsushi Miyauchi, Lukas Zierahn |
| 2026 | COLT | Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach. | Hao Qiu, Mengxiao Zhang, Nicol Cesa-Bianchi |
| 2026 | COLT | Gradient-Variation Regret Bounds for Unconstrained Online Learning. | Yuheng Zhao, Andrew Jacobsen, Nicol Cesa-Bianchi, Peng Zhao |
| 2025 | COLT | Of Dice and Games: A Theory of Generalized Boosting. | Marco Bressan, Nataly Brukhim, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2025 | COLT | A Fine-grained Characterization of PAC Learnability. | Marco Bressan, Nataly Brukhim, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2025 | COLT | Market Making without Regret. | Nicol Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Luigi Foscari, Vinayak Pathak |
| 2024 | AISTATS | Multitask Online Learning: Listen to the Neighborhood Buzz. | Juliette Achddou, Nicol Cesa-Bianchi, Pierre Laforgue |
| 2024 | AISTATS | Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. | Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicol Cesa-Bianchi |
| 2024 | AISTATS | Sum-max Submodular Bandits. | Stephen U. Pasteris, Alberto Rumi, Fabio Vitale, Nicol Cesa-Bianchi |
| 2024 | COLT | A Theory of Interpretable Approximations. | Marco Bressan, Nicol Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen |
| 2024 | STOC | The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. | Nicol Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi |
| 2023 | AISTATS | Nonstochastic Contextual Combinatorial Bandits. | Lukas Zierahn, Dirk van der Hoeven, Nicol Cesa-Bianchi, Gergely Neu |
| 2023 | COLT | Repeated Bilateral Trade Against a Smoothed Adversary. | Nicol Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi |
| 2023 | COLT | 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 | ICML | Delayed Bandits: When Do Intermediate Observations Help? | Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicol Cesa-Bianchi, Yevgeny Seldin |
| 2023 | ICML | Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts. | Dirk van der Hoeven, Ciara Pike-Burke, Hao Qiu, Nicol Cesa-Bianchi |
| 2023 | ITW | Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. | Khaled Eldowa, Nicol Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli |
| 2022 | AISTATS | Nonstochastic Bandits and Experts with Arm-Dependent Delays. | Dirk van der Hoeven, Nicol Cesa-Bianchi |
| 2022 | AISTATS | A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits. | Pierre Laforgue, Giulia Clerici, Nicol Cesa-Bianchi, Ran Gilad-Bachrach |
| 2021 | COLT | Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. | Marco Bressan, Nicol Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice |
| 2021 | ICML | An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. | Chlo Rouyer, Yevgeny Seldin, Nicol Cesa-Bianchi |
| 2020 | AISTATS | Stochastic Bandits with Delay-Dependent Payoffs. | Leonardo Cella, Nicol Cesa-Bianchi |
| 2020 | ALT | Cooperative Online Learning: Keeping your Neighbors Updated. | Nicol Cesa-Bianchi, Tommaso Cesari, Claire Monteleoni |
| 2019 | AISTATS | Efficient Linear Bandits through Matrix Sketching. | Ilja Kuzborskij, Leonardo Cella, Nicol Cesa-Bianchi |
| 2019 | ALT | Dynamic Pricing with Finitely Many Unknown Valuations. | Nicol Cesa-Bianchi, Tommaso Cesari, Vianney Perchet |
| 2019 | COLT | Distribution-Dependent Analysis of Gibbs-ERM Principle. | Ilja Kuzborskij, Nicol Cesa-Bianchi, Csaba Szepesvri |
| 2018 | ALT | Bandit Regret Scaling with the Effective Loss Range. | Nicol Cesa-Bianchi, Ohad Shamir |
| 2018 | COLT | Nonstochastic Bandits with Composite Anonymous Feedback. | Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour |
| 2017 | AISTATS | On the Troll-Trust Model for Edge Sign Prediction in Social Networks. | Graud Le Falher, Nicol Cesa-Bianchi, Claudio Gentile, Fabio Vitale |
| 2017 | COLT | Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning. | Nicol Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, Sbastien Gerchinovitz |
| 2016 | COLT | Delay and Cooperation in Nonstochastic Bandits. | Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour, Alberto Minora |
| 2015 | COLT | Online Learning with Feedback Graphs: Beyond Bandits. | Noga Alon, Nicol Cesa-Bianchi, Ofer Dekel, Tomer Koren |
| 2015 | COLT | On the Complexity of Learning with Kernels. | Nicol Cesa-Bianchi, Yishay Mansour, Ohad Shamir |
| 2015 | ICDM | The ABACOC Algorithm: A Novel Approach for Nonparametric Classification of Data Streams. | Rocco De Rosa, Francesco Orabona, Nicol Cesa-Bianchi |
| 2015 | IJCNN | Splitting with confidence in decision trees with application to stream mining. | Rocco De Rosa, Nicol Cesa-Bianchi |
| 2014 | BMVC | Online Action Recognition via Nonparametric Incremental Learning. | Rocco De Rosa, Nicol Cesa-Bianchi, Ilaria Gori, Fabio Cuzzolin |
| 2013 | COLT | Regret Minimization for Branching Experts. | Eyal Gofer, Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour |
| 2013 | SODA | Regret Minimization for Reserve Prices in Second-Price Auctions. | Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour |
| 2012 | UAI | PAC-Bayesian Inequalities for Martingales. | Yevgeny Seldin, Franois Laviolette, Nicol Cesa-Bianchi, John Shawe-Taylor, Peter Auer |
| 2011 | AAAI | Quantity Makes Quality: Learning with Partial Views. | Nicol Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir |
| 2011 | ICML | Better Algorithms for Selective Sampling. | Francesco Orabona, Nicol Cesa-Bianchi |
| 2010 | COLT | Active Learning on Trees and Graphs. | Nicol Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella |
| 2010 | COLT | Online Learning of Noisy Data with Kernels. | Nicol Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir |
| 2010 | CVPR | OM-2: An online multi-class Multi-Kernel Learning algorithm Luo Jie. | Francesco Orabona, Marco Fornoni, Barbara Caputo, Nicol Cesa-Bianchi |
| 2010 | ICML | Random Spanning Trees and the Prediction of Weighted Graphs. | Nicol Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella |
| 2010 | ICML | Efficient Learning with Partially Observed Attributes. | Nicol Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir |
| 2009 | ALT | Learning Unknown Graphs. | Nicol Cesa-Bianchi, Claudio Gentile, Fabio Vitale |
| 2009 | ASRU | Online discriminative learning: theory and applications. | Nicol Cesa-Bianchi |
| 2009 | COLT | Fast and Optimal Prediction on a Labeled Tree. | Nicol Cesa-Bianchi, Claudio Gentile, Fabio Vitale |
| 2009 | COLT | Combinatorial Bandits. | Nicol Cesa-Bianchi, Gbor Lugosi |
| 2009 | EAMT | Online learning for CAT applications. | Nicol Cesa-Bianchi, Gabriele Reverberi |
| 2009 | ICML | Robust bounds for classification via selective sampling. | Nicol Cesa-Bianchi, Claudio Gentile, Francesco Orabona |
| 2008 | COLT | Linear Algorithms for Online Multitask Classification. | Giovanni Cavallanti, Nicol Cesa-Bianchi, Claudio Gentile |
| 2006 | COLT | Tracking the Best Hyperplane with a Simple Budget Perceptron. | Nicol Cesa-Bianchi, Claudio Gentile |
| 2006 | ICML | Hierarchical classification: combining Bayes with SVM. | Nicol Cesa-Bianchi, Claudio Gentile, Luca Zaniboni |
| 2006 | ITW | Regret Minimization Under Partial Monitoring. | Nicol Cesa-Bianchi, Gbor Lugosi, Gilles Stoltz |
| 2005 | COLT | Improved Second-Order Bounds for Prediction with Expert Advice. | Nicol Cesa-Bianchi, Yishay Mansour, Gilles Stoltz |
| 2004 | ALT | Applications of Regularized Least Squares to Classification Problems. | Nicol Cesa-Bianchi |
| 2004 | COLT | Regret Bounds for Hierarchical Classification with Linear-Threshold Functions. | Nicol Cesa-Bianchi, Alex Conconi, Claudio Gentile |
| 2004 | COLT | Minimizing Regret with Label Efficient Prediction. | Nicol Cesa-Bianchi, Gbor Lugosi, Gilles Stoltz |
| 2003 | COLT | Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling. | Nicol Cesa-Bianchi, Alex Conconi, Claudio Gentile |
| 2002 | ALT | Editors' Introduction. | Nicol Cesa-Bianchi, Masayuki Numao, Rdiger Reischuk |
| 2002 | COLT | A Second-Order Perceptron Algorithm. | Nicol Cesa-Bianchi, Alex Conconi, Claudio Gentile |
| 2001 | COLT | Potential-Based Algorithms in Online Prediction and Game Theory. | Nicol Cesa-Bianchi, Gbor Lugosi |
| 1999 | COLT | Minimax Regret Under log Loss for General Classes of Experts. | Nicol Cesa-Bianchi, Gbor Lugosi |
| 1998 | COLT | On Sequential Prediction of Individual Sequences Relative to a Set of Experts. | Nicol Cesa-Bianchi, Gbor Lugosi |
| 1998 | ICML | Finite-Time Regret Bounds for the Multiarmed Bandit Problem. | Nicol Cesa-Bianchi, Paul Fischer |
| 1997 | COLT | Analysis of Two Gradient-based Algorithms for On-line Regression. | Nicol Cesa-Bianchi |
| 1996 | COLT | On Bayes Methods for On-Line Boolean Prediction. | Nicol Cesa-Bianchi, David P. Helmbold, Sandra Panizza |
| 1996 | PODC | Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract). | Peter Auer, Pasquale Caianiello, Nicol Cesa-Bianchi |
| 1996 | STOC | Noise-Tolerant Learning Near the Information-Theoretic Bound. | Nicol Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon |
| 1995 | FOCS | Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem. | Peter Auer, Nicol Cesa-Bianchi, Yoav Freund, Robert E. Schapire |
| 1994 | ALT | On-line Learning with Malicious Noise and the Closure Algorithm. | Peter Auer, Nicol Cesa-Bianchi |
| 1993 | COLT | Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule. | Nicol Cesa-Bianchi, Philip M. Long, Manfred K. Warmuth |
| 1993 | FOCS | Scale-sensitive Dimensions, Uniform Convergence, and Learnability | Noga Alon, Shai Ben-David, Nicol Cesa-Bianchi, David Haussler |
| 1993 | STOC | How to use expert advice. | Nicol Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, Manfred K. Warmuth |
| 1992 | COLT | Characterizations of Learnability for Classes of { | Shai Ben-David, Nicol Cesa-Bianchi, Philip M. Long |
| 1990 | ALT | Learning the Distribution in the Extended PAC Model. | Nicol Cesa-Bianchi |