Conferences in DBLP
Shahar Mendelson , Robert C. Williamson Agnostic Learning Nonconvex Function Classes. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:1-13 [Conf ] Shahar Mendelson , Roman Vershynin Entropy, Combinatorial Dimensions and Random Averages. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:14-28 [Conf ] Shahar Mendelson Geometric Parameters of Kernel Machines. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:29-43 [Conf ] Peter L. Bartlett , Olivier Bousquet , Shahar Mendelson Localized Rademacher Complexities. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:44-58 [Conf ] Olivier Bousquet , Vladimir Koltchinskii , Dmitriy Panchenko Some Local Measures of Complexity of Convex Hulls and Generalization Bounds. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:59-73 [Conf ] Eiji Takimoto , Manfred K. Warmuth Path Kernels and Multiplicative Updates. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:74-89 [Conf ] Michael V. Vyugin , Vladimir V. V'yugin Predictive Complexity and Information. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:90-104 [Conf ] Yuri Kalnishkan , Michael V. Vyugin Mixability and the Existence of Weak Complexities. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:105-120 [Conf ] Nicolò Cesa-Bianchi , Alex Conconi , Claudio Gentile A Second-Order Perceptron Algorithm. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:121-137 [Conf ] Chris Mesterharm Tracking Linear-Threshold Concepts with Winnow. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:138-152 [Conf ] Henning Fernau Learning Tree Languages from Text. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:153-168 [Conf ] Yusuke Suzuki , Ryuta Akanuma , Takayoshi Shoudai , Tetsuhiro Miyahara , Tomoyuki Uchida Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:169-184 [Conf ] Colin de la Higuera , José Oncina Inferring Deterministic Linear Languages. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:185-200 [Conf ] Sandra Zilles Merging Uniform Inductive Learners. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:201-215 [Conf ] Jürgen Schmidhuber The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:216-228 [Conf ] Ke Yang New Lower Bounds for Statistical Query Learning. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:229-243 [Conf ] Nader H. Bshouty , Jeffrey C. Jackson , Christino Tamon Exploring Learnability between Exact and PAC. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:244-254 [Conf ] Eyal Even-Dar , Shie Mannor , Yishay Mansour PAC Bounds for Multi-armed Bandit and Markov Decision Processes. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:255-270 [Conf ] Nader H. Bshouty , Lynn Burroughs Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:271-286 [Conf ] Nader H. Bshouty , Lynn Burroughs On the Proper Learning of Axis Parallel Concepts. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:287-302 [Conf ] Gábor Lugosi , Nicolas Vayatis A Consistent Strategy for Boosting Algorithms. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:303-318 [Conf ] Shie Mannor , Ron Meir , Tong Zhang The Consistency of Greedy Algorithms for Classification. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:319-333 [Conf ] Gunnar Rätsch , Manfred K. Warmuth Maximizing the Margin with Boosting. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:334-350 [Conf ] Sanjoy Dasgupta Performance Guarantees for Hierarchical Clustering. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:351-363 [Conf ] Marcus Hutter Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:364-379 [Conf ] Lance Fortnow , Jack H. Lutz Prediction and Dimension. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:380-395 [Conf ] Christos H. Papadimitriou Learning the Internet. [Citation Graph (0, 0)][DBLP ] COLT, 2002, pp:396- [Conf ]