The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
- Approximation by superpositions of a sigmoidal function (Q5916442) (← links)
- Pac-learning non-recursive Prolog clauses (Q5917441) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Robust logics (Q5918074) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Improved learning of \(k\)-parities (Q5918966) (← links)
- Single-class classification with mapping convergence (Q5920545) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Learning a circuit by injecting values (Q5920703) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
- Pac-learning non-recursive Prolog clauses (Q5925569) (← links)
- Explanatory and creative alternatives to the MDL principle (Q5938216) (← links)
- Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures. (Q5940777) (← links)
- Gaining degrees of freedom in subsymbolic learning (Q5941074) (← links)
- Learning logic programs with structured background knowledge (Q5941133) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries (Q5941371) (← links)
- Probabilistic inductive inference: A survey (Q5941566) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Improved bounds on the sample complexity of learning (Q5943102) (← links)
- Agnostic learning of geometric patterns (Q5943123) (← links)
- Recommendation systems: A probabilistic analysis (Q5952451) (← links)
- Towards intelligent image retrieval (Q5952751) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)
- Aspects of complexity of probabilistic learning under monotonicity constraints (Q5958648) (← links)
- Complexity of learning in artificial neural networks (Q5958811) (← links)
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples (Q5964066) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- Framework for learning and control in the classical and quantum domains (Q6065699) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
- Almost Optimal Testers for Concise Representations. (Q6084348) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)
- Is there a role for statistics in artificial intelligence? (Q6103792) (← links)
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu (Q6110527) (← links)
- How to describe the spatial near-far relations among concepts? (Q6114034) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
- Adversarial manifold estimation (Q6118078) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data (Q6141043) (← links)
- Richness fallacy (Q6167028) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)
- A survey of learning criteria going beyond the usual risk (Q6535427) (← links)
- \(L^*\)-based learning of Markov decision processes (Q6535974) (← links)
- Constraint learning: an appetizer (Q6535988) (← links)
- Short Boolean formulas as explanations in practice (Q6545522) (← links)
- Robust identification in the limit from incomplete positive data (Q6546598) (← links)
