2. EuroCOLT 1995: Barcelona, Spain

@proceedings{DBLP:conf/eurocolt/1995,
  editor    = {Paul M. B. Vit{\'a}nyi},
  title     = {Computational Learning Theory, Second European Conference, EuroCOLT
               '95, Barcelona, Spain, March 13-15, 1995, Proceedings},
  booktitle = {EuroCOLT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {904},
  year      = {1995},
  isbn      = {3-540-59119-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1

• Ray J. Solomonoff: The discovery of algorithmic probability: A guide for the programming of true creativity. 1-22 BibTeX
• Yoav Freund, Robert E. Schapire: A decision-theoretic generalization of on-line learning and an application to boosting. 23-37 BibTeX
• Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online learning versus offline learning. 38-52 BibTeX

Session 2

• Shai Ben-David, Michael Lindenbaum: Learning distributions by their density-levels - a paradigm for learning without a teacher. 53-68 BibTeX
• David Haussler, Jyrki Kivinen, Manfred K. Warmuth: Tight worst-case loss bounds for predicting with expert advice. 69-83 BibTeX
• Kenji Yamanishi: On-line maximum likelihood prediction with respect to general loss functions. 84-98 BibTeX

Session 3

• Andris Ambainis: The power of procrastination in inductive inference: How it depends on used ordinal notations. 99-111 BibTeX
• José L. Balcázar, Harry Buhrman, Montserrat Hermo: Learnability of Kolmogorov-easy circuit expressions via queries. 112-124 BibTeX
• Steffen Lange, Thomas Zeugmann: Trading monotonicity demands versus mind changes. 125-139 BibTeX

Session 4

• John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer: Learning recursive functions from approximations. 140-153 BibTeX
• Rusins Freivalds, Efim B. Kinber, Carl H. Smith: On the intrinsic complexity of learning. 154-168 BibTeX
• Sanjay Jain, Arun Sharma: The structure of intrinsic complexity of learning. 169-181 BibTeX
• Rusins Freivalds, Sanjay Jain: Kolmogorov numberings and minimal identification. 182-195 BibTeX

Session 5

• Jorma Rissanen: Stochastic complexity in learning. 196-210 BibTeX
• Martin Anthony, Peter L. Bartlett: Function learning from interpolation. 211-221 BibTeX
• Leonid Gurvits, Pascal Koiran: Approximation and learning of convex superpositions. 222-236 BibTeX

Session 6

• V. G. Vovk: Minimum description length estimators under the optimal coding scheme. 237-251 BibTeX
• Pekka Kilpeläinen, Heikki Mannila, Esko Ukkonen: MDL learning of unions of simple pattern languages from positive examples. 252-260 BibTeX
• Eric Martin, Daniel N. Osherson: A note on the use of probabilities by mechanical learners. 261-271 BibTeX

Session 7

• Dale Schuurmans: Characterizing rational versus exponential learning curves. 272-286 BibTeX
• Marco Muselli: Is Pocket algorithm optimal? 287-297 BibTeX
• Jan van den Berg, Jan C. Bioch: Some theorems concerning the free energy of (un)constrained stochastic hopfield neural networks. 298-312 BibTeX

Session 8

• Foued Ameur: A space-bounded learning algorithm for axis-parallel rectangles. 313-321 BibTeX
• Hans-Ulrich Simon: Learning decision lists and trees with equivalence-queries. 322-336 BibTeX

Session 9

• Marek Karpinski, Angus Macintyre: Bounding VC-dimension of neural networks: Progress and prospects. 337-341 BibTeX
• Mostefa Golea: Average case analysis of a learning algorithm for µ-DNF expressions. 342-356 BibTeX
• Eli Shamir, Clara Shwartzman: Learning by extended statistical queries and its relation to PAC learning. 357-366 BibTeX

Session 10

• Takeshi Koshiba: Typed pattern languages and their learnability. 367-379 BibTeX
• Francesco Bergadano, S. Varrichio: Learning behaviors of automata from shortest counterexamples. 380-391 BibTeX
• Alvis Brazma: Learning of regular expressions by pattern matching. 392-403 BibTeX
• Carlos Domingo, Víctor Lavín: The query complexity of learning some subclasses of context-free grammars. 404-414 BibTeX