Pages that link to "Item:Q3813320"
From MaRDI portal
The following pages link to Computational limitations on learning from examples (Q3813320):
Displaying 50 items.
- PACS, simple-PAC and query learning (Q294709) (← links)
- GAMoN: discovering \(M\)-of-\(N^{\{\neg, \lor\}}\) hypotheses for text classification by a lattice-based genetic algorithm (Q359980) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Teachability in computational learning (Q749233) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Learnability with respect to fixed distributions (Q809614) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- Partial observability and learnability (Q991012) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- Occam's razor (Q1108056) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- On the necessity of Occam algorithms (Q1193631) (← links)
- Bounding sample size with the Vapnik-Chervonenkis dimension (Q1209149) (← links)
- Double Horn functions (Q1271644) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- Generating logical expressions from positive and negative examples via a branch-and-bound approach (Q1318514) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions (Q1338785) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- The learnability of description logics with equality constraints (Q1342732) (← links)
- On-line learning of rectangles and unions of rectangles (Q1342733) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Logical settings for concept-learning (Q1389603) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron (Q1595743) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- Learning decision trees from random examples (Q1823009) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Hardness of indentifying the minimum ordered binary decision diagram (Q1841888) (← links)
- Proper learning algorithm for functions of \(k\) terms under smooth distributions. (Q1854298) (← links)
- Effects of domain characteristics on instance-based learning algorithms. (Q1874236) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
