The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- Learnability with respect to fixed distributions (Q809614) (← links)
- Training sequences (Q811136) (← links)
- On learning embedded midbit functions (Q817826) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Safe learning for near-optimal scheduling (Q832074) (← links)
- Interpreted and generated signals (Q840691) (← links)
- Simple games with many effective voters (Q844903) (← links)
- Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data (Q850147) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- A Boolean measure of similarity (Q860381) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Learning invariant features using inertial priors (Q870815) (← links)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited (Q894695) (← links)
- Learning Boolean specifications (Q900315) (← links)
- Learning from hints in neural networks (Q909487) (← links)
- On learning a union of half spaces (Q915490) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Taming teams with mind changes (Q927869) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- An analysis of model-based interval estimation for Markov decision processes (Q959899) (← links)
- Detecting network intrusions using signal processing with query-based sampling filter (Q965345) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- The geometry of quantum learning (Q989901) (← links)
- Partial observability and learnability (Q991012) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation (Q997040) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- A theory of learning with similarity functions (Q1009272) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Using a similarity measure for credible classification (Q1028441) (← links)
- A \(\mathbb R\)eal generalization of discrete AdaBoost (Q1028894) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- Identification of pattern languages from examples and queries (Q1097709) (← links)
- Learning regular sets from queries and counterexamples (Q1098326) (← links)
- Probability and plurality for aggregations of learning machines (Q1104113) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Occam's razor (Q1108056) (← links)
- Paradigms of truth detection (Q1117917) (← links)
- Learning faster than promised by the Vapnik-Chervonenkis dimension (Q1124369) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
