Titles

A B C D E F G H I J-K L M N O P Q-R S T U V W-Z

	Occam’s Razor - A. Blumer, A. Ehrenfeucht, D. Haussler and M. K. Warmuth - April 1987
	Occam’s razor for functions - B. K. Natarajan - 1993
	On a learnability question associated to neural networks with continuous activations - B. DasGupta, H. T. Siegelmann and E. Sontag - 1994
	On a Question about Learning Nearly Minimal Programs - S. Jain - 1995
	On a Question in Learning Minimal Programs - S. Jain - 1994
	On a Theory of Inductive Inference - E. B. Kinber - 1977
	On Aggregating Teams of Learning Machines - S. Jain and A. Sharma - 1995
	On approximate truth - D. N. Osherson, M. Stob and S. Weinstein - 1989
	On approximately identifying concept classes in the limit - Satoshi Kobayashi and Takashi Yokomori - 1995
	On Barzdin’s Conjecture - T. Zeugmann - 1986
	On Bayes methods for on-line Boolean prediction - Nicolò Cesa-Bianchi, David P. Helmbold and Sandra Panizza - 1996
	On bounded queries and approximation - Richard Chang and William I. Gasarch - 1993
	On Case-Based Representability and Learnability of Languages - C. Globig and S. Lange - 1994
	On Characterizing and Learning Some Classes of Read-once Functions - L. Hellerstein - 1989
	On Comparison of Limit Identification and Limit Standardization of General Recursive Functions - E. B. Kinber - 1975
	On convergence to the truth and nothing but the truth - K. Kelly and C. Glymour - 1987
	On decoding automata in the absence of an upper bound on the number of states - J. M. Barzdin - 1970
	On efficient agnostic learning of linear combinations of basis functions - Wee Sun Lee, Peter L. Bartlett and Robert C. Williamson - 1995
	On Evidential Reasoning In A Hierarchy Of Hypothesis - J. Pearl - September 1985
	On exact specification by examples - M. Anthony, G. Brightwell, D. Cohen and J. Shawe-Taylor - 1992
	On Extensional Learnability - K. Wexler - 1982
	On fast and simple algorithms for finding maximal subarrays and applications in learning theory - Andreas Birkendorf - 1997
	On genetic algorithms - Eric B. Baum, Dan Boneh and Charles Garrett - 1995
	On handling tree-structured attributes in decision tree learning - Hussein Almuallim, Yasuhiro Akiba and Shigeo Kaneda - 1995
	On Language and Connectionism: Analysis of a Parallel Distributed Processing Model of Language Acquisition - S. Pinker and A. Prince - 1987
	On Learning a Union of Half Spaces - E. B. Baum - March 1990
	On learning arithmetic read-once formulas with exponentiation - D. Bshouty and N. H. Bshouty - 1994
	On learning binary weights for majority functions - S. S. Venkatesh - 1991
	On learning Boolean functions - B. K. Natarajan - 1987
	On learning bounded-width branching programs - Funda Ergün, Ravi S. Kumar and Ronitt Rubinfeld - 1995
	On learning branching programs and small depth circuits - Francesco Bergadano, Nader H. Bshouty, Christino Tamon and Stefano Varricchio - 1997
	On learning counting fuctions with queries - Z. Chen and S. Homer - 1994
	On learning decision committees - Richard Nock and Olivier Gascuel - 1995
	On learning decision trees with large output domains - Nader H. Bshouty, Christino Tamon and David K. Wilson - 1995
	On learning discretized geometric concepts - N. Bshouty - 1994
	On learning discretized geometric concepts - Nader H. Bshouty, Zhixiang Chen and Steve Homer - 1994
	On learning embedded symmetric concepts - A. Blum, P. Chalasani and J. Jackson - 1993
	On learning from exercises - B. K. Natarajan - 1989
	On learning from multi-instance examples: Empirical evaluation of a theoretical approach - Peter Auer - 1997
	On learning from noisy and incomplete examples - Scott E. Decatur and Rosario Gennaro - 1995
	On Learning from Queries and Counterexamples in the Presence of Noise - Y. Sakakibara - March 1991
	On learning in the limit and non-uniform , - learning - S. Ben-David and M. Jacovi - 1993
	On Learning Limiting Programs - J. Case, S. Jain and A. Sharma - 1992
	On learning multiple concepts in parallel - Efim Kinber, Carl H. Smith, Mahendran Velauthapillai and Rolf Wiehagen - 1995
	On learning noisy theshold functions with finite precision weights - R. Meir and J. F. Fontanari - 1992
	On learning read-k-satisfy-j DNF - A. Blum, R. Khardon, E. Kushilevitz, L. Pitt and D. Roth - 1994
	On learning ring-sum expansions - P. Fischer and H. Simon - 1992
	On Learning Sets and Functions - B. K. Natarajan - 1989
	On Learning Simple Deterministic and Probabilistic Neural Concepts - M. Golea and M. Marchand - 1994
	On learning systolic languages - T. Yokomori - 1992
	On Learning Visual Concepts and DNF Formulae - Eyal Kushilevitz and Dan Roth - 1996
	On learning width two branching programs - Nader H. Bshouty, Christino Tamon and David K. Wilson - 1996
	On Limit Identification of Minimal Gödel Numbers for Functions from Enumerable Classes - E. B. Kinber - 1977
	On Machine Inductive Inference of approximations - J. Royer - 1985
	On Machine Learning - Pat Langley - 1986
	On Metric Entripy, Vapnik-Chervonenkis Dimension, and Learnability for a Class of Distributions - S. Kulkarni - 1989
	On monotonic strategies for learning r.e.\ languages - S. Jain and A. Sharma - October 1994
	On PAC learnability of functional dependencies - T. Akutsu and A. Takasu - 1992
	On polynomial-time learnability in the limit of strictly deterministic automata - Takashi Yokomori - 1995
	On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata - Yokomori Takashi - 1995
	On polynomial-time probably almost discriminative learnability - K. Yamanishi - 1993
	On probably correct classification of concepts - S. Kulkarni and O. Zeitouni - 1993
	On Pruning and averaging decision trees - Jonathan J. Oliver and David J. Hand - 1995
	On Rationality and Learning - J. Doyle - 1988
	On restricted-focus-of-attention learnability of Boolean functions - Andreas Birkendorf, Eli Dichterman, Jeffrey Jackson, Norbert Klasner and Hans Ulrich Simon - 1996
	On self-directed learning - Shai Ben-David, Nadav Eiron and Eyal Kushilevitz - 1995
	On synthesizing programs given by examples - J. M. Barzdin - 1974
	On the Application of Vector Quantization and Hidden Markov Models to Speaker-Independent, Isolated Word Recognition - L. R. Rabiner, S. E. Levinson and M. M. Sondhi - April 1983
	On the average tractability of binary integer programming and the curious transition to perfect generalization in learning majority functions - S. Fang and S. Venkatesh - 1993
	On the Complexity and Optimality of Computation in the Limit - R. Freivalds - 1974
	On the Complexity of Effective Program Synthesis - R. Wiehagen - 1986
	On the Complexity of Function Learning - Peter Auer et al. - 1995
	On the complexity of function learning - Peter Auer, Philip M. Long, Wolfgang Maass and Gerhard J. Woeginger - 1995
	On the Complexity of Inductive Inference - R. Daley and C. Smith - 1986
	On the Complexity of Learning for a Spiking Neuron - Wolfgang Maass and Michael Schmitt - 1997
	On the complexity of learning from counterexamples - W. Maass and G. Turán - 1989
	On the complexity of learning from counterexamples and membership queries - W. Maass and G. Turán - 1990
	On the complexity of learning from drifting distributions - Rakesh D. Barve and Philip M. Long - 1996
	On the complexity of learning minimum time-bounded Turing machines - K. Ko - 1990
	On the Complexity of Learning on Neural Nets - W. Maass - 1994
	On the complexity of learning strings and sequences - T. Jiang and M. Li - 1993
	On the Complexity of Minimum Inference of Regular Sets - D. Angluin - 1978
	On the Complexity of Program Synthesis from Examples - R. Wiehagen - 1986
	On the complexity of teaching - Sally A. Goldman and Michael J. Kearns - 1995
	On the Computational Complexity of Approximating Distributions by Probabilistic Automata - Naoki Abe and Manfred K. Warmuth - 1992
	On the Computational Complexity of Training Simple Neural Networks - A. Blum - May 1989
	On the computational power of neural nets - Hava T. Siegelmann and Eduardo D. Sontag - 1995
	On the computational power of sigmoid versus Boolean threshold circuits - W. Maass, G. Schnitger and E. D. Sontag - 1991
	On the Connection Between the Complexity and Credibility of Inferred Models - J. Pearl - 1978
	On the decomposition of polychotomies into dichotomies - Eddy Mayoraz and Miguel Moreira - 1997
	On the Design of Networks with Hidden Variables - R. Dechter - July 1990
	On the duality between mechanistic learners and what it is they learn - R. Freivalds and C. H. Smith - 1993
	On the error correcting power of pluralism in BC-type inductive inference - R. Daley - 1983
	On the error probabilty of boolean concept descriptions - F. Bergadano and L. Saitta - 1989
	On the exact learning of formulas in parallel - N. H. Bshouty and R. Cleve - 1992
	On the Fourier spectrum of monotone functions - Nader Bshouty and Christino Tamon - 1995
	On the Handling of Continuous-Valued Attributes in Decision Tree Generation - Usama M. Fayyad and Keki B. Irani - 1992
	On the Hidden Markov Model and Dynamic Time Warping for Speech Recognition - A Unified View - B. Juang - September 1985
	On the Impact of Forgetting on Learning Machines - R. Freivalds, E. Kinber and C. Smith - 1995
	On the Impact of Order Independence to the Learnability of Recursive Languages - S. Lange and T. Zeugmann - 1993
	On the Inductive Inference of Programs with Anomalies - M. Velauthapillai - 1986
	On the inductive inference of real valued functions - Kalvis Apsītis, Rīsiņš Freivalds and Carl H. Smith - 1995
	On the inference of approximate programs - Carl Smith and Mahendra Velauthapillai - 1990
	On the inference of optimal descriptions - R. Daley - 1977
	On the Inference of Programs Approximately Computing the Desired Function - C. Smith and M. Velauthapillai - 1986
	On The Inference of Sequences of Functions - W. Gasarch and C. Smith - 1986
	On the inference of stochastic regular grammars - A. Van der Mude and A. Walker - 1978
	On the inference of Turing machines from sample computations - A. W. Biermann - 1972
	On the intrinsic complexity of language identification - S. Jain and A. Sharma - 1994
	On the Intrinsic Complexity of Learning - R. Freivalds, E. Kinber and C. Smith - 1996
	On the learnability and usage of acyclic probabilistic finite automata - Dana Ron, Yoram Singer and Naftali Tishby - 1995
	On the learnability of Boolean formulae - M. Kearns, M. Li, L. Pitt and L. Valiant - 1987
	On the learnability of discrete distributions - M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire and L. Sellie - 1994
	On The Learnability Of Disjunctive Normal Form Formulas - Howard Aizenstein and Leonard Pitt - 1995
	On the Learnability of Disjunctive Normal Form Formulas and Decision Trees. - H. Aizenstein - 1993
	On the Learnability of DNF Formulae - L. Kucera, A. Marchetti-Spaccamela and M. Protasi - July 1988
	On the learnability of finite automata - M. Li and U. Vazirani - 1988
	On the learnability of infinitary regular sets - O. Maler and A. Pneuli - 1991
	On the learnability of the uncomputable - Richard H. Lathrop - 1996
	On the learnability of Z_N-DNF formulas - Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur and Steven Homer - 1995
	On the limit synthesis of numbers of general recursive functions in various computable numerations - R. V. Freivalds - 1974
	On the limits of proper learnability of subclasses of DNF formulas - K. Pillaipakkamnatt and V. Raghavan - 1994
	On the Limits of Proper Learnability of Subclasses of DNF Formulas - Pillaipakkamnatt Krishnan and Raghavan Vijay - 1996
	On the Logic of Representing Dependencies by Graphs - J. Pearl and A. Paz - May 1986
	On the Necessity of Occam Algorithms - R. Board and L. Pitt - 1992
	On the necessity of Occam algorithms - L. Pitt and R. Board - 1990
	On the Nonboundability of total effective operators - T. Zeugmann - 1984
	On the non-existence of maximal inference degrees for language identification - S. Jain and A. Sharma - 1993
	On the number of examples and stages needed for learning decision trees - H. U. Simon - 1990
	On the optimal capacity of binary neural networks: rigorous combinatorial approaches - Jeong Han Kim and James R. Roche - 1995
	On the Power of Equivalence Queries - R. Gavaldà - 1994
	On the Power of Monotonic Language Learning - S. Lange and T. Zeugmann - 1992
	On the power of polynomial discriminators and radial basis function networks - M. Anthony and S. Holden - 1993
	On the Power of Probabilistic Strategies in Inductive Inference - R. Wiehagen, R. Freivalds and E. B. Kinber - 1984
	On the Power of Recursive Optimizers - T. Zeugmann - 1988
	On the power of sigmoid neural networks - J. Kilian and H. Siegelmann - 1993
	On the prediction of general recursive functions - J. M. Barzdin and R. V. Frievald - 1972
	On the Principle Capabilities of Probabilistic Algorithms in Inductive Inference - R. Freivalds - 1979
	On the Problem of Local Minima in Backpropagation - Marco Gori and Alberto Tesi - 1992
	On the query complexity of learning - S. Kannan - 1993
	On the role of equivalence quries in MAT learning - S. Tani - 1992
	On the Role of Interpretive Analogy in Learning - B. Indurkhya - 1991
	On the role of procrastination for machine learning - R. Freivalds and C. H. Smith - 1993
	On the role of search for learning - S. A. Kurtz and C. H. Smith - 1989
	On the sample complexity of finding good search strategies - P. Orponen and R. Greiner - 1990
	On the sample complexity of PAC-learning using random and chosen examples - B. B. Eisenberg - 1992
	On the sample complexity of weak learning - S. A. Goldman, M. J. Kearns and R. E. Schapire - 1990
	On the sample complextity of PAC-learning using random and chosen examples - B. Eisenberg and R. L. Rivest - 1990
	On the structure of the Degrees of Inferability - Martin Kummer and Frank Stephan - 1996
	On the Study of First Language Acquisition - D. Osherson and S. Weinstein - 1992
	On the Sufficiency of Surface Data for the Learning of Transformational Languages - K. Wexler and H. Hamburger - 1973
	On the synthesis in the limit of almost minimal Gödel numbers - E. B. Kinber - 1974
	On the Synthesis of Fastest Programs in Inductive Inference - T. Zeugmann - 1983
	On the Synthesis of Finite-State Machines from Samples of Their Behavior - A. W. Biermann and J. Feldman - 1972
	On the uniform convergence of relative frequencies of events to their probabilities - V. N. Vapnik and A. Y. Chervonenkis - 1971
	On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions - A. Sakurai - 1993
	On the Worst-Case Analysis of Temporal-Difference Learning Algorithms - Robert E. Schapire and Manfred K. Warmuth - 1996
	On threshold circuits for parity - R. Paturi and M. E. Saks - 1990
	On Training Simple Neural Networks and Small-weight Neurons - T. Hegedüs - 1994
	On Using the Fourier transform to learn disjoint DNF - R. Khardon - March 1994
	On Weak Learning - D. Helmbold and M. K. Warmuth - June 1995
	One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification - E. B. Kinber and T. Zeugmann - 1991
	On-line adaptation of a signal predistorter through dual reinforcement learning - Patrick Goetz, Shailesh Kumar and Risto Miikkulainen - 1996
	An on-line algorithm for improving performance in navigation. - A. Blum and P. Chalasani - 1993
	On-line evaluation and prediction using linear functions - Philip M. Long - 1997
	On-line Learning and the Metrical Task System Problem - Avrim Blum and Carl Burch - 1997
	On-line learning from search failures - Neeraj Bhatnagar and Jack Mostow - 1994
	On-line learning of binary and n-ary relations over multi-dimensional clusters - Atsuyoshi Nakamura and Naoki Abe - 1995
	On-line learning of binary lexical relations using two-dimensional weighted majority algorithms - Naoki Abe, Hang Li and Atsuyoshi Nakamura - 1995
	On-line learning of functions of bounded variation under various sampling schemes - S. E. Posner and S. R. Kulkarni - 1993
	On-line learning of linear functions - N. Littlestone, P. M. Long and M. K. Warmuth - 1995
	On-line learning of rectangles - Z. Chen and W. Maass - 1992
	On-line learning of rectangles and unions of rectangles - Zhixiang Chen and Wolfgang Maass - 1994
	On-line learning of rectangles in noisy environments - P. Auer - 1993
	Online learning versus offline learning - Shai Ben-David, Eyal Kushilevitz and Yishay Mansour - 1995
	Online learning via congregational gradient descent - Kim L. Blackmore, Robert C. Williamson, Iven M. Y. Mareels and William A. Sethares - 1995
	On-line learning with an oblivious environment and the power of randomization - W. Maass - 1991
	On-line learning with linear loss constraints - N. Littlestone and P. Long - 1993
	On-line learning with malicious noise and the closure algorithm - P. Auer and N. Cesa-Bianchi - 1994
	On-line maximum likelihood prediction with respect to general loss functions - Kenji Yamanishi - 1995
	On-line portfolio selection - Erik Ordentlich and Thomas Cover - 1996
	On-line portfolio selection using multiplicative updates - David P. Helmbold, Robert E. Schapire, Yoram Singer and Manfred K. Warmuth - 1996
	On-line Prediction and Conversion Strategies - Nicolo Cesa-Bianchi, Yoav Freund, David P. Helmbold and Manfred K. Warmuth - 1996
	Open problems in Systems that learn - Mark Fulk, Sanjay Jain and Daniel N. Osherson - 1994
	Opportunism and Learning - Kristian Hammond et al. - 1993
	Optimal attribute-efficient learning of disjunction, parity, and threshold functions - Ryuhei Uehara, Kensei Tsuchida and Ingo Wegener - 1997
	Optimal layered learning: a PAC approach to incremental sampling - S. Muggleton - 1993
	An optimal parallel algorithm for learning DFA - J. L. Balcázar, J. Díaz, R. Gavaldà and O. Watanabe - 1994
	Optimal Sequential Probability Assignment for Individual Sequences - M. J. Weinberger, N. Merhav and M. Feder - March 1994
	Optimal unsupervised learning in a single-layer linear feedforward neural network - T. D. Sanger - 1989
	An optimal-control application of two paradigms of on-line learning - V. G. Vovk - 1994
	Optimally Parsing a Sequence into Different Classes Based on Multiple Types of Information - G. D. Stormo and D. Haussler - August 1994
	Option decision trees with majority votes - Ron Kohavi and Clayton Kunz - 1997
	Oracles and queries that are sufficient for exact learning - N. H. Bshouty, R. Cleve, S. Kannan and C. Tamon - 1994
	Ordinal mind change complexity of language identification - Andris Ambainis, Sanjay Jain and Arun Sharma - 1997
	Overfitting Avoidance as Bias - Cullen Schaffer - 1993