![]() | ![]() |
| 2012 | ||
|---|---|---|
| 103 | Sébastien Bubeck, Nicolò Cesa-Bianchi, Sham M. Kakade: Towards minimax policies for online linear optimization with bandit feedback CoRR abs/1202.3079: (2012) | |
| 102 | Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, Gilles Stoltz: A new look at shifting regret CoRR abs/1202.3323: (2012) | |
| 101 | Sébastien Bubeck, Nicolò Cesa-Bianchi: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems CoRR abs/1204.5721: (2012) | |
| 100 | Francesco Orabona, Nicolò Cesa-Bianchi, Claudio Gentile: Beyond Logarithmic Bounds in Online Learning. Journal of Machine Learning Research - Proceedings Track 22: 823-831 (2012) | |
| 99 | 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. Journal of Machine Learning Research - Proceedings Track 26: 98-111 (2012) | |
| 2011 | ||
| 98 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Quantity Makes Quality: Learning with Partial Views. AAAI 2011 | |
| 97 | Nicolò Cesa-Bianchi: The Game-Theoretic Approach to Machine Learning and Adaptation. ICAIS 2011: 1 | |
| 96 | Francesco Orabona, Nicolò Cesa-Bianchi: Better Algorithms for Selective Sampling. ICML 2011: 433-440 | |
| 95 | Nicolò Cesa-Bianchi: Ensembles and Multiple Classifiers: A Game-Theoretic View. MCS 2011: 2-5 | |
| 94 | Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella: See the Tree Through the Lines: The Shazoo Algorithm. NIPS 2011: 1584-1592 | |
| 93 | Nicolò Cesa-Bianchi, Ohad Shamir: Efficient Online Learning via Randomized Rounding. NIPS 2011: 343-351 | |
| 92 | 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) | |
| 91 | Nicolò Cesa-Bianchi, Ohad Shamir: Efficient Online Learning via Randomized Rounding CoRR abs/1106.2429: (2011) | |
| 90 | Nicolò Cesa-Bianchi, Sham Kakade: An Optimal Algorithm for Linear Bandits CoRR abs/1110.4322: (2011) | |
| 89 | 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) | |
| 88 | Yevgeny Seldin, François Laviolette, Nicolò Cesa-Bianchi, John Shawe-Taylor, Peter Auer: PAC-Bayesian Inequalities for Martingales CoRR abs/1110.6886: (2011) | |
| 87 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Online Learning of Noisy Data. IEEE Transactions on Information Theory 57(12): 7907-7931 (2011) | |
| 86 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Efficient Learning with Partially Observed Attributes. Journal of Machine Learning Research 12: 2857-2878 (2011) | |
| 85 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile: Learning noisy linear classifiers via adaptive and selective sampling. Machine Learning 83(1): 71-102 (2011) | |
| 84 | 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) | |
| 2010 | ||
| 83 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Online Learning of Noisy Data with Kernels. COLT 2010: 218-230 | |
| 82 | Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella: Active Learning on Trees and Graphs. COLT 2010: 320-332 | |
| 81 | Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella: Random Spanning Trees and the Prediction of Weighted Graphs. ICML 2010: 175-182 | |
| 80 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Efficient Learning with Partially Observed Attributes. ICML 2010: 183-190 | |
| 79 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Efficient Learning with Partially Observed Attributes CoRR abs/1004.4421: (2010) | |
| 78 | Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, Ohad Shamir: Online Learning of Noisy Data with Kernels CoRR abs/1005.2296: (2010) | |
| 77 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile: Linear Algorithms for Online Multitask Classification. Journal of Machine Learning Research 11: 2901-2934 (2010) | |
| 76 | Nicolò Cesa-Bianchi, Giorgio Valentini: Hierarchical Cost-Sensitive Algorithms for Genome-Wide Gene Function Prediction. Journal of Machine Learning Research - Proceedings Track 8: 14-29 (2010) | |
| 75 | Nicolò Cesa-Bianchi, David R. Hardoon, Gayle Leen: Guest Editorial: Learning from multiple sources. Machine Learning 79(1-2): 1-3 (2010) | |
| 2009 | ||
| 74 | Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale: Learning Unknown Graphs. ALT 2009: 110-125 | |
| 73 | Nicolò Cesa-Bianchi, Gábor Lugosi: Combinatorial Bandits. COLT 2009 | |
| 72 | Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale: Fast and Optimal Prediction on a Labeled Tree. COLT 2009 | |
| 71 | Nicolò Cesa-Bianchi, Claudio Gentile, Francesco Orabona: Robust bounds for classification via selective sampling. ICML 2009: 16 | |
| 2008 | ||
| 70 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile: Linear Algorithms for Online Multitask Classification. COLT 2008: 251-262 | |
| 69 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile: Linear Classification and Selective Sampling Under Low Noise Conditions. NIPS 2008: 249-256 | |
| 68 | Giorgio Valentini, Nicolò Cesa-Bianchi: HCGene: a software tool to support the hierarchical classification of genes. Bioinformatics 24(5): 729-731 (2008) | |
| 67 | Nicolò Cesa-Bianchi, Claudio Gentile: Improved Risk Tail Bounds for On-Line Algorithms. IEEE Transactions on Information Theory 54(1): 386-390 (2008) | |
| 2007 | ||
| 66 | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz: Improved second-order bounds for prediction with expert advice. Machine Learning 66(2-3): 321-352 (2007) | |
| 65 | Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile: Tracking the best hyperplane with a simple budget Perceptron. Machine Learning 69(2-3): 143-167 (2007) | |
| 64 | Nicolò Cesa-Bianchi: Applications of regularized least squares to pattern classification. Theor. Comput. Sci. 382(3): 221-231 (2007) | |
| 2006 | ||
| 63 | Nicolò Cesa-Bianchi, Gábor Lugosi: Prediction, learning, and games. Cambridge University Press 2006: I-XII, 1-394 | |
| 62 | Nicolò Cesa-Bianchi, Claudio Gentile: Tracking the Best Hyperplane with a Simple Budget Perceptron. COLT 2006: 483-498 | |
| 61 | Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni: Hierarchical classification: combining Bayes with SVM. ICML 2006: 177-184 | |
| 60 | Peter Auer, Nicolò Cesa-Bianchi: A distributed voting scheme to maximize preferences. ITA 40(2): 389-403 (2006) | |
| 59 | Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni: Worst-Case Analysis of Selective Sampling for Linear Classification. Journal of Machine Learning Research 7: 1205-1230 (2006) | |
| 58 | Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni: Incremental Algorithms for Hierarchical Classification. Journal of Machine Learning Research 7: 31-54 (2006) | |
| 57 | Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz: Regret Minimization Under Partial Monitoring. Math. Oper. Res. 31(3): 562-580 (2006) | |
| 56 | Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann: Foreword. Theor. Comput. Sci. 350(1): 1-2 (2006) | |
| 2005 | ||
| 55 | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz: Improved Second-Order Bounds for Prediction with Expert Advice. COLT 2005: 217-232 | |
| 54 | Claudio Bettini, Nicolò Cesa-Bianchi, Daniele Riboni: A Distributed Architecture for Management and Retrieval of Extended Points of Interest. ICDCS Workshops 2005: 266-272 | |
| 53 | Nicolò Cesa-Bianchi, Claudio Gentile: Improved risk tail bounds for on-line algorithms. NIPS 2005 | |
| 52 | Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz: Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory 51(6): 2152-2162 (2005) | |
| 51 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: A Second-Order Perceptron Algorithm. SIAM J. Comput. 34(3): 640-668 (2005) | |
| 2004 | ||
| 50 | Nicolò Cesa-Bianchi: Applications of Regularized Least Squares to Classification Problems. ALT 2004: 14-18 | |
| 49 | Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz: Minimizing Regret with Label Efficient Prediction. COLT 2004: 77-92 | |
| 48 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: Regret Bounds for Hierarchical Classification with Linear-Threshold Functions. COLT 2004: 93-108 | |
| 47 | 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 | |
| 46 | Nicolò Cesa-Bianchi, Claudio Gentile, Andrea Tironi, Luca Zaniboni: Incremental Algorithms for Hierarchical Classification. NIPS 2004 | |
| 45 | Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni: Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms. NIPS 2004 | |
| 44 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: On the Generalization Ability of On-Line Learning Algorithms. IEEE Transactions on Information Theory 50(9): 2050-2057 (2004) | |
| 2003 | ||
| 43 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling. COLT 2003: 373-387 | |
| 42 | Nicolò Cesa-Bianchi, Gábor Lugosi: Potential-Based Algorithms in On-Line Prediction and Game Theory. Machine Learning 51(3): 239-261 (2003) | |
| 2002 | ||
| 41 | Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk: Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings Springer 2002 | |
| 40 | Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk: Editors' Introduction. ALT 2002: 1-6 | |
| 39 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: A Second-Order Perceptron Algorithm. COLT 2002: 121-137 | |
| 38 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: Margin-Based Algorithms for Information Filtering. NIPS 2002: 470-477 | |
| 37 | 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 | |
| 36 | Peter Auer, Nicolò Cesa-Bianchi, Claudio Gentile: Adaptive and Self-Confident On-Line Learning Algorithms. J. Comput. Syst. Sci. 64(1): 48-75 (2002) | |
| 35 | Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2-3): 235-256 (2002) | |
| 34 | Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire: The Nonstochastic Multiarmed Bandit Problem. SIAM J. Comput. 32(1): 48-77 (2002) | |
| 2001 | ||
| 33 | Nicolò Cesa-Bianchi, Gábor Lugosi: Potential-Based Algorithms in Online Prediction and Game Theory. COLT/EuroCOLT 2001: 48-64 | |
| 32 | Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile: On the Generalization Ability of On-Line Learning Algorithms. NIPS 2001: 359-366 | |
| 31 | Nicolò Cesa-Bianchi, Gábor Lugosi: Worst-Case Bounds for the Logarithmic Loss of Predictors. Machine Learning 43(3): 247-264 (2001) | |
| 2000 | ||
| 30 | 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 Morgan Kaufmann 2000 | |
| 29 | Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire: Gambling in a rigged casino: The adversarial multi-armed bandit problem Electronic Colloquium on Computational Complexity (ECCC) 7(68): (2000) | |
| 28 | Peter Auer, Nicolò Cesa-Bianchi: On-line Learning with Malicious Noise and the Closure Algorithm Electronic Colloquium on Computational Complexity (ECCC) 7(71): (2000) | |
| 1999 | ||
| 27 | Nicolò Cesa-Bianchi, Gábor Lugosi: Minimax Regret Under log Loss for General Classes of Experts. COLT 1999: 12-18 | |
| 26 | 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) | |
| 25 | Nicolò Cesa-Bianchi: Analysis of Two Gradient-Based Algorithms for On-Line Regression. J. Comput. Syst. Sci. 59(3): 392-411 (1999) | |
| 24 | Jonathan Baxter, Nicolò Cesa-Bianchi: Guest Editors' Introduction. Machine Learning 37(3): 239-240 (1999) | |
| 1998 | ||
| 23 | Nicolò Cesa-Bianchi, Gábor Lugosi: On Sequential Prediction of Individual Sequences Relative to a Set of Experts. COLT 1998: 1-11 | |
| 22 | Nicolò Cesa-Bianchi, Paul Fischer: Finite-Time Regret Bounds for the Multiarmed Bandit Problem. ICML 1998: 100-108 | |
| 21 | Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza: On Bayes Methods for On-Line Boolean Prediction. Algorithmica 22(1/2): 112-137 (1998) | |
| 20 | 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) | |
| 19 | Nicolò Cesa-Bianchi, David Haussler: A Graph-theoretic Generalization of the Sauer-Shelah Lemma. Discrete Applied Mathematics 86(1): 27-35 (1998) | |
| 1997 | ||
| 18 | Nicolò Cesa-Bianchi: Analysis of Two Gradient-based Algorithms for On-line Regression. COLT 1997: 163-170 | |
| 17 | Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon: Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT 1997: 119-133 | |
| 16 | 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) | |
| 15 | Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler: Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM 44(4): 615-631 (1997) | |
| 1996 | ||
| 14 | Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza: On Bayes Methods for On-Line Boolean Prediction. COLT 1996: 314-324 | |
| 13 | Peter Auer, Pasquale Caianiello, Nicolò Cesa-Bianchi: Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract). PODC 1996: 312 | |
| 12 | Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans-Ulrich Simon: Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC 1996: 141-150 | |
| 11 | Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, Manfred K. Warmuth: On-line Prediction and Conversion Strategies. Machine Learning 25(1): 71-110 (1996) | |
| 1995 | ||
| 10 | 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 | |
| 9 | 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) | |
| 8 | 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) | |
| 1994 | ||
| 7 | Peter Auer, Nicolò Cesa-Bianchi: On-line Learning with Malicious Noise and the Closure Algorithm. AII/ALT 1994: 229-247 | |
| 6 | Nicolò Cesa-Bianchi, Anders Krogh, Manfred K. Warmuth: Bounds on approximate steepest descent for likelihood maximization in exponential families. IEEE Transactions on Information Theory 40(4): 1215-1218 (1994) | |
| 1993 | ||
| 5 | 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 | |
| 4 | Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler: Scale-sensitive Dimensions, Uniform Convergence, and Learnability FOCS 1993: 292-301 | |
| 3 | 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 | ||
| 2 | Shai Ben-David, Nicolò Cesa-Bianchi, Philip M. Long: Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions. COLT 1992: 333-340 | |
| 1990 | ||
| 1 | Nicolò Cesa-Bianchi: Learning the Distribution in the Extended PAC Model. ALT 1990: 236-246 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page