Nicolò Cesa-bianchi

Online Linear Regression with Paid Stochastic Features AAAI 2026 A Fine-grained Characterization of PAC Learnability COLT 2025 Of Dice and Games: A Theory of Generalized Boosting COLT 2025 A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs JMLR 2025 Market Making without Regret COLT 2025 Regret Analysis of Bilateral Trade with a Smoothed Adversary JMLR 2024 Fair Online Bilateral Trade NIPS 2024 Sparsity-Agnostic Linear Bandits with Adaptive Adversaries NIPS 2024 A Theory of Interpretable Approximations COLT 2024 Sum-max Submodular Bandits AISTATS 2024 Multitask Online Learning: Listen to the Neighborhood Buzz AISTATS 2024 Best-of-Both-Worlds Algorithms for Linear Contextual Bandits AISTATS 2024 Information Capacity Regret Bounds for Bandits with Mediator Feedback JMLR 2024 Margin-Based Active Learning of Classifiers JMLR 2024 A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs COLT 2023 Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023 Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning NIPS 2023 Repeated Bilateral Trade Against a Smoothed Adversary COLT 2023 Delayed Bandits: When Do Intermediate Observations Help? ICML 2023 On the Minimax Regret for Online Learning with Feedback Graphs NIPS 2023 Nonstochastic Contextual Combinatorial Bandits AISTATS 2023 A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits AISTATS 2022 Nonstochastic Bandits with Composite Anonymous Feedback JMLR 2022 Active Learning of Classifiers with Label and Seed Queries NIPS 2022 Learning on the Edge: Online Learning with Stochastic Feedback Graphs NIPS 2022 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NIPS 2022 A Regret-Variance Trade-Off in Online Learning NIPS 2022 Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021 Beyond Bandit Feedback in Online Multiclass Classification NIPS 2021 ROI Maximization in Stochastic Online Decision-Making NIPS 2021 On Margin-Based Cluster Recovery with Oracle Queries NIPS 2021 Cooperative Online Learning: Keeping your Neighbors Updated ALT 2020 Locally-Adaptive Nonparametric Online Learning NIPS 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 Exact Recovery of Mangled Clusters with Same-Cluster Queries NIPS 2020 Efficient Linear Bandits through Matrix Sketching AISTATS 2019 Delay and Cooperation in Nonstochastic Bandits JMLR 2019 Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019 Correlation Clustering with Adaptive Similarity Queries NIPS 2019 Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019 Distribution-Dependent Analysis of Gibbs-ERM Principle COLT 2019 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Bandit Regret Scaling with the Effective Loss Range ALT 2018 Nonparametric Online Regression while Learning the Metric NIPS 2017 Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017 On the Troll-Trust Model for Edge Sign Prediction in Social Networks AISTATS 2017 Boltzmann Exploration Done Right NIPS 2017 Efficient Second Order Online Learning by Sketching NIPS 2016 Online Learning with Feedback Graphs: Beyond Bandits COLT 2015 On the Complexity of Learning with Kernels COLT 2015 Regret Minimization for Branching Experts COLT 2013 Random Spanning Trees and the Prediction of Weighted Graphs JMLR 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NIPS 2013 A Gang of Bandits NIPS 2013 From Bandits to Experts: A Tale of Domination and Independence NIPS 2013 Mirror Descent Meets Fixed Share (and feels no regret) NIPS 2012 A Linear Time Active Learning Algorithm for Link Classification NIPS 2012 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Beyond Logarithmic Bounds in Online Learning AISTATS 2012 A Correlation Clustering Approach to Link Classification in Signed Networks COLT 2012 Efficient Online Learning via Randomized Rounding NIPS 2011 Efficient Learning with Partially Observed Attributes JMLR 2011 See the Tree Through the Lines: The Shazoo Algorithm NIPS 2011 Linear Algorithms for Online Multitask Classification JMLR 2010 Linear Classification and Selective Sampling Under Low Noise Conditions NIPS 2008 Worst-Case Analysis of Selective Sampling for Linear Classification JMLR 2006 Incremental Algorithms for Hierarchical Classification JMLR 2006