Testing problems with sublearning sample complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4018089 (Why is no real title available?)
- scientific article; zbMATH DE number 1306876 (Why is no real title available?)
- scientific article; zbMATH DE number 1559556 (Why is no real title available?)
- scientific article; zbMATH DE number 1775414 (Why is no real title available?)
- Learning Boolean formulas
- Probabilistic encryption
- Probably almost discriminative learning
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
Cited in
(20)- Testing piecewise functions
- Erasure-Resilient Property Testing
- Testing k-monotonicity
- Testing by implicit learning: a brief survey
- Sample-based high-dimensional convexity testing
- Flipping out with many flips: hardness of testing \(k\)-monotonicity
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing
- Estimating perimeter using graph cuts
- A characterization of constant-sample testable properties
- Flipping out with many flips: hardness of testing \(k\)-monotonicity
- On active and passive testing
- Learning \(k\)-modal distributions via testing
- On approximating the number of relevant variables in a function
- Gaining degrees of freedom in subsymbolic learning
- Discrimination of quantum states under locality constraints in the many-copy setting
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality
- Nearly optimal bounds for sample-based testing and learning of k-monotone functions
- Interactive proofs for verifying machine learning
- Testing computability by width-two OBDDs
- Testing whether a digraph contains H-free k-induced subgraphs
This page was built for publication: Testing problems with sublearning sample complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929914)
