COLT A*

37 papers

YearTitle / Authors
1990A Learning Criterion for Stochastic Rules.
Kenji Yamanishi
1990A Mechanical Method of Successful Scientific Inquiry.
Daniel N. Osherson, Michael Stob, Scott Weinstein
1990Aggregating Strategies.
V. G. Vovk
1990Boosting a Weak Learning Algorithm by Majority.
Yoav Freund
1990Composite Geometric Concepts and Polynomial Predictability.
Philip M. Long, Manfred K. Warmuth
1990Efficient Distribution-Free Learning of Probabilistic Concepts (Abstract).
Michael J. Kearns, Robert E. Schapire
1990Exact Identification of Circuits Using Fixed Points of Amplification Functions (Abstract).
Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
1990Finite Learning by a "Team".
Sanjay Jain, Arun Sharma
1990Identifying µ-Formula Decision Trees with Queries.
Thomas R. Hancock
1990Inductive Identification of Pattern Languages Restricted Substitutions.
Keith Wright
1990Inductive Inference from Positive Data is Powerful.
Takeshi Shinohara
1990Inductive Inference of Minimal Programs.
Rusins Freivalds
1990Inferring Graphs from Walks.
Javed A. Aslam, Ronald L. Rivest
1990Learning Conjunctions of Horn Clauses (Abstract).
Dana Angluin, Michael Frazier, Leonard Pitt
1990Learning DNF Under the Uniform Distribution in Quasi-Polynomial Time.
Karsten A. Verbeurgt
1990Learning Functions of
Avrim Blum, Mona Singh
1990Learning Integer Lattices.
David P. Helmbold, Robert Sloan, Manfred K. Warmuth
1990Learning Switch Configurations.
Vijay Raghavan, Stephen R. Schach
1990Learning Via Queries With Teams and Anomilies.
Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith
1990Learning Via Queries in [+, <].
William I. Gasarch, Mark G. Pleszkoch, Robert Solovay
1990Learning by Distances.
Shai Ben-David, Alon Itai, Eyal Kushilevitz
1990On Learning Ring-Sum-Expansions.
Paul Fischer, Hans Ulrich Simon
1990On Threshold Circuits for Parity (Abstract).
Ramamohan Paturi, Michael E. Saks
1990On the Complexity of Learning Minimum Time-Bounded Turing Machines.
Ker-I Ko
1990On the Complexity of Learning from Counterexamples and Membership Queries (abstract).
Wolfgang Maass, György Turán
1990On the Computational Complexity of Approximating Distributions by Probabilistic Automata.
Naoki Abe, Manfred K. Warmuth
1990On the Number of Examples and Stages Needed for Learning Decision Trees.
Hans Ulrich Simon
1990On the Sample Complexity of Finding Good Search Strategies.
Pekka Orponen, Russell Greiner
1990On the Sample Complexity of PAC-Learning Using Random and Chosen Examples.
Bonnie Eisenberg, Ronald L. Rivest
1990On the Sample Complexity of Weak Learning.
Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
1990Pattern Languages are not Learnable.
Robert E. Schapire
1990Polynomial Time Algorithms for Learning Neural Nets.
Eric B. Baum
1990Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 1990.
Mark A. Fulk, John Case
1990Robust Separations in Inductive Inference (Abstract).
Mark A. Fulk
1990Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract).
Avrim Blum
1990Some Problems of Learning with an Oracle.
Efim B. Kinber
1990The Learnability of Formal Concepts.
Martin Anthony, Norman Biggs, John Shawe-Taylor