Lifting uniform learners via distributional decomposition
From MaRDI portal
Publication:6499339
Cites work
- scientific article; zbMATH DE number 5485546 (Why is no real title available?)
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- scientific article; zbMATH DE number 7650376 (Why is no real title available?)
- A Chasm Between Identity and Equivalence Testing with Conditional Queries
- A discriminative model for semi-supervised learning
- A theory of the learnable
- Agnostically Learning Halfspaces
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Analysis of Boolean Functions
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- Big data on the rise? Testing monotonicity of distributions
- Constant depth circuits, Fourier transform, and learnability
- Cryptographic hardness for learning intersections of halfspaces
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Distribution testing lower bounds via reductions from communication complexity
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- Faster sublinear algorithms using conditional sampling
- Improving and extending the testing of distributions for shape-restricted properties
- Learnability with respect to fixed distributions
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Learning Decision Trees Using the Fourier Spectrum
- Learning Mixtures of Product Distributions over Discrete Domains
- Learning decision trees from random examples
- Learning intersections and thresholds of halfspaces
- PAC learning with nasty noise.
- Polynomial regression under arbitrary product distributions
- Probably Approximate Learning over Classes of Distributions
- Property testing and its connection to learning and approximation
- Property testing of joint distributions using conditional samples
- Robust Characterizations of Polynomials with Applications to Program Testing
- Selection of relevant features and examples in machine learning
- Streaming and sublinear approximation of entropy and information distances
- Testing monotone high‐dimensional distributions
- Testing probability distributions underlying aggregated data
- Testing probability distributions using conditional samples
- The Complexity of Approximating the Entropy
- The Power of Linear Estimators
- The intersection of two halfspaces has high threshold degree
- Toward efficient agnostic learning
This page was built for publication: Lifting uniform learners via distributional decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499339)
