A theory of the learnable
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sharpening Occam's razor
- Unconditional lower bounds for learning intersections of halfspaces
- A theory of learning with similarity functions
- Random walks for selected Boolean implication and equivalence problems
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
- Separating models of learning with faulty teachers
- Using a similarity measure for credible classification
- A Real generalization of discrete AdaBoost
- Parameterized learnability of juntas
- Instability, complexity, and evolution
- Identification of pattern languages from examples and queries
- Learning regular sets from queries and counterexamples
- Probability and plurality for aggregations of learning machines
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Occam's razor
- Paradigms of truth detection
- Learning faster than promised by the Vapnik-Chervonenkis dimension
- Defaults and relevance in model-based reasoning
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Partial Occam's Razor and its applications
- Schema induction for logic program synthesis
- On convergence proofs in system identification -- a general principle using ideas from learning theory
- Learning regular languages from counterexamples
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank
- Equivalence of models for polynomial learnability
- Learning elementary formal systems
- Efficient learning of context-free grammars from positive structural examples
- Learning in parallel
- Principles of metareasoning
- Inductive reasoning and Kolmogorov complexity
- On the necessity of Occam algorithms
- Nested annealing: A provable improvement to simulated annealing
- Learning convex bodies under uniform distribution
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Structure identification in relational data
- IIPS: A framework for specifying inductive-inference problems
- Bounding sample size with the Vapnik-Chervonenkis dimension
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
- Learning approximately regular languages with reversible languages
- Neural networks as systems for recognizing patterns
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- Optimal mistake bound learning is hard
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance
- Learning with unreliable boundary queries
- Learning with restricted focus of attention
- Double Horn functions
- An introduction to some statistical aspects of PAC learning theory
- Learning dynamical systems in a stationary environment
- A probabilistic framework for memory-based reasoning
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Approximating hyper-rectangles: Learning and pseudorandom sets
- PAC-learning a decision tree with pruning
- Noise-tolerant parallel learning of geometric concepts
- Synthesizers and their application to the parallel construction of pseudo-random functions
- On the boosting ability of top-down decision tree learning algorithms
- On the learnability of rich function classes
- A general frmework for supervised learning. Probably almost Bayesian algorithms
- Combinatorics and connectionism
- A result of Vapnik with applications
- Generating logical expressions from positive and negative examples via a branch-and-bound approach
- Extremes in the degrees of inferability
- Modeling a dynamic environment using a Bayesian multiple hypothesis approach
- Dynamic sizing of multilayer perceptrons
- Efficient distribution-free learning of probabilistic concepts
- Nonuniform learnability
- On the effects of noise and speed on computations
- Three fundamental concepts of the capacity of learning machines
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- A review of combinatorial problems arising in feedforward neural network design
- A linear time equivalence test for read-twice DNF formulas
- The query complexity of learning DFA
- Halfspace learning, linear programming, and nonmalicious distributions
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
- Approximating shortest superstrings with constraints
- First-order \(jk\)-clausal theories are PAC-learnable
- Toward efficient agnostic learning
- The learnability of description logics with equality constraints
- On-line learning of rectangles and unions of rectangles
- Simple learning algorithms using divide and conquer
- Incorporating statistical information into expert classification systems to reduce classification costs
- Learning an intersection of a constant number of halfspaces over a uniform distribution
- A sufficient condition for polynomial distribution-dependent learnability
- Logical analysis of numerical data
- Characterizing rational versus exponential learning curves
- Efficient learning of typical finite automata from random walks
- On the complexity of learning from drifting distributions
- Error-free and best-fit extensions of partially defined Boolean functions
- A graph-theoretic result for a model of neural computation
- On the value of partial information for learning from examples
- Efficient learning with virtual threshold gates
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Improved generalization via tolerant training
- Logical settings for concept-learning
- Approximate testing and its relationship to learning
- Recent advances of grammatical inference
- Probabilistic language learning under monotonicity constraints
- Learning nested differences in the presence of malicious noise
This page was built for publication: A theory of the learnable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714486)
