COLT 1994

39 papers

A Statistical Approach to Decision Tree Modeling Michael I. Jordan

An Optimal Parallel Algorithm for Learning DFA José L. Balcázar, Josep Díaz, Ricard Gavaldà, Osamu Watanabe

An Optimal-Control Application of Two Paradigms of On-Line Learning V. G. Vovk

Approximate Methods for Sequential Decision Making Using Expert Advice Thomas H. Chung

Bayesian Inductive Logic Programming Stephen H. Muggleton

CLASSIC Learning Michael Frazier, Leonard Pitt

Co-Learning of Total Recursive Functions Rusins Freivalds, Marek Karpinski, Carl H. Smith

Efficient Agnostic PAC-Learning with Simple Hypothesis Wolfgang Maass

Efficient Learning of Continuous Neural Networks Pascal Koiran

Efficient Reinforcement Learning Claude-Nicolas Fiechter

Exploiting Random Walks for Learning Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen

Fat-Shattering and the Learnability of Real-Valued Functions Peter L. Bartlett, Philip M. Long, Robert C. Williamson

Frequencies vs Biases: Machine Learning Problems in Natural Language Processing (Extended Abstract) Fernando C. N. Pereira

Generalization in Partially Connected Layered Neural Networks Kyung-Hoon Kwon, Kukjin Kang, Jong-Hoon Oh

Geometrical Concept Learning and Convex Polytopes Tibor Hegedüs

Inclusion Problems in Parallel Learning and Games (Extended Abstract) Martin Kummer, Frank Stephan

Inference and Minimization of Hidden Markov Chains David Gillman, Michael Sipser

Learning from a Consistently Ignorant Teacher Michael Frazier, Sally A. Goldman, Nina Mishra, Leonard Pitt

Learning Linear Threshold Functions in the Presence of Classification Noise Tom Bylander

Learning Monotone Log-Term DNF Formulas Yoshifumi Sakai, Akira Maruoka

Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise Paul W. Goldberg, Sally A. Goldman

Learning Probabilistic Automata with Variable Memory Length Dana Ron, Yoram Singer, Naftali Tishby

Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time Andrey Burago

Learning Unions of Boxes with Membership and Equivalence Queries Paul W. Goldberg, Sally A. Goldman, H. David Mathias

Learning with Malicious Membership Queries and Exceptions (Extended Abstract) Dana Angluin, Martins Krikis

Learning with Queries but Incomplete Information (Extended Abstract) Robert H. Sloan, György Turán

Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson

On a Learnability Question Associated to Neural Networks with Continuous Activations (Extended Abstract) Bhaskar DasGupta, Hava T. Siegelmann, Eduardo D. Sontag

On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract) Daoud Bshouty, Nader H. Bshouty

On Learning Counting Functions with Queries Zhixiang Chen, Steven Homer

On Learning Read-K-Satisfy-J DNF Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth

On the Intrinsic Complexity of Language Identification Sanjay Jain, Arun Sharma

On the Limits of Proper Learnability of Subclasses of DNF Formulas Krishnan Pillaipakkamnatt, Vijay Raghavan

Oracles and Queries That Are Sufficient for Exact Learning (Extended Abstract) Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon

Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter

Rigorous Learning Curve Bounds from Statistical Mechanics David Haussler, H. Sebastian Seung, Michael J. Kearns, Naftali Tishby

The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules Kenji Yamanishi

The Representation of Recursive Languages and Its Impact on the Efficiency of Learning Steffen Lange

The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract) Martin Kummer