Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolò Cesa-Bianchi
Person information
- affiliation: University of Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c109]Lukas Zierahn
, Dirk van der Hoeven, Nicolò Cesa-Bianchi, Gergely Neu:
Nonstochastic Contextual Combinatorial Bandits. AISTATS 2023: 8771-8813- [c108]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - [c107]Nicolò Cesa-Bianchi, Tommaso Renato Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. COLT 2023: 1095-1130 - [c106]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 - [c105]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 - [c104]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 - [c103]Khaled Eldowa, Nicolò Cesa-Bianchi, Alberto Maria Metelli, Marcello Restelli:
Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice. ITW 2023: 30-35 - [i74]Giulia Clerici, Pierre Laforgue, Nicolò Cesa-Bianchi:
Linear Bandits with Memory: from Rotting to Rising. CoRR abs/2302.08345 (2023) - [i73]Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, Stefano Leonardi:
Repeated Bilateral Trade Against a Smoothed Adversary. CoRR abs/2302.10805 (2023) - [i72]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) - [i71]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) - [i70]Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicolò Cesa-Bianchi:
On the Minimax Regret for Online Learning with Feedback Graphs. CoRR abs/2305.15383 (2023) - [i69]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) - [i68]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) - [i67]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) - [i66]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) - [i65]Dirk van der Hoeven, Nikita Zhivotovskiy, Nicolò Cesa-Bianchi:
High-Probability Risk Bounds via Sequential Predictors. CoRR abs/2308.07588 (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 - [i64]Pierre Laforgue, Andrea Della Vecchia, Nicolò Cesa-Bianchi, Lorenzo Rosasco:
AdaTask: Adaptive Multitask Online Learning. CoRR abs/2205.15802 (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]