1. Introduction to the special issue on COLT 2006

   • Avrim Blum
   • Gabor Lugosi
   • Hans Ulrich Simon

   Editorial 28 September 2007 Pages: 75 - 77

2. DNF are teachable in the average case

   • Homin K. Lee
   • Rocco A. Servedio
   • Andrew Wan

   OriginalPaper 21 April 2007 Pages: 79 - 96

3. Unconditional lower bounds for learning intersections of halfspaces

   • Adam R. Klivans
   • Alexander A. Sherstov

   OriginalPaper 25 May 2007 Pages: 97 - 114

4. A primal-dual perspective of online learning algorithms

   • Shai Shalev-Shwartz
   • Yoram Singer

   OriginalPaper 11 July 2007 Pages: 115 - 142

5. Tracking the best hyperplane with a simple budget Perceptron

   • Giovanni Cavallanti
   • Nicolò Cesa-Bianchi
   • Claudio Gentile

   OriginalPaper 02 February 2007 Pages: 143 - 167

6. Logarithmic regret algorithms for online convex optimization

   • Elad Hazan
   • Amit Agarwal
   • Satyen Kale

   OriginalPaper 08 August 2007 Pages: 169 - 192

7. Competing with wild prediction rules

   • Vladimir Vovk

   OriginalPaper 26 September 2007 Pages: 193 - 212

8. Active sampling for multiple output identification

   • Shai Fine
   • Yishay Mansour

   OriginalPaper 02 October 2007 Pages: 213 - 228