Lifting uniform learners via distributional decomposition

Cites Work

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

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)