default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolò Cesa-Bianchi
Person information
- affiliation: University of Milan, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j58]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Margin-Based Active Learning of Classifiers. J. Mach. Learn. Res. 25: 127:1-127:45 (2024)- [j57]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Regret Analysis of Bilateral Trade with a Smoothed Adversary. J. Mach. Learn. Res. 25: 234:1-234:36 (2024) - [j56]Nicolò Cesa-Bianchi
, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. Math. Oper. Res. 49(1): 171-203 (2024) - [j55]Nicolò Cesa-Bianchi, Tommaso Cesari, Riccardo Della Vecchia:
Cooperative Online Learning with Feedback Graphs. Trans. Mach. Learn. Res. 2024 (2024) - [j54]Giulia Clerici, Pierre Laforgue, Nicolò Cesa-Bianchi:
Linear Bandits with Memory. Trans. Mach. Learn. Res. 2024 (2024) - [c116]Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. AISTATS 2024: 1216-1224 - [c115]Juliette Achddou, Nicolò Cesa-Bianchi, Pierre Laforgue:
Multitask Online Learning: Listen to the Neighborhood Buzz. AISTATS 2024: 1846-1854 - [c114]Stephen U. Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. AISTATS 2024: 2323-2331 - [c113]Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. COLT 2024: 648-668 - [c112]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. STOC 2024: 225-236 - [i82]Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information Capacity Regret Bounds for Bandits with Mediator Feedback. CoRR abs/2402.10282 (2024) - [i81]François Bachoc, Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni:
Fair Online Bilateral Trade. CoRR abs/2405.13919 (2024) - [i80]Tianyuan Jin, Kyoungseok Jang, Nicolò Cesa-Bianchi:
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries. CoRR abs/2406.01192 (2024) - [i79]Marco Bressan, Nicolò Cesa-Bianchi, Emmanuel Esposito, Yishay Mansour, Shay Moran, Maximilian Thiessen:
A Theory of Interpretable Approximations. CoRR abs/2406.10529 (2024) - [i78]Nicolò Cesa-Bianchi, Khaled Eldowa, Emmanuel Esposito, Julia Olkhovskaya:
Improved Regret Bounds for Bandits with Expert Advice. CoRR abs/2406.16802 (2024) - 2023
- [c111]Lukas Zierahn, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Gergely Neu:
Nonstochastic Contextual Combinatorial Bandits. AISTATS 2023: 8771-8813 - [c110]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - [c109]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - [c108]Dirk van der Hoeven, Lukas Zierahn, Tal Lancewicki, Aviv Rosenberg, Nicolò Cesa-Bianchi:
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs. COLT 2023: 1285-1321 - [c107]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? ICML 2023: 9374-9395 - [c106]Dirk van der Hoeven, Ciara Pike-Burke, Hao Qiu, Nicolò Cesa-Bianchi:
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts. ICML 2023: 34809-34830 - [c105]Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. ITW 2023: 30-35 - [c104]Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. NeurIPS 2023 - [c103]Pier Giuseppe Sessa, Pierre Laforgue, Nicolò Cesa-Bianchi, Andreas Krause:
Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning. NeurIPS 2023 - [i77]Giulia Clerici, Pierre Laforgue, Nicolò Cesa-Bianchi:
Linear Bandits with Memory: from Rotting to Rising. CoRR abs/2302.08345 (2023) - [i76]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - [i75]Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. CoRR abs/2303.08102 (2023) - [i74]Dirk van der Hoeven, Lukas Zierahn, Tal Lancewicki, Aviv Rosenberg, Nicolò Cesa-Bianchi:
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs. CoRR abs/2305.08629 (2023) - [i73]Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. CoRR abs/2305.15383 (2023) - [i72]Emmanuel Esposito, Saeed Masoudian, Hao Qiu, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Delayed Bandits: When Do Intermediate Observations Help? CoRR abs/2305.19036 (2023) - [i71]Dirk van der Hoeven, Ciara Pike-Burke, Hao Qiu, Nicolò Cesa-Bianchi:
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts. CoRR abs/2307.00836 (2023) - [i70]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. CoRR abs/2307.09478 (2023) - [i69]Pier Giuseppe Sessa, Pierre Laforgue, Nicolò Cesa-Bianchi, Andreas Krause:
Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning. CoRR abs/2308.01744 (2023) - [i68]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
High-Probability Risk Bounds via Sequential Predictors. CoRR abs/2308.07588 (2023) - [i67]Nicolò Cesa-Bianchi, Roberto Colomboni, Maximilian Kasy:
Adaptive maximization of social welfare. CoRR abs/2310.09597 (2023) - [i66]Juliette Achddou, Nicolò Cesa-Bianchi, Pierre Laforgue:
Multitask Online Learning: Listen to the Neighborhood Buzz. CoRR abs/2310.17385 (2023) - [i65]Stephen Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. CoRR abs/2311.05975 (2023) - [i64]Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. CoRR abs/2312.15433 (2023) - 2022
- [j53]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Claudio Gentile, Yishay Mansour:
Nonstochastic Bandits with Composite Anonymous Feedback. J. Mach. Learn. Res. 23: 277:1-277:24 (2022) - [j52]Nicolò Cesa-Bianchi, Pierre Laforgue, Andrea Paudice, Massimiliano Pontil:
Multitask Online Mirror Descent. Trans. Mach. Learn. Res. 2022 (2022) - [c102]Pierre Laforgue, Giulia Clerici, Nicolò Cesa-Bianchi, Ran Gilad-Bachrach:
A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits. AISTATS 2022: 971-990 - [c101]Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Nonstochastic Bandits and Experts with Arm-Dependent Delays. AISTATS 2022: 2022-2044 - [c100]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. NeurIPS 2022 - [c99]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. NeurIPS 2022 - [c98]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
A Regret-Variance Trade-Off in Online Learning. NeurIPS 2022 - [c97]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. NeurIPS 2022 - [i63]Chloé Rouyer, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Yevgeny Seldin:
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs. CoRR abs/2206.00557 (2022) - [i62]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
A Regret-Variance Trade-Off in Online Learning. CoRR abs/2206.02656 (2022) - [i61]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Online Learning in Supply-Chain Games. CoRR abs/2207.04054 (2022) - [i60]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice, Maximilian Thiessen:
Active Learning of Classifiers with Label and Seed Queries. CoRR abs/2209.03996 (2022) - [i59]Emmanuel Esposito, Federico Fusco, Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Learning on the Edge: Online Learning with Stochastic Feedback Graphs. CoRR abs/2210.04229 (2022) - 2021
- [c96]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. COLT 2021: 775-803 - [c95]Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi:
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. ICML 2021: 9127-9135 - [c94]Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet:
A New Theoretical Framework for Fast and Accurate Online Decision-Making. NeurIPS 2021: 9152-9166 - [c93]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. NeurIPS 2021: 13280-13291 - [c92]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. NeurIPS 2021: 25231-25243 - [c91]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. EC 2021: 289-309 - [i58]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. CoRR abs/2102.00504 (2021) - [i57]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
A Regret Analysis of Bilateral Trade. CoRR abs/2102.08754 (2021) - [i56]Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi:
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. CoRR abs/2102.09864 (2021) - [i55]Maximilian Mordig, Riccardo Della Vecchia, Nicolò Cesa-Bianchi, Bernhard Schölkopf:
Multi-Sided Matching Markets with Consistent Preferences and Cooperative Partners. CoRR abs/2102.11834 (2021) - [i54]Nicolò Cesa-Bianchi, Pierre Laforgue, Andrea Paudice, Massimiliano Pontil:
Multitask Online Mirror Descent. CoRR abs/2106.02393 (2021) - [i53]Dirk van der Hoeven, Federico Fusco, Nicolò Cesa-Bianchi:
Beyond Bandit Feedback in Online Multiclass Classification. CoRR abs/2106.03596 (2021) - [i52]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
On Margin-Based Cluster Recovery with Oracle Queries. CoRR abs/2106.04913 (2021) - [i51]Nicolò Cesa-Bianchi, Tommaso Cesari, Riccardo Della Vecchia:
Cooperative Online Learning with Feedback Graphs. CoRR abs/2106.04982 (2021) - [i50]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Bilateral Trade: A Regret Minimization Perspective. CoRR abs/2109.12974 (2021) - [i49]Pierre Laforgue, Giulia Clerici, Nicolò Cesa-Bianchi, Ran Gilad-Bachrach:
Break your Bandit Routine with LSD Rewards: a Last Switch Dependent Analysis of Satiation and Seasonality. CoRR abs/2110.11819 (2021) - [i48]Dirk van der Hoeven, Nicolò Cesa-Bianchi:
Nonstochastic Bandits and Experts with Arm-Dependent Delays. CoRR abs/2111.01589 (2021) - [i47]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Claudio Gentile, Yishay Mansour:
Nonstochastic Bandits with Composite Anonymous Feedback. CoRR abs/2112.02866 (2021) - 2020
- [c90]Leonardo Cella, Nicolò Cesa-Bianchi:
Stochastic Bandits with Delay-Dependent Payoffs. AISTATS 2020: 1168-1177 - [c89]Nicolò Cesa-Bianchi, Tommaso Cesari, Claire Monteleoni:
Cooperative Online Learning: Keeping your Neighbors Updated. ALT 2020: 234-250 - [c88]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. NeurIPS 2020 - [c87]Ilja Kuzborskij, Nicolò Cesa-Bianchi:
Locally-Adaptive Nonparametric Online Learning. NeurIPS 2020 - [i46]Ilja Kuzborskij, Nicolò Cesa-Bianchi:
Locally-Adaptive Nonparametric Online Learning. CoRR abs/2002.01882 (2020) - [i45]Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Mangled Clusters with Same-Cluster Queries. CoRR abs/2006.04675 (2020)
2010 – 2019
- 2019
- [j51]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
Delay and Cooperation in Nonstochastic Bandits. J. Mach. Learn. Res. 20: 17:1-17:38 (2019) - [j50]Marco Frasca, Nicolò Cesa-Bianchi:
Multitask Protein Function Prediction through Task Dissimilarity. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5): 1550-1560 (2019) - [c86]Ilja Kuzborskij, Leonardo Cella, Nicolò Cesa-Bianchi:
Efficient Linear Bandits through Matrix Sketching. AISTATS 2019: 177-185 - [c85]Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet:
Dynamic Pricing with Finitely Many Unknown Valuations. ALT 2019: 247-273 - [c84]Ilja Kuzborskij, Nicolò Cesa-Bianchi, Csaba Szepesvári:
Distribution-Dependent Analysis of Gibbs-ERM Principle. COLT 2019: 2028-2054 - [c83]Tobias Sommer Thune, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Nonstochastic Multiarmed Bandits with Unrestricted Delays. NeurIPS 2019: 6538-6547 - [c82]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. NeurIPS 2019: 12510-12519 - [i44]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Claire Monteleoni:
Cooperative Online Learning: Keeping your Neighbors Updated. CoRR abs/1901.08082 (2019) - [i43]Ilja Kuzborskij, Nicolò Cesa-Bianchi, Csaba Szepesvári:
Distribution-Dependent Analysis of Gibbs-ERM Principle. CoRR abs/1902.01846 (2019) - [i42]Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet:
Repeated A/B Testing. CoRR abs/1905.11797 (2019) - [i41]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. CoRR abs/1905.11902 (2019) - [i40]Tobias Sommer Thune, Nicolò Cesa-Bianchi, Yevgeny Seldin:
Nonstochastic Multiarmed Bandits with Unrestricted Delays. CoRR abs/1906.00670 (2019) - [i39]Leonardo Cella, Nicolò Cesa-Bianchi:
Stochastic Bandits with Delay-Dependent Payoffs. CoRR abs/1910.02757 (2019) - 2018
- [c81]Nicolò Cesa-Bianchi, Ohad Shamir:
Bandit Regret Scaling with the Effective Loss Range. ALT 2018: 128-151 - [c80]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
Nonstochastic Bandits with Composite Anonymous Feedback. COLT 2018: 750-773 - [e3]Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, Roman Garnett:
Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montréal, Canada. 2018 [contents] - [i38]Marco Frasca, Nicolò Cesa-Bianchi:
Combining Cost-Sensitive Classification with Negative Selection for Protein Function Prediction. CoRR abs/1805.07331 (2018) - [i37]Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet:
Dynamic Pricing with Finitely Many Unknown Valuations. CoRR abs/1807.03288 (2018) - [i36]Ilja Kuzborskij, Leonardo Cella, Nicolò Cesa-Bianchi:
Efficient Linear Bandits through Matrix Sketching. CoRR abs/1809.11033 (2018) - 2017
- [j49]Rocco De Rosa, Nicolò Cesa-Bianchi:
Confidence Decision Trees via Online and Active Learning for Streaming Data. J. Artif. Intell. Res. 60: 1031-1055 (2017) - [j48]Rocco De Rosa, Ilaria Gori, Fabio Cuzzolin, Nicolò Cesa-Bianchi:
Active Incremental Recognition of Human Activities in a Streaming Context. Pattern Recognit. Lett. 99: 48-56 (2017) - [j47]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir:
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. SIAM J. Comput. 46(6): 1785-1826 (2017) - [c79]Géraud Le Falher, Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
On the Troll-Trust Model for Edge Sign Prediction in Social Networks. AISTATS 2017: 402-411 - [c78]Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, Sébastien Gerchinovitz:
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning. COLT 2017: 465-481 - [c77]Ilja Kuzborskij, Nicolò Cesa-Bianchi:
Nonparametric Online Regression while Learning the Metric. NIPS 2017: 667-676 - [c76]Nicolò Cesa-Bianchi, Claudio Gentile, Gergely Neu, Gábor Lugosi:
Boltzmann Exploration Done Right. NIPS 2017: 6284-6293 - [i35]Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, Sébastien Gerchinovitz:
Online Nonparametric Learning, Chaining, and the Role of Partial Feedback. CoRR abs/1702.08211 (2017) - [i34]Nicolò Cesa-Bianchi, Ohad Shamir:
Bandit Regret Scaling with the Effective Loss Range. CoRR abs/1705.05091 (2017) - [i33]Ilja Kuzborskij, Nicolò Cesa-Bianchi:
Nonparametric Online Regression while Learning the Metric. CoRR abs/1705.07853 (2017) - [i32]Nicolò Cesa-Bianchi, Claudio Gentile, Gábor Lugosi, Gergely Neu:
Boltzmann Exploration Done Right. CoRR abs/1705.10257 (2017) - 2016
- [c75]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour, Alberto Minora:
Delay and Cooperation in Nonstochastic Bandits. COLT 2016: 605-622 - [c74]Haipeng Luo, Alekh Agarwal, Nicolò Cesa-Bianchi, John Langford:
Efficient Second Order Online Learning by Sketching. NIPS 2016: 902-910 - [r1]Nicolò Cesa-Bianchi:
Multi-armed Bandit Problem. Encyclopedia of Algorithms 2016: 1356-1359 - [i31]Haipeng Luo, Alekh Agarwal, Nicolò Cesa-Bianchi, John Langford:
Efficient Second Order Online Learning via Sketching. CoRR abs/1602.02202 (2016) - [i30]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour, Alberto Minora:
Delay and Cooperation in Nonstochastic Bandits. CoRR abs/1602.04741 (2016) - [i29]Rocco De Rosa, Ilaria Gori, Fabio Cuzzolin, Barbara Caputo, Nicolò Cesa-Bianchi:
Active Learning for Online Recognition of Human Activities from Streaming Videos. CoRR abs/1604.02855 (2016) - [i28]Géraud Le Falher, Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
On the Troll-Trust Model for Edge Sign Prediction in Social Networks. CoRR abs/1606.00182 (2016) - [i27]Marco Frasca, Nicolò Cesa-Bianchi:
Multitask Protein Function Prediction Through Task Dissimilarity. CoRR abs/1611.00962 (2016) - 2015
- [j46]Francesco Orabona, Koby Crammer, Nicolò Cesa-Bianchi:
A generalized online mirror descent with applications to classification and regression. Mach. Learn. 99(3): 411-435 (2015) - [j45]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
Regret Minimization for Reserve Prices in Second-Price Auctions. IEEE Trans. Inf. Theory 61(1): 549-564 (2015) - [c73]Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren:
Online Learning with Feedback Graphs: Beyond Bandits. COLT 2015: 23-35 - [c72]Nicolò Cesa-Bianchi, Yishay Mansour, Ohad Shamir:
On the Complexity of Learning with Kernels. COLT 2015: 297-325 - [c71]Rocco De Rosa, Francesco Orabona, Nicolò Cesa-Bianchi:
The ABACOC Algorithm: A Novel Approach for Nonparametric Classification of Data Streams. ICDM 2015: 733-738 - [c70]Rocco De Rosa, Nicolò Cesa-Bianchi:
Splitting with confidence in decision trees with application to stream mining. IJCNN 2015: 1-8 - [i26]Noga Alon, Nicolò Cesa-Bianchi, Ofer Dekel, Tomer Koren:
Online Learning with Feedback Graphs: Beyond Bandits. CoRR abs/1502.07617 (2015) - [i25]Rocco De Rosa, Francesco Orabona, Nicolò Cesa-Bianchi:
The ABACOC Algorithm: a Novel Approach for Nonparametric Classification of Data Streams. CoRR abs/1508.04912 (2015) - 2014
- [c69]Rocco De Rosa, Nicolò Cesa-Bianchi, Ilaria Gori, Fabio Cuzzolin:
Online Action Recognition via Nonparametric Incremental Learning. BMVC 2014 - [i24]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Shie Mannor, Yishay Mansour, Ohad Shamir:
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback. CoRR abs/1409.8428 (2014) - [i23]Nicolò Cesa-Bianchi, Yishay Mansour, Ohad Shamir:
On the Complexity of Learning with Kernels. CoRR abs/1411.1158 (2014) - 2013
- [j44]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random spanning trees and the prediction ofweighted graphs. J. Mach. Learn. Res. 14(1): 1251-1284 (2013) - [j43]Sébastien Bubeck, Nicolò Cesa-Bianchi, Gábor Lugosi:
Bandits With Heavy Tail. IEEE Trans. Inf. Theory 59(11): 7711-7717 (2013) - [c68]Nicolò Cesa-Bianchi, Ohad Shamir:
Efficient Transductive Online Learning via Randomized Rounding. Empirical Inference 2013: 177-194 - [c67]Eyal Gofer, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
Regret Minimization for Branching Experts. COLT 2013: 618-638 - [c66]Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
A Gang of Bandits. NIPS 2013: 737-745 - [c65]Nicolò Cesa-Bianchi, Ofer Dekel, Ohad Shamir:
Online Learning with Switching Costs and Other Adaptive Adversaries. NIPS 2013: 1160-1168 - [c64]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
From Bandits to Experts: A Tale of Domination and Independence. NIPS 2013: 1610-1618 - [c63]Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
Regret Minimization for Reserve Prices in Second-Price Auctions. SODA 2013: 1190-1204 - [i22]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Linear Time Active Learning Algorithm for Link Classification. CoRR abs/1301.4767 (2013) - [i21]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Correlation Clustering Approach to Link Classification in Signed Networks. CoRR abs/1301.4769 (2013) - [i20]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Active Learning on Trees and Graphs. CoRR abs/1301.5112 (2013) - [i19]Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
See the Tree Through the Lines: The Shazoo Algorithm. CoRR abs/1301.5160 (2013) - [i18]Nicolò Cesa-Bianchi, Ofer Dekel, Ohad Shamir:
Online Learning with Switching Costs and Other Adaptive Adversaries. CoRR abs/1302.4387 (2013) - [i17]Francesco Orabona, Koby Crammer, Nicolò Cesa-Bianchi:
A Generalized Online Mirror Descent with Applications to Classification and Regression. CoRR abs/1304.2994 (2013) - [i16]Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
A Gang of Bandits. CoRR abs/1306.0811 (2013) - [i15]Noga Alon, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
From Bandits to Experts: A Tale of Domination and Independence. CoRR abs/1307.4564 (2013) - 2012
- [j42]Sébastien Bubeck, Nicolò Cesa-Bianchi:
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Found. Trends Mach. Learn. 5(1): 1-122 (2012) - [j41]Nicolò Cesa-Bianchi, Gábor Lugosi:
Combinatorial bandits. J. Comput. Syst. Sci. 78(5): 1404-1422 (2012) - [j40]Nicolò Cesa-Bianchi, Matteo Re, Giorgio Valentini:
Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference. Mach. Learn. 88(1-2): 209-241 (2012) - [j39]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. IEEE Trans. Inf. Theory 58(12): 7086-7093 (2012) - [c62]Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, Gilles Stoltz:
Mirror Descent Meets Fixed Share (and feels no regret). NIPS 2012: 989-997 - [c61]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Linear Time Active Learning Algorithm for Link Classification. NIPS 2012: 1619-1627 - [c60]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. UAI 2012: 12 - [c59]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Correlation Clustering Approach to Link Classification in Signed Networks. COLT 2012: 34.1-34.20 - [c58]Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade:
Towards Minimax Policies for Online Linear Optimization with Bandit Feedback. COLT 2012: 41.1-41.14 - [c57]Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter Auer, François Laviolette, John Shawe-Taylor:
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits. ICML On-line Trading of Exploration and Exploitation 2012: 98-111 - [c56]Francesco Orabona, Nicolò Cesa-Bianchi, Claudio Gentile:
Beyond Logarithmic Bounds in Online Learning. AISTATS 2012: 823-831 - [i14]Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade:
Towards minimax policies for online linear optimization with bandit feedback. CoRR abs/1202.3079 (2012) - [i13]Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, Gilles Stoltz:
A new look at shifting regret. CoRR abs/1202.3323 (2012) - [i12]Sébastien Bubeck, Nicolò Cesa-Bianchi:
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. CoRR abs/1204.5721 (2012) - [i11]Sébastien Bubeck, Nicolò Cesa-Bianchi, Gábor Lugosi:
Bandits with heavy tail. CoRR abs/1209.1727 (2012) - [i10]Giovanni Cavallanti, Nicolò Cesa-Bianchi:
Memory Constraint Online Multitask Classification. CoRR abs/1210.0473 (2012) - [i9]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random Spanning Trees and the Prediction of Weighted Graphs. CoRR abs/1212.5637 (2012) - 2011
- [j38]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Efficient Learning with Partially Observed Attributes. J. Mach. Learn. Res. 12: 2857-2878 (2011) - [j37]Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Learning noisy linear classifiers via adaptive and selective sampling. Mach. Learn. 83(1): 71-102 (2011) - [j36]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Predicting the labels of an unknown graph via adaptive exploration. Theor. Comput. Sci. 412(19): 1791-1804 (2011) - [j35]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Online Learning of Noisy Data. IEEE Trans. Inf. Theory 57(12): 7907-7931 (2011) - [c55]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Quantity Makes Quality: Learning with Partial Views. AAAI 2011: 1547-1550 - [c54]Nicolò Cesa-Bianchi:
The Game-Theoretic Approach to Machine Learning and Adaptation. ICAIS 2011: 1 - [c53]Francesco Orabona, Nicolò Cesa-Bianchi:
Better Algorithms for Selective Sampling. ICML 2011: 433-440 - [c52]Nicolò Cesa-Bianchi:
Ensembles and Multiple Classifiers: A Game-Theoretic View. MCS 2011: 2-5 - [c51]Nicolò Cesa-Bianchi, Ohad Shamir:
Efficient Online Learning via Randomized Rounding. NIPS 2011: 343-351 - [c50]Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
See the Tree Through the Lines: The Shazoo Algorithm. NIPS 2011: 1584-1592 - [i8]Yevgeny Seldin, Nicolò Cesa-Bianchi, François Laviolette, Peter Auer, John Shawe-Taylor, Jan Peters:
PAC-Bayesian Analysis of the Exploration-Exploitation Trade-off. CoRR abs/1105.4585 (2011) - [i7]Nicolò Cesa-Bianchi, Ohad Shamir:
Efficient Online Learning via Randomized Rounding. CoRR abs/1106.2429 (2011) - [i6]Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter Auer, François Laviolette, John Shawe-Taylor:
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits. CoRR abs/1110.6755 (2011) - [i5]Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer:
PAC-Bayesian Inequalities for Martingales. CoRR abs/1110.6886 (2011) - 2010
- [j34]Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Linear Algorithms for Online Multitask Classification. J. Mach. Learn. Res. 11: 2901-2934 (2010) - [j33]Nicolò Cesa-Bianchi, David R. Hardoon, Gayle Leen:
Guest Editorial: Learning from multiple sources. Mach. Learn. 79(1-2): 1-3 (2010) - [c49]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Online Learning of Noisy Data with Kernels. COLT 2010: 218-230 - [c48]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Active Learning on Trees and Graphs. COLT 2010: 320-332 - [c47]Francesco Orabona, Marco Fornoni, Barbara Caputo, Nicolò Cesa-Bianchi:
OM-2: An online multi-class Multi-Kernel Learning algorithm Luo Jie. CVPR Workshops 2010: 43-50 - [c46]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random Spanning Trees and the Prediction of Weighted Graphs. ICML 2010: 175-182 - [c45]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Efficient Learning with Partially Observed Attributes. ICML 2010: 183-190 - [c44]Nicolò Cesa-Bianchi, Giorgio Valentini:
Hierarchical Cost-Sensitive Algorithms for Genome-Wide Gene Function Prediction. MLSB 2010: 14-29 - [i4]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Efficient Learning with Partially Observed Attributes. CoRR abs/1004.4421 (2010) - [i3]Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir:
Online Learning of Noisy Data with Kernels. CoRR abs/1005.2296 (2010)
2000 – 2009
- 2009
- [c43]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Learning Unknown Graphs. ALT 2009: 110-125 - [c42]Nicolò Cesa-Bianchi:
Online discriminative learning: theory and applications. ASRU 2009: 45 - [c41]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Fast and Optimal Prediction on a Labeled Tree. COLT 2009 - [c40]Nicolò Cesa-Bianchi, Gábor Lugosi:
Combinatorial Bandits. COLT 2009 - [c39]Nicolò Cesa-Bianchi, Gabriele Reverberi:
Online learning for CAT applications. SMART@EAMT 2009 - [c38]Nicolò Cesa-Bianchi, Claudio Gentile, Francesco Orabona:
Robust bounds for classification via selective sampling. ICML 2009: 121-128 - 2008
- [j32]Giorgio Valentini, Nicolò Cesa-Bianchi:
HCGene: a software tool to support the hierarchical classification of genes. Bioinform. 24(5): 729-731 (2008) - [j31]Nicolò Cesa-Bianchi, Claudio Gentile:
Improved Risk Tail Bounds for On-Line Algorithms. IEEE Trans. Inf. Theory 54(1): 386-390 (2008) - [c37]Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Linear Algorithms for Online Multitask Classification. COLT 2008: 251-262 - [c36]Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Linear Classification and Selective Sampling Under Low Noise Conditions. NIPS 2008: 249-256 - 2007
- [j30]Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz:
Improved second-order bounds for prediction with expert advice. Mach. Learn. 66(2-3): 321-352 (2007) - [j29]Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile:
Tracking the best hyperplane with a simple budget Perceptron. Mach. Learn. 69(2-3): 143-167 (2007) - [j28]Nicolò Cesa-Bianchi:
Applications of regularized least squares to pattern classification. Theor. Comput. Sci. 382(3): 221-231 (2007) - 2006
- [b1]Nicolò Cesa-Bianchi, Gábor Lugosi:
Prediction, learning, and games. Cambridge University Press 2006, ISBN 978-0-521-84108-5, pp. I-XII, 1-394 - [j27]Peter Auer, Nicolò Cesa-Bianchi:
A distributed voting scheme to maximize preferences. RAIRO Theor. Informatics Appl. 40(2): 389-403 (2006) - [j26]Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni:
Incremental Algorithms for Hierarchical Classification. J. Mach. Learn. Res. 7: 31-54 (2006) - [j25]Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni:
Worst-Case Analysis of Selective Sampling for Linear Classification. J. Mach. Learn. Res. 7: 1205-1230 (2006) - [j24]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Regret Minimization Under Partial Monitoring. Math. Oper. Res. 31(3): 562-580 (2006) - [j23]Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann:
Foreword. Theor. Comput. Sci. 350(1): 1-2 (2006) - [c35]Nicolò Cesa-Bianchi, Claudio Gentile:
Tracking the Best Hyperplane with a Simple Budget Perceptron. COLT 2006: 483-498 - [c34]Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni:
Hierarchical classification: combining Bayes with SVM. ICML 2006: 177-184 - [c33]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Regret Minimization Under Partial Monitoring. ITW 2006: 72-76 - 2005
- [j22]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
A Second-Order Perceptron Algorithm. SIAM J. Comput. 34(3): 640-668 (2005) - [j21]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Minimizing regret with label efficient prediction. IEEE Trans. Inf. Theory 51(6): 2152-2162 (2005) - [c32]Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz:
Improved Second-Order Bounds for Prediction with Expert Advice. COLT 2005: 217-232 - [c31]Claudio Bettini, Nicolò Cesa-Bianchi, Daniele Riboni:
A Distributed Architecture for Management and Retrieval of Extended Points of Interest. ICDCS Workshops 2005: 266-272 - [c30]Nicolò Cesa-Bianchi, Claudio Gentile:
Improved risk tail bounds for on-line algorithms. NIPS 2005: 195-202 - 2004
- [j20]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
On the Generalization Ability of On-Line Learning Algorithms. IEEE Trans. Inf. Theory 50(9): 2050-2057 (2004) - [c29]Nicolò Cesa-Bianchi:
Applications of Regularized Least Squares to Classification Problems. ALT 2004: 14-18 - [c28]Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Minimizing Regret with Label Efficient Prediction. COLT 2004: 77-92 - [c27]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions. COLT 2004: 93-108 - [c26]Alessandra Agostini, Claudio Bettini, Nicolò Cesa-Bianchi, Dario Maggiorini, Daniele Riboni, Michele Ruberl, Cristiano Sala, Davide Vitali:
Towards Highly Adaptive Services for Mobile Computing. MOBIS 2004: 121-134 - [c25]Nicolò Cesa-Bianchi, Claudio Gentile, Andrea Tironi, Luca Zaniboni:
Incremental Algorithms for Hierarchical Classification. NIPS 2004: 233-240 - [c24]Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni:
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms. NIPS 2004: 241-248 - 2003
- [j19]Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in On-Line Prediction and Game Theory. Mach. Learn. 51(3): 239-261 (2003) - [c23]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling. COLT 2003: 373-387 - 2002
- [j18]Peter Auer, Nicolò Cesa-Bianchi, Claudio Gentile:
Adaptive and Self-Confident On-Line Learning Algorithms. J. Comput. Syst. Sci. 64(1): 48-75 (2002) - [j17]Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer:
Finite-time Analysis of the Multiarmed Bandit Problem. Mach. Learn. 47(2-3): 235-256 (2002) - [j16]Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire:
The Nonstochastic Multiarmed Bandit Problem. SIAM J. Comput. 32(1): 48-77 (2002) - [c22]Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk:
Editors' Introduction. ALT 2002: 1-6 - [c21]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
A Second-Order Perceptron Algorithm. COLT 2002: 121-137 - [c20]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
Margin-Based Algorithms for Information Filtering. NIPS 2002: 470-477 - [c19]Nicola Cancedda, Cyril Goutte, Jean-Michel Renders, Nicolò Cesa-Bianchi, Alex Conconi, Yaoyong Li, John Shawe-Taylor, Alexei Vinokourov, Thore Graepel, Claudio Gentile:
Kernel Methods for Document Filtering. TREC 2002 - [e2]Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk:
Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings. Lecture Notes in Computer Science 2533, Springer 2002, ISBN 3-540-00170-0 [contents] - 2001
- [j15]Nicolò Cesa-Bianchi, Gábor Lugosi:
Worst-Case Bounds for the Logarithmic Loss of Predictors. Mach. Learn. 43(3): 247-264 (2001) - [c18]Nicolò Cesa-Bianchi, Gábor Lugosi:
Potential-Based Algorithms in Online Prediction and Game Theory. COLT/EuroCOLT 2001: 48-64 - [c17]Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
On the Generalization Ability of On-Line Learning Algorithms. NIPS 2001: 359-366 - 2000
- [e1]Nicolò Cesa-Bianchi, Sally A. Goldman:
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28 - July 1, 2000, Palo Alto, California, USA. Morgan Kaufmann 2000, ISBN 1-55860-703-X [contents] - [i2]Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire:
Gambling in a rigged casino: The adversarial multi-armed bandit problem. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Peter Auer, Nicolò Cesa-Bianchi:
On-line Learning with Malicious Noise and the Closure Algorithm. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j14]Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon:
Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM 46(5): 684-719 (1999) - [j13]Nicolò Cesa-Bianchi:
Analysis of Two Gradient-Based Algorithms for On-Line Regression. J. Comput. Syst. Sci. 59(3): 392-411 (1999) - [j12]Jonathan Baxter, Nicolò Cesa-Bianchi:
Guest Editors' Introduction. Mach. Learn. 37(3): 239-240 (1999) - [c16]Nicolò Cesa-Bianchi, Gábor Lugosi:
Minimax Regret Under log Loss for General Classes of Experts. COLT 1999: 12-18 - 1998
- [j11]Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza:
On Bayes Methods for On-Line Boolean Prediction. Algorithmica 22(1/2): 112-137 (1998) - [j10]Peter Auer, Nicolò Cesa-Bianchi:
On-Line Learning with Malicious Noise and the Closure Algorithm. Ann. Math. Artif. Intell. 23(1-2): 83-99 (1998) - [j9]Nicolò Cesa-Bianchi, David Haussler:
A Graph-theoretic Generalization of the Sauer-Shelah Lemma. Discret. Appl. Math. 86(1): 27-35 (1998) - [c15]Nicolò Cesa-Bianchi, Gábor Lugosi:
On Sequential Prediction of Individual Sequences Relative to a Set of Experts. COLT 1998: 1-11 - [c14]Nicolò Cesa-Bianchi, Paul Fischer:
Finite-Time Regret Bounds for the Multiarmed Bandit Problem. ICML 1998: 100-108 - 1997
- [j8]Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, Manfred K. Warmuth:
How to use expert advice. J. ACM 44(3): 427-485 (1997) - [j7]Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler:
Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM 44(4): 615-631 (1997) - [c13]Nicolò Cesa-Bianchi:
Analysis of Two Gradient-based Algorithms for On-line Regression. COLT 1997: 163-170 - [c12]Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT 1997: 119-133 - 1996
- [j6]Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, Manfred K. Warmuth:
On-line Prediction and Conversion Strategies. Mach. Learn. 25(1): 71-110 (1996) - [j5]Nicolò Cesa-Bianchi, Philip M. Long, Manfred K. Warmuth:
Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Trans. Neural Networks 7(3): 604-619 (1996) - [c11]Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza:
On Bayes Methods for On-Line Boolean Prediction. COLT 1996: 314-324 - [c10]Peter Auer, Pasquale Caianiello, Nicolò Cesa-Bianchi:
Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract). PODC 1996: 312 - [c9]Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon:
Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC 1996: 141-150 - 1995
- [j4]Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. Inf. Process. Lett. 56(1): 15-17 (1995) - [j3]Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler, Philip M. Long:
Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions. J. Comput. Syst. Sci. 50(1): 74-86 (1995) - [c8]Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire:
Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem. FOCS 1995: 322-331 - 1994
- [j2]Nicolò Cesa-Bianchi, Anders Krogh, Manfred K. Warmuth:
Bounds on approximate steepest descent for likelihood maximization in exponential families. IEEE Trans. Inf. Theory 40(4): 1215-1218 (1994) - [c7]Peter Auer, Nicolò Cesa-Bianchi:
On-line Learning with Malicious Noise and the Closure Algorithm. AII/ALT 1994: 229-247 - 1993
- [c6]Nicolò Cesa-Bianchi, Philip M. Long, Manfred K. Warmuth:
Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule. COLT 1993: 429-438 - [c5]Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, Manfred K. Warmuth:
On-line prediction and conversion strategies. EuroCOLT 1993: 205-216 - [c4]Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler:
Scale-sensitive Dimensions, Uniform Convergence, and Learnability. FOCS 1993: 292-301 - [c3]Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, Manfred K. Warmuth:
How to use expert advice. STOC 1993: 382-391 - 1992
- [c2]Shai Ben-David, Nicolò Cesa-Bianchi, Philip M. Long:
Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions. COLT 1992: 333-340 - 1990
- [c1]Nicolò Cesa-Bianchi:
Learning the Distribution in the Extended PAC Model. ALT 1990: 236-246
1980 – 1989
- 1988
- [j1]Gianpiero Cattaneo, Nicolò Cesa-Bianchi:
Microcanonical annealing on neural networks. Neural Networks 1(Supplement-1): 81-82 (1988)
Coauthor Index
Tommaso Cesari
aka: Tommaso Renato Cesari
aka: Tommaso Renato Cesari
[j53] [i47] [j51] [c80] [j47] [c79] [c78] [c76] [i35] [i32] [c75] [i30] [i28] [j45] [i24] [j44] [c67] [c66] [c64] [c63] [i22] [i21] [i20] [i19] [i16] [i15] [c61] [c59] [c56] [i9] [j37] [j36] [c50] [j34] [c48] [c46] [c43] [c41] [c38] [j31] [c37] [c36] [j29] [j26] [j25] [c35] [c34] [j22] [c30] [j20] [c27] [c25] [c24] [c23] [j18] [c21] [c20] [c19] [c17]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
