COLT A*

36 papers

YearTitle / Authors
1991A Geometric Approach to Threshold Circuit Complexity.
Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath
1991A Loss Bound Model for On-Line Stochastic Prediction Strategies.
Kenji Yamanishi
1991Approximation and Estimation Bounds for Artificial Neural Networks.
Andrew R. Barron
1991Bounded Degree Graph Inference from Walks.
Vijay Raghavan
1991Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension.
David Haussler, Michael J. Kearns, Robert E. Schapire
1991Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise.
Manfred Opper, David Haussler
1991Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error.
Andrew B. Nobel
1991Fast Identification of Geometric Objects with Membership Queries.
William J. Bultman, Wolfgang Maass
1991Improved Learning of AC
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smith
1991Investigating the Distribution Assumptions in the Pac Learning Model.
Peter L. Bartlett, Robert C. Williamson
1991Learning 2µ DNF Formulas and
Thomas R. Hancock
1991Learning Curves in Large Neural Networks.
H. Sebastian Seung, Haim Sompolinsky, Naftali Tishby
1991Learning Monotone
Thomas R. Hancock, Yishay Mansour
1991Learning Monotone DNF with an Incomplete Membership Oracle.
Dana Angluin, Donna K. Slonim
1991Learning Probabilistic Read-Once Formulas on Product Distributions.
Robert E. Schapire
1991Learning Read-Once Formulas over Fields and Extended Bases.
Thomas R. Hancock, Lisa Hellerstein
1991Learning and Generalization.(Abstract).
Thomas M. Cover
1991Learning by Smoothing: A Morphological Approach.
Woonkyung Michael Kim
1991Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes.
Avrim Blum, Lisa Hellerstein, Nick Littlestone
1991On Learning Binary Weights for Majority Functions.
Santosh S. Venkatesh
1991On the Complexity of Learning Strings and Sequences.
Tao Jiang, Ming Li
1991On the Complexity of Teaching.
Sally A. Goldman, Michael J. Kearns
1991On the Learnability of Infinitary Regular Sets.
Oded Maler, Amir Pnueli
1991On-Line Learning with an Oblivious Environment and the Power of Randomization.
Wolfgang Maass
1991Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence.
Naoki Abe, Manfred K. Warmuth, Jun'ichi Takeuchi
1991Polynomial-Time Learning of Very Simple Grammars from Positive Data.
Takashi Yokomori
1991Probably Almost Bayes Decisions.
Paul Fischer, Stefan Pölt, Hans Ulrich Simon
1991Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, August 5-7, 1991
Manfred K. Warmuth, Leslie G. Valiant
1991Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow.
Nick Littlestone
1991Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract).
Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will
1991Simultaneous Learning of Concepts and Simultaneous Estimation of Probabilities.
Kevin Buescher, P. R. Kumar
1991The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions.
Tatsuya Motoki, Takeshi Shinohara, Keith Wright
1991The Role of Learning in Autonomous Robots.
Rodney A. Brooks
1991The VC-Dimension vs. the Statistical Capacity for Two Layer Networks with Binary Weights.
Chuanyi Ji, Demetri Psaltis
1991Tracking Drifting Concepts Using Random Examples.
David P. Helmbold, Philip M. Long
1991When Oracles Do Not Help.
Theodore A. Slaman, Robert Solovay