Computational sample complexity and attribute-efficient learning
From MaRDI portal
Recommendations
- Sample complexity for computational classification problems
- Computing and Combinatorics
- Improved bounds on the sample complexity of learning
- scientific article; zbMATH DE number 1445318
- On the sample complexity of weak learning
- Distribution-dependent sample complexity of large margin learning
- The optimal sample complexity of PAC learning
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Cites work
- A Winnow-based approach to context-sensitive spelling correction
- A general lower bound on the number of examples needed for learning
- A theory of the learnable
- Attribute-efficient learning in query and mistake-bound models
- Cryptographic limitations on learning Boolean formulae and finite automata
- Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
- Efficient distribution-free learning of probabilistic concepts
- Expander codes
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Learning in the presence of finitely or infinitely many irrelevant attributes
- Linear-time encodable and decodable error-correcting codes
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Occam's razor
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Cited in
(7)- A global homogeneity test for high-dimensional linear regression
- On parallel attribute-efficient learning.
- Optimal testing for planted satisfiability problems
- High-dimensional change-point estimation: combining filtering with convex optimization
- Order-revealing encryption and the hardness of private learning
- Computational sample complexity and attribute-efficient learning
- Computational and statistical tradeoffs via convex relaxation
This page was built for publication: Computational sample complexity and attribute-efficient learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918064)
