Abstract is missing.
- The discovery of algorithmic probability: A guide for the programming of true creativityRay J. Solomonoff. 1-22
- A decision-theoretic generalization of on-line learning and an application to boostingYoav Freund, Robert E. Schapire. 23-37
- Online learning versus offline learningShai Ben-David, Eyal Kushilevitz, Yishay Mansour. 38-52
- Learning distributions by their density-levels - a paradigm for learning without a teacherShai Ben-David, Michael Lindenbaum. 53-68
- Tight worst-case loss bounds for predicting with expert adviceDavid Haussler, Jyrki Kivinen, Manfred K. Warmuth. 69-83
- On-line maximum likelihood prediction with respect to general loss functionsKenji Yamanishi. 84-98
- The power of procrastination in inductive inference: How it depends on used ordinal notationsAndris Ambainis. 99-111
- Learnability of Kolmogorov-easy circuit expressions via queriesJosé L. Balcázar, Harry Buhrman, Montserrat Hermo. 112-124
- Trading monotonicity demands versus mind changesSteffen Lange, Thomas Zeugmann. 125-139
- Learning recursive functions from approximationsJohn Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer. 140-153
- On the intrinsic complexity of learningRusins Freivalds, Efim B. Kinber, Carl H. Smith. 154-168
- The structure of intrinsic complexity of learningSanjay Jain, Arun Sharma. 169-181
- Kolmogorov numberings and minimal identificationRusins Freivalds, Sanjay Jain. 182-195
- Stochastic complexity in learningJorma Rissanen. 196-210
- Function learning from interpolationMartin Anthony, Peter L. Bartlett. 211-221
- Approximation and learning of convex superpositionsLeonid Gurvits, Pascal Koiran. 222-236
- Minimum description length estimators under the optimal coding schemeV. G. Vovk. 237-251
- MDL learning of unions of simple pattern languages from positive examplesPekka Kilpeläinen, Heikki Mannila, Esko Ukkonen. 252-260
- A note on the use of probabilities by mechanical learnersEric Martin, Daniel N. Osherson. 261-271
- Characterizing rational versus exponential learning curvesDale Schuurmans. 272-286
- Is Pocket algorithm optimal?Marco Muselli. 287-297
- Some theorems concerning the free energy of (un)constrained stochastic hopfield neural networksJan van den Berg, Jan C. Bioch. 298-312
- A space-bounded learning algorithm for axis-parallel rectanglesFoued Ameur. 313-321
- Learning decision lists and trees with equivalence-queriesHans-Ulrich Simon. 322-336
- Bounding VC-dimension of neural networks: Progress and prospectsMarek Karpinski, Angus Macintyre. 337-341
- Average case analysis of a learning algorithm for µ-DNF expressionsMostefa Golea. 342-356
- Learning by extended statistical queries and its relation to PAC learningEli Shamir, Clara Shwartzman. 357-366
- Typed pattern languages and their learnabilityTakeshi Koshiba. 367-379
- Learning behaviors of automata from shortest counterexamplesFrancesco Bergadano, S. Varrichio. 380-391
- Learning of regular expressions by pattern matchingAlvis Brazma. 392-403
- The query complexity of learning some subclasses of context-free grammarsCarlos Domingo, Víctor Lavín. 404-414