The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicolò Cesa-Bianchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicolò Cesa-Bianchi
    Applications of Regularized Least Squares to Classification Problems. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:14-18 [Conf]
  2. Nicolò Cesa-Bianchi
    Learning the Distribution in the Extended PAC Model. [Citation Graph (0, 0)][DBLP]
    ALT, 1990, pp:236-246 [Conf]
  3. Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
    Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:1-6 [Conf]
  4. Peter Auer, Nicolò Cesa-Bianchi
    On-line Learning with Malicious Noise and the Closure Algorithm. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:229-247 [Conf]
  5. Shai Ben-David, Nicolò Cesa-Bianchi, Philip M. Long
    Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:333-340 [Conf]
  6. Nicolò Cesa-Bianchi, Philip M. Long, Manfred K. Warmuth
    Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:429-438 [Conf]
  7. Nicolò Cesa-Bianchi
    Analysis of Two Gradient-based Algorithms for On-line Regression. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:163-170 [Conf]
  8. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    A Second-Order Perceptron Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:121-137 [Conf]
  9. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:373-387 [Conf]
  10. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    Regret Bounds for Hierarchical Classification with Linear-Threshold Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:93-108 [Conf]
  11. Nicolò Cesa-Bianchi, Claudio Gentile
    Tracking the Best Hyperplane with a Simple Budget Perceptron. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:483-498 [Conf]
  12. Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza
    On Bayes Methods for On-Line Boolean Prediction. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:314-324 [Conf]
  13. Nicolò Cesa-Bianchi, Gábor Lugosi
    Potential-Based Algorithms in Online Prediction and Game Theory. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:48-64 [Conf]
  14. Nicolò Cesa-Bianchi, Gábor Lugosi
    On Sequential Prediction of Individual Sequences Relative to a Set of Experts. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:1-11 [Conf]
  15. Nicolò Cesa-Bianchi, Gábor Lugosi
    Minimax Regret Under log Loss for General Classes of Experts. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:12-18 [Conf]
  16. Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz
    Minimizing Regret with Label Efficient Prediction. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:77-92 [Conf]
  17. Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz
    Improved Second-Order Bounds for Prediction with Expert Advice. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:217-232 [Conf]
  18. Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon
    Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:119-133 [Conf]
  19. Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
    Scale-sensitive Dimensions, Uniform Convergence, and Learnability [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:292-301 [Conf]
  20. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire
    Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:322-331 [Conf]
  21. Claudio Bettini, Nicolò Cesa-Bianchi, Daniele Riboni
    A Distributed Architecture for Management and Retrieval of Extended Points of Interest. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2005, pp:266-272 [Conf]
  22. Nicolò Cesa-Bianchi, Paul Fischer
    Finite-Time Regret Bounds for the Multiarmed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    ICML, 1998, pp:100-108 [Conf]
  23. Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni
    Hierarchical classification: combining Bayes with SVM. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:177-184 [Conf]
  24. Alessandra Agostini, Claudio Bettini, Nicolò Cesa-Bianchi, Dario Maggiorini, Daniele Riboni, Michele Ruberl, Cristiano Sala, Davide Vitali
    Towards Highly Adaptive Services for Mobile Computing. [Citation Graph (0, 0)][DBLP]
    MOBIS, 2004, pp:121-134 [Conf]
  25. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    On the Generalization Ability of On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2001, pp:359-366 [Conf]
  26. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    Margin-Based Algorithms for Information Filtering. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:470-477 [Conf]
  27. Nicolò Cesa-Bianchi, Claudio Gentile, Andrea Tironi, Luca Zaniboni
    Incremental Algorithms for Hierarchical Classification. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  28. Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni
    Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  29. Nicolò Cesa-Bianchi, Claudio Gentile
    Improved risk tail bounds for on-line algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2005, pp:- [Conf]
  30. Peter Auer, Pasquale Caianiello, Nicolò Cesa-Bianchi
    Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:312- [Conf]
  31. Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans-Ulrich Simon
    Noise-Tolerant Learning Near the Information-Theoretic Bound. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:141-150 [Conf]
  32. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, Manfred K. Warmuth
    How to use expert advice. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:382-391 [Conf]
  33. 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. [Citation Graph (0, 0)][DBLP]
    TREC, 2002, pp:- [Conf]
  34. Nicolò Cesa-Bianchi, David P. Helmbold, Sandra Panizza
    On Bayes Methods for On-Line Boolean Prediction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:112-137 [Journal]
  35. Peter Auer, Nicolò Cesa-Bianchi
    On-Line Learning with Malicious Noise and the Closure Algorithm. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:83-99 [Journal]
  36. Nicolò Cesa-Bianchi, David Haussler
    A Graph-theoretic Generalization of the Sauer-Shelah Lemma. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:1, pp:27-35 [Journal]
  37. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire
    Gambling in a rigged casino: The adversarial multi-armed bandit problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:68, pp:- [Journal]
  38. Peter Auer, Nicolò Cesa-Bianchi
    On-line Learning with Malicious Noise and the Closure Algorithm [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:71, pp:- [Journal]
  39. Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino
    Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:15-17 [Journal]
  40. Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler
    Scale-sensitive dimensions, uniform convergence, and learnability. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:615-631 [Journal]
  41. Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans-Ulrich Simon
    Sample-Efficient Strategies for Learning in the Presence of Noise. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:5, pp:684-719 [Journal]
  42. Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, Manfred K. Warmuth
    How to use expert advice. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:427-485 [Journal]
  43. Peter Auer, Nicolò Cesa-Bianchi, Claudio Gentile
    Adaptive and Self-Confident On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:1, pp:48-75 [Journal]
  44. Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler, Philip M. Long
    Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:74-86 [Journal]
  45. Nicolò Cesa-Bianchi
    Analysis of Two Gradient-Based Algorithms for On-Line Regression. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:3, pp:392-411 [Journal]
  46. Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni
    Worst-Case Analysis of Selective Sampling for Linear Classification. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2006, v:7, n:, pp:1205-1230 [Journal]
  47. Nicolò Cesa-Bianchi, Claudio Gentile, Luca Zaniboni
    Incremental Algorithms for Hierarchical Classification. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2006, v:7, n:, pp:31-54 [Journal]
  48. Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer
    Finite-time Analysis of the Multiarmed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2002, v:47, n:2-3, pp:235-256 [Journal]
  49. Jonathan Baxter, Nicolò Cesa-Bianchi
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1999, v:37, n:3, pp:239-240 [Journal]
  50. Nicolò Cesa-Bianchi, Yoav Freund, David P. Helmbold, Manfred K. Warmuth
    On-line Prediction and Conversion Strategies. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1996, v:25, n:1, pp:71-110 [Journal]
  51. Nicolò Cesa-Bianchi, Gábor Lugosi
    Worst-Case Bounds for the Logarithmic Loss of Predictors. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:43, n:3, pp:247-264 [Journal]
  52. Nicolò Cesa-Bianchi, Gábor Lugosi
    Potential-Based Algorithms in On-Line Prediction and Game Theory. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2003, v:51, n:3, pp:239-261 [Journal]
  53. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire
    The Nonstochastic Multiarmed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:48-77 [Journal]
  54. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    A Second-Order Perceptron Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:640-668 [Journal]
  55. Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:1-2 [Journal]
  56. Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile
    On the Generalization Ability of On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2050-2057 [Journal]
  57. Nicolò Cesa-Bianchi, Anders Krogh, Manfred K. Warmuth
    Bounds on approximate steepest descent for likelihood maximization in exponential families. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1215-0 [Journal]
  58. Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz
    Minimizing regret with label efficient prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:6, pp:2152-2162 [Journal]
  59. Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz
    Improved second-order bounds for prediction with expert advice. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2007, v:66, n:2-3, pp:321-352 [Journal]
  60. Nicolò Cesa-Bianchi
    Applications of regularized least squares to pattern classification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:221-231 [Journal]

  61. Learning Unknown Graphs. [Citation Graph (, )][DBLP]


  62. Linear Algorithms for Online Multitask Classification. [Citation Graph (, )][DBLP]


  63. Robust bounds for classification via selective sampling. [Citation Graph (, )][DBLP]


  64. Efficient Learning with Partially Observed Attributes. [Citation Graph (, )][DBLP]


  65. Random Spanning Trees and the Prediction of Weighted Graphs. [Citation Graph (, )][DBLP]


  66. Linear Classification and Selective Sampling Under Low Noise Conditions. [Citation Graph (, )][DBLP]


  67. HCGene: a software tool to support the hierarchical classification of genes. [Citation Graph (, )][DBLP]


  68. Efficient Learning with Partially Observed Attributes [Citation Graph (, )][DBLP]


  69. Online Learning of Noisy Data with Kernels [Citation Graph (, )][DBLP]


Search in 0.666secs, Finished in 0.668secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002