Pages that link to "Item:Q1823011"
From MaRDI portal
The following pages link to A general lower bound on the number of examples needed for learning (Q1823011):
Displaying 50 items.
- On universal learning algorithms (Q287154) (← links)
- Supervised learning and co-training (Q391741) (← links)
- Rigorous learning curve bounds from statistical mechanics (Q676243) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- On the necessity of Occam algorithms (Q1193631) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- A general frmework for supervised learning. Probably almost Bayesian algorithms (Q1309836) (← links)
- Nonuniform learnability (Q1329161) (← links)
- Learning Boolean concepts in the presence of many irrelevant features (Q1337683) (← links)
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions (Q1338785) (← links)
- Learning distributions by their density levels: A paradigm for learning without a teacher (Q1370866) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- PAC learning of concept classes through the boundaries of their items (Q1392018) (← links)
- Queries revisited. (Q1426146) (← links)
- Convexity and logical analysis of data (Q1575707) (← links)
- A computational study on the performance of artificial neural networks under changing structural design and data distribution (Q1600897) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- Bandwidth choice for nonparametric classification (Q1781162) (← links)
- Testing piecewise functions (Q1786590) (← links)
- Exact VC-dimension of Boolean monomials (Q1847362) (← links)
- Improved lower bounds for learning from noisy examples: An information-theoretic approach (Q1854425) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Classification by polynomial surfaces (Q1897355) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← 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)
- An inequality for uniform deviations of sample averages from their means (Q1962162) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- (Machine) learning parameter regions (Q2024444) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- Optimality of SVM: novel proofs and tighter bounds (Q2333789) (← links)
- Discriminative learning can succeed where generative learning fails (Q2379956) (← links)
- A new PAC bound for intersection-closed concept classes (Q2384136) (← links)
