Best Paper Awards
- Optimal and Adaptive Algorithms for Online Boosting, Alina Beygelzimer, Satyen Kale, Haipeng Luo
[PDF] - A Nearly-Linear Time Framework for Graph-Structured Sparsity, Chinmay Hegde, Piotr Indyk, Ludwig Schmid
[PDF]
Test of Time Award – from ICML 2005.
- Learning to Rank Using Gradient Descent Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, Greg Hullender
[PDF]