| 2001 | Smooth Boosting and Learning with Malicious Noise. | Rocco A. Servedio |
| 2001 | A Generalized Representer Theorem. | Bernhard Schlkopf, Ralf Herbrich, Alexander J. Smola |
| 2001 | Radial Basis Function Neural Networks Have Superlinear VC Dimension. | Michael Schmitt |
| 2001 | Discrete Prediction Games with Arbitrary Feedback and Loss. | Antonio Piccolboni, Christian Schindelhauer |
| 2001 | Bounds on Sample Size for Policy Evaluation in Markov Environments. | Leonid Peshkin, Sayan Mukherjee |
| 2001 | Pattern Recognition and Density Estimation under the General i.i.d. Assumption. | Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alex Gammerman |
| 2001 | Learning Relatively Small Classes. | Shahar Mendelson |
| 2001 | Geometric Methods in the Analysis of Glivenko-Cantelli Classes. | Shahar Mendelson |
| 2001 | Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. | Shie Mannor, Nahum Shimkin |
| 2001 | Geometric Bounds for Generalization in Boosting. | Shie Mannor, Ron Meir |
| 2001 | On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses. | Philip M. Long |
| 2001 | A Theoretical Analysis of Query Selection for Collaborative Filtering. | Wee Sun Lee, Philip M. Long |
| 2001 | Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. | Vladimir Koltchinskii, Dmitriy Panchenko, Fernando Lozano |
| 2001 | Data-Dependent Margin-Based Generalization Bounds for Classification. | Balzs Kgl, Tams Linder, Gbor Lugosi |
| 2001 | Optimizing Average Reward Using Discounted Rewards. | Sham M. Kakade |
| 2001 | Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. | Sanjay Jain, Efim B. Kinber |
| 2001 | Learning Additive Models Online with Fast Evaluating Kernels. | Mark Herbster |
| 2001 | Strong Entropy Concentration, Game Theory, and Algorithmic Randomness. | Peter Grnwald |
| 2001 | When Can Two Unsupervised Learners Achieve PAC Separation? | Paul W. Goldberg |
| 2001 | Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. | Paul W. Goldberg |
| 2001 | Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. | Jrgen Forster, Niels Schmitt, Hans Ulrich Simon |
| 2001 | Learning Rates for Q-Learning. | Eyal Even-Dar, Yishay Mansour |
| 2001 | Ultraconservative Online Algorithms for Multiclass Problems. | Koby Crammer, Yoram Singer |
| 2001 | Efficiently Approximating Weighted Sums with Exponentially Many Terms. | Deepak Chawla, Lin Li, Stephen Scott |
| 2001 | Potential-Based Algorithms in Online Prediction and Game Theory. | Nicol Cesa-Bianchi, Gbor Lugosi |