The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- Advanced elementary formal systems. (Q1874228) (← links)
- Decision lists over regular patterns. (Q1874229) (← links)
- Effects of domain characteristics on instance-based learning algorithms. (Q1874236) (← links)
- PAC learning of probability distributions over a discrete domain. (Q1874385) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Construction of all non-reducible descriptors (Q1886683) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Can PAC learning algorithms tolerate random attribute noise? (Q1894713) (← links)
- Testing nonlinear operators (Q1895875) (← links)
- Classification by polynomial surfaces (Q1897355) (← links)
- Autonomous theory building systems (Q1897404) (← links)
- Fusion methods for multiple sensor systems with unknown error densities (Q1898158) (← links)
- A generalization of Sauer's lemma (Q1899068) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Inductive inference in the limit of empirically adequate theories (Q1902559) (← links)
- Execution of simple similarity predicates in the DSM method for automatic generation of hypotheses (Q1905193) (← links)
- Linear codes interpolation from noisy patterns by means of a vector quantization process (Q1905904) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers (Q1913240) (← links)
- Informational properties of neural nets performing algorithmic and logical tasks (Q1916524) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- An incremental learning algorithm for constructing Boolean functions from positive and negative examples (Q1941951) (← links)
- A computational learning theory of active object recognition under uncertainty (Q1943411) (← links)
- An improved lower bound on query complexity for quantum PAC learning (Q1944033) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Learning monotone nonlinear models using the Choquet integral (Q1945134) (← links)
- A comparative analysis of recent identification approaches for discrete-event systems (Q1958833) (← links)
- Learning the set covering machine by bound minimization and margin-sparsity trade-off (Q1959549) (← links)
- A theory of learning from different domains (Q1959571) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- The security of machine learning (Q1959616) (← links)
- Mining probabilistic automata: a statistical view of sequential pattern mining (Q1959646) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Efficient algorithmic learning of the structure of permutation groups by examples (Q1963029) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- Wrapper induction: Efficiency and expressiveness (Q1978784) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- The hardest halfspace (Q1983325) (← links)
- TeLEx: learning signal temporal logic from positive examples using tightness metric (Q2008282) (← links)
- Speculate-correct error bounds for \(k\)-nearest neighbor classifiers (Q2008639) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- (Machine) learning parameter regions (Q2024444) (← links)
