Conferences in DBLP
David A. McAllester , Robert E. Schapire On the Convergence Rate of Good-Turing Estimators. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:1-6 [Conf ] Jeffrey Jackson On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:7-15 [Conf ] Dinesh P. Mehta , Vijay Raghavan Decision Tree Approximations of Boolean Functions. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:16-24 [Conf ] John Langford , David A. McAllester Computable Shell Decomposition Bounds. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:25-34 [Conf ] Koby Crammer , Yoram Singer On the Learnability and Design of Output Codes for Multiclass Problems. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:35-46 [Conf ] Sanjay Jain , Efim B. Kinber , Rolf Wiehagen Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:47-58 [Conf ] Frank Stephan , Thomas Zeugmann Average-Case Complexity of Learning Polynomials. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:59-68 [Conf ] Yishay Mansour , David A. McAllester Generalization Bounds for Decision Trees. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:69-74 [Conf ] Nicolas Vayatis The Role of Critical Sets in Vapnik-Chervonenkis Theory. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:75-80 [Conf ] Shahar Mendelson , Naftali Tishby Statistical Sufficiency for Classes in Empirical L_{2} Spaces. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:81-89 [Conf ] Jürgen Forster , Manfred K. Warmuth Relative Expected Instantaneous Loss Bounds. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:90-99 [Conf ] Eiji Takimoto , Manfred K. Warmuth The Minimax Strategy for Gaussian Density Estimation. pp. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:100-106 [Conf ] Peter Auer , Claudio Gentile Adaptive and Self-Confident On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:107-117 [Conf ] Peter Auer An Improved On-line Algorithm for Learning Linear Evaluation Functions. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:118-125 [Conf ] Yoav Freund , Manfred Opper Continuous Drifting Games. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:126-132 [Conf ] Peter L. Bartlett , Jonathan Baxter Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:133-141 [Conf ] Michael J. Kearns , Satinder P. Singh Bias-Variance Error Bounds for Temporal Difference Updates. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:142-147 [Conf ] Rocco A. Servedio PAC Analogues of Perceptron and Winnow via Boosting the Margin. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:148-157 [Conf ] Michael Collins , Robert E. Schapire , Yoram Singer Logistic Regression, AdaBoost and Bregman Distances. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:158-169 [Conf ] Gunnar Rätsch , Manfred K. Warmuth , Sebastian Mika , Takashi Onoda , Steven Lemm , Klaus-Robert Müller Barrier Boosting. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:170-179 [Conf ] Carlos Domingo , Osamu Watanabe MadaBoost: A Modification of AdaBoost. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:180-189 [Conf ] Ron Meir , Ran El-Yaniv , Shai Ben-David Localized Boosting. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:190-199 [Conf ] Javed A. Aslam Improving Algorithms for Boosting. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:200-207 [Conf ] Nigel Duffy , David P. Helmbold Leveraging for Regression. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:208-219 [Conf ] Yishay Mansour , David A. McAllester Boosting Using Branching Programs. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:220-224 [Conf ] Paul W. Goldberg , Stephen Kwek The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:225-235 [Conf ] Judy Goldsmith , Robert H. Sloan , Balázs Szörényi , György Turán Improved Algorithms for Theory Revision with Queries. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:236-247 [Conf ] José L. Balcázar , Jorge Castro , David Guijarro Abstract Combinatorial Characterizations of Exact Learning via Queries. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:248-254 [Conf ] Shai Ben-David , Nadav Eiron , Hans-Ulrich Simon The Computational Complexity of Densest Region Detection. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:255-265 [Conf ] Shai Ben-David , Nadav Eiron , Philip M. Long On the Difficulty of Approximately Maximizing Agreements. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:266-274 [Conf ] Christian Kuhlmann Hardness Results for General Two-Layer Neural Networks. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:275-285 [Conf ] Peter L. Bartlett , Stéphane Boucheron , Gábor Lugosi Model Selection and Error Estimation. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:286-297 [Conf ] Thore Graepel , Ralf Herbrich , John Shawe-Taylor Generalisation Error Bounds for Sparse Linear Classifiers. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:298-303 [Conf ] Ralf Herbrich , Thore Graepel , John Shawe-Taylor Sparsity vs. Large Margins for Linear Classifiers. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:304-308 [Conf ] Robert C. Williamson , Alex J. Smola , Bernhard Schölkopf Entropy Numbers of Linear Function Classes. [Citation Graph (0, 0)][DBLP ] COLT, 2000, pp:309-319 [Conf ]