상세정보

This volume presents the proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95), held in Barcelona, Spain in March 1995.
The book contains full versions of the 28 papers accepted for presentation at the conference as well as three invited papers. All relevant topics in fundamental studies of computational aspects of artificial and natural learning systems and machine learning are covered; in particular artificial and biological neural networks, genetic and evolutionary algorithms, robotics, pattern recognition, inductive logic programming, decision theory, Bayesian/MDL estimation, statistical physics, and cryptography are addressed.

정보제공 :

CONTENTS
Editor's Foreword / P.M.B. Vitanyi = xi
SESSION 1
Chair : Paul Vitanyi
  The discovery of algorithmic probability : A guide for the programming of true creativity (Invited Lecture) / R. J. Solomonoff = 1
  A decision-theoretic generalization of on-line learning and an application to boosting / Y. freund ; R.E. Schapire = 23
  Online learning versus offline learning / S. Ben-David ; E. Kushilevitz ; Y. Mansour = 38
SESSION 2
Chair : Nicola Cesa-Bianchi
  Learning distributions by their density levels - a paradigm for learning without a teacher / S. Ben-David ; M. Lindenbaum = 53
  Tight worst-case loss bounds for predicting with expert advice / D. Haussler ; J. Kivinen ; M. K. Warmuth = 69
  On-line Maximum likelihood prediction with respect to general loss functions / K. Yamanishi = 84
SESSION 3
Chair : Rusins Freivalds
  The power of procrastination in inductive inference : How it depends on used ordinal notations / A. Ambainis = 99
  Learnability of Kolmogorov-easy circuit expressions via queries / J. L. Balcazar ; H. Buhrman ; M. Hermo = 112
  Trading monotonicity demands versus mind changes / S. Lange ; T. Zeugmann = 125
SESSION 4
Chair : Ricard Gavald ?gravea 
  Learning recursive functions from approximations / J. Case ; S. Kaufmann ; E. Kinber ; M. Kummer = 140
  On the intrinsic complexity of learning / R. Freivalds ; E. Kinber ; C.H. Smith = 154
  The structure of intrinsic complexity of learning / S. Jain ; A. Sharma = 169
  Kolmogorov numberings and minimal identification / R. Freivalds ; S. Jain = 182
SESSION 5
Chair: Ming Li
  Stochastic complexity in learning(Invited Lecture) / J. Rissanen = 196
  Function Learning from interpolation / M. Anthony ; P. Bartlett = 211
  Approximation and learning of convex superpositions / L. Gurvits ; P. Koiran = 222
SESSION 6
Chair : Jorma Rissanen
  Minimum description length estimators under the optimal coding scheme / V.G. Vouk = 237
  MDL learning of unions of simple pattern languages from positive examples / P. Kilpel ?acutea inen ; H. Mannila ; E. Ukkonen = 252
  A note on the use of probabilities by mechanical learners / E. Martin ; D. Osherson = 261
SESSION 7
Chair : Hans-Ulrich Simon
  Characterizing rational versus exponential learning cuves / D. Schuurmans = 272
  Is Pocket algorithm optimal? / M. Muselli = 287
  Some theorems concerning the free energy of (un)constrained stochastic hopfield neural networks / J. van den Berg, J.C. Bioch = 298
SESSION 8
Chair : Wolfgang Maass
  A space-bounded learning algorithm for axis-parallel rectangles / F. Ameur = 313
  Learning decision lists and trees with equivalence-queries / H.U. Simon = 322
SESSION 9
Chair : Kenji Yamanishi
  Bounding VC-dimension of neural networks : Progress and prospects (Invited Lecture) / M. Karpinski ; A. Macintyre = 337
  Average case analysis of a learning algorithm for μ-DNF expressions / M. Golea = 342
  Learning by extended statistical queries and its relation to PAC learning / E. Shamir ; C. Shwartzman = 357
SESSION 10
Chair : Martin Anthony
  Typed pattern languages and their learnability / T. Koshiba = 367
  Learning behaviors of automata from shortest counterexamples / f. Bergadano ; S. Varricchio = 380
  Learning of regular expressions by pattern matching / A. Brazma = 392
  the query complexity of learning some subclasses of context-free grammars / C. Domingo ; V. Lavin = 404
Author Index = 415