Testing distributional assumptions of learning algorithms
From MaRDI portal
Cites work
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- A geometric inequality and the complexity of computing volume
- Agnostic learning of disjunctions on symmetric distributions
- Agnostically Learning Halfspaces
- Almost \(k\)-wise independence versus \(k\)-wise independence
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
- An invariance principle for polytopes
- Approximate resilience, monotonicity, and the complexity of agnostic learning
- Approximation theory and approximation practice
- Bounded Independence Fools Halfspaces
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
- Collision-based Testers are Optimal for Uniformity and Closeness
- Complexity theoretic limitations on learning halfspaces
- Computing the volume is difficult
- Constant depth circuits, Fourier transform, and learnability
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Hardness of learning halfspaces with noise
- scientific article; zbMATH DE number 432830 (Why is no real title available?)
- scientific article; zbMATH DE number 5485485 (Why is no real title available?)
- scientific article; zbMATH DE number 1263197 (Why is no real title available?)
- Learning and lower bounds for AC\(^{0}\) with threshold gates
- Learning circuits with few negations
- Learning Halfspaces with Malicious Noise
- Learning intersections and thresholds of halfspaces
- Learning Monotone Decision Trees in Polynomial Time
- Lower bounds on learning decision lists and trees
- On agnostic learning of parities, monomials, and halfspaces
- On testing expansion in bounded-degree graphs
- Optimal hypothesis testing for high dimensional covariance matrices
- Polynomial regression under arbitrary product distributions
- Sample-optimal identity testing with high probability
- Sublinear time algorithms for earth mover's distance
- Submodular functions are noise stable
- Testing k-monotonicity
- Testing closeness of discrete distributions
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
- Topics and Techniques in Distribution Testing: A Biased but Representative Sample
- Toward efficient agnostic learning
Cited in
(3)
This page was built for publication: Testing distributional assumptions of learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499329)
