| 2008 | Beyond Gaussians: Spectral Methods for Learning Mixtures of Heavy-Tailed Distributions. | Kamalika Chaudhuri, Satish Rao |
| 2008 | Learning Mixtures of Product Distributions Using Correlations and Independence. | Kamalika Chaudhuri, Satish Rao |
| 2008 | Finding Metric Structure in Information Theoretic Clustering. | Kamalika Chaudhuri, Andrew McGregor |
| 2008 | Linear Algorithms for Online Multitask Classification. | Giovanni Cavallanti, Nicol Cesa-Bianchi, Claudio Gentile |
| 2008 | Learning in the Limit with Adversarial Disturbances. | Constantine Caramanis, Shie Mannor |
| 2008 | Polynomial Regression under Arbitrary Product Distributions. | Eric Blais, Ryan O'Donnell, Karl Wimmer |
| 2008 | Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. | Andrey Bernstein, Nahum Shimkin |
| 2008 | Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning. | Shai Ben-David, Tyler Lu, Dvid Pl |
| 2008 | Relating Clustering Stability to Properties of Cluster Boundaries. | Shai Ben-David, Ulrike von Luxburg |
| 2008 | High-Probability Regret Bounds for Bandit Online Linear Optimization. | Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari |
| 2008 | The True Sample Complexity of Active Learning. | Maria-Florina Balcan, Steve Hanneke, Jennifer Wortman |
| 2008 | Improved Guarantees for Learning via Similarity Functions. | Maria-Florina Balcan, Avrim Blum, Nathan Srebro |
| 2008 | Learning Acyclic Probabilistic Circuits Using Test Paths. | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin |
| 2008 | An Efficient Reduction of Ranking to Classification. | Nir Ailon, Mehryar Mohri |
| 2008 | When Random Play is Optimal Against an Adversary. | Jacob D. Abernethy, Manfred K. Warmuth, Joel Yellin |
| 2008 | Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. | Jacob D. Abernethy, Elad Hazan, Alexander Rakhlin |
| 2008 | Optimal Stragies and Minimax Lower Bounds for Online Convex Games. | Jacob D. Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari |
| 2007 | When Is There a Free Matrix Lunch? | Manfred K. Warmuth |
| 2007 | Rademacher Margin Complexity. | Liwei Wang, Jufu Feng |
| 2007 | Competing with Stationary Prediction Strategies. | Vladimir Vovk |
| 2007 | Spectral Algorithms for Learning and Clustering. | Santosh S. Vempala |
| 2007 | Bounded Parameter Markov Decision Processes with Average Reward Criterion. | Ambuj Tewari, Peter L. Bartlett |
| 2007 | Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation? | Nathan Srebro |
| 2007 | How Good Is a Kernel When Used as a Similarity Measure? | Nathan Srebro |
| 2007 | Mind Change Optimal Learning of Bayes Net Structure. | Oliver Schulte, Wei Luo, Russell Greiner |