JMLR Special Issue on Computational Learning Theory

Introduction to the Special Issue on Computational Learning Theory

Philip M. Long; 3(Nov):361--362, 2002.
[abs][pdf] [ps.gz] [ps]

Tracking a Small Set of Experts by Mixing Past Posteriors

Olivier Bousquet, Manfred K. Warmuth; 3(Nov):363--396, 2002.
[abs][pdf] [ps.gz] [ps]

Using Confidence Bounds for Exploitation-Exploration Trade-offs

Peter Auer; 3(Nov):397--422, 2002.
[abs][pdf] [ps.gz] [ps]

Efficient Algorithms for Universal Portfolios

Adam Kalai, Santosh Vempala; 3(Nov):423--440, 2002.
[abs][pdf] [ps.gz] [ps]

Limitations of Learning Via Embeddings in Euclidean Half Spaces

Shai Ben-David, Nadav Eiron, Hans Ulrich Simon; 3(Nov):441--461, 2002.
[abs][pdf] [ps.gz] [ps]

Rademacher and Gaussian Complexities: Risk Bounds and Structural Results

Peter L. Bartlett, Shahar Mendelson; 3(Nov):463--482, 2002.
[abs][pdf] [ps.gz] [ps]

On Boosting with Polynomially Bounded Distributions

Nader H. Bshouty, Dmitry Gavinsky; 3(Nov):483--506, 2002.
[abs][pdf] [ps.gz] [ps]