| 2002 | Tracking Linear-Threshold Concepts with Winnow. | Chris Mesterharm |
| 2002 | Agnostic Learning Nonconvex Function Classes. | Shahar Mendelson, Robert C. Williamson |
| 2002 | Entropy, Combinatorial Dimensions and Random Averages. | Shahar Mendelson, Roman Vershynin |
| 2002 | Geometric Parameters of Kernel Machines. | Shahar Mendelson |
| 2002 | The Consistency of Greedy Algorithms for Classification. | Shie Mannor, Ron Meir, Tong Zhang |
| 2002 | A Consistent Strategy for Boosting Algorithms. | Gbor Lugosi, Nicolas Vayatis |
| 2002 | Mixability and the Existence of Weak Complexities. | Yuri Kalnishkan, Michael V. Vyugin |
| 2002 | Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures. | Marcus Hutter |
| 2002 | Inferring Deterministic Linear Languages. | Colin de la Higuera, Jos Oncina |
| 2002 | Prediction and Dimension. | Lance Fortnow, Jack H. Lutz |
| 2002 | Learning Tree Languages from Text. | Henning Fernau |
| 2002 | PAC Bounds for Multi-armed Bandit and Markov Decision Processes. | Eyal Even-Dar, Shie Mannor, Yishay Mansour |
| 2002 | Performance Guarantees for Hierarchical Clustering. | Sanjoy Dasgupta |
| 2002 | A Second-Order Perceptron Algorithm. | Nicol Cesa-Bianchi, Alex Conconi, Claudio Gentile |
| 2002 | Exploring Learnability between Exact and PAC. | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
| 2002 | On the Proper Learning of Axis Parallel Concepts. | Nader H. Bshouty, Lynn Burroughs |
| 2002 | Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. | Nader H. Bshouty, Lynn Burroughs |
| 2002 | Some Local Measures of Complexity of Convex Hulls and Generalization Bounds. | Olivier Bousquet, Vladimir Koltchinskii, Dmitriy Panchenko |
| 2002 | Localized Rademacher Complexities. | Peter L. Bartlett, Olivier Bousquet, Shahar Mendelson |
| 2001 | On the Synthesis of Strategies Identifying Recursive Functions. | Sandra Zilles |
| 2001 | A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning. | Tong Zhang |
| 2001 | A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning. | Tong Zhang |
| 2001 | Toward a Computational Theory of Data Acquisition and Truthing. | David G. Stork |
| 2001 | How Many Queries Are Needed to Learn One Bit of Information? | Hans Ulrich Simon |
| 2001 | On Learning Monotone DNF under Product Distributions. | Rocco A. Servedio |