Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Learning from good and bad data
Learning from good and bad data
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Artificial Intelligence
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
The Strength of Weak Learnability
Machine Learning
Types of noise in data for concept learning
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A general lower bound on the number of examples needed for learning
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning monotone ku DNF formulas on product distributions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Improved learning of AC0 functions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
SIAM Journal on Computing
On learning ring-sum-expansions
SIAM Journal on Computing
The design and analysis of efficient learning algorithms
The design and analysis of efficient learning algorithms
Learning in the presence of malicious errors
SIAM Journal on Computing
Efficient distribution-free learning of probabilistic concepts
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An introduction to computational learning theory
An introduction to computational learning theory
Specification and simulation of statistical query algorithms for efficiency and noise tolerance
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computational Complexity of Machine Learning
Computational Complexity of Machine Learning
Machine Learning
Machine Learning
Learning noisy perceptrons by a perceptron in polynomial time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A polynomial-time algorithm for learning noisy linear threshold functions
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Remarks on computational learning theory
Annals of Mathematics and Artificial Intelligence
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A General Dimension for Approximately Learning Boolean Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Boosting in the presence of noise
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
Cost-Sensitive Learning by Cost-Proportionate Example Weighting
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Journal of Computer and System Sciences - STOC 2001
Machine Learning
Learning functions of k relevant variables
Journal of Computer and System Sciences - Special issue: STOC 2003
Security Parallels between People and Pervasive Devices
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Practical privacy: the SuLQ framework
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Agnostically Learning Halfspaces
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Learning mixtures of product distributions over discrete domains
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Boosting in the presence of noise
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Active EM to reduce noise in activity recognition
Proceedings of the 12th international conference on Intelligent user interfaces
A general dimension for query learning
Journal of Computer and System Sciences
Evolvability from learning algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On agnostic boosting and parity learning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A tamper-proof and lightweight authentication scheme
Pervasive and Mobile Computing
Journal of the ACM (JACM)
Separating models of learning with faulty teachers
Theoretical Computer Science
Good learners for evil teachers
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Proceedings of the 10th ACM conference on Electronic commerce
Learning from partial observations
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Learning to classify texts using positive and unlabeled data
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A discriminative model for semi-supervised learning
Journal of the ACM (JACM)
A team of continuous-action learning automata for noise-tolerant learning of half-spaces
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Application of a generalization of russo's formula to learning from multiple random oracles
Combinatorics, Probability and Computing
A study of the effect of different types of noise on the precision of supervised learning techniques
Artificial Intelligence Review
A characterization of strong learnability in the statistical query model
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient cryptographic protocols based on the hardness of learning parity with noise
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Partial observability and learnability
Artificial Intelligence
Characterizing statistical query learning: simplified notions and proofs
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
On evolvability: the swapping algorithm, product distributions, and covariance
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Airavat: security and privacy for MapReduce
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
A lower bound for learning distributions generated by probabilistic automata
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Lower bounds on learning random structures with statistical queries
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
The regularized least squares algorithm and the problem of learning halfspaces
Information Processing Letters
The Journal of Machine Learning Research
SIAM Journal on Computing
Privately releasing conjunctions and the statistical query barrier
Proceedings of the forty-third annual ACM symposium on Theory of computing
Privacy-preserving statistical estimation with optimal convergence rates
Proceedings of the forty-third annual ACM symposium on Theory of computing
Preserving privacy in data mining via importance weighting
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
New algorithms for learning in presence of errors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Calculation and optimization of thresholds for sets of software metrics
Empirical Software Engineering
Generalized learning problems and applications to non-commutative cryptography
ProvSec'11 Proceedings of the 5th international conference on Provable security
SIAM Journal on Computing
Spectral norm in learning theory: some selected topics
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Itemset support queries using frequent itemsets and their condensed representations
DS'06 Proceedings of the 9th international conference on Discovery Science
Distribution free evolvability of polynomial functions over all convex loss functions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Submodular functions are noise stable
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learning DNF by statistical and proper distance queries under the uniform distribution
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Learning classifiers from distributed, ontology-extended data sources
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Bounds on the sample complexity for private learning and private data release
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On learning random DNF formulas under the uniform distribution
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Sub-linear queries statistical databases: privacy with power
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
A logical analysis of banks' financial strength ratings
Expert Systems with Applications: An International Journal
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On learning finite-state quantum sources
Quantum Information & Computation
A complete characterization of statistical query learning with applications to evolvability
Journal of Computer and System Sciences
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Evolvability via the Fourier transform
Theoretical Computer Science
PAC-Learning with general class noise models
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
On the learnability of shuffle ideals
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Learning probabilistic automata: A study in state distinguishability
Theoretical Computer Science
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
ACM Transactions on Economics and Computation
Towards privacy-preserving computing on distributed electronic health record data
Proceedings of the 2013 Middleware Doctoral Symposium
Attribute-efficient evolvability of linear functions
Proceedings of the 5th conference on Innovations in theoretical computer science
On the learnability of shuffle ideals
The Journal of Machine Learning Research
| Hi-index | 0.01 |
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the class of “robust” learning algorithms in the most general way, we formalize a new but related model of learning from statistical queries. Intuitively, in this model a learning algorithm is forbidden to examine individual examples of the unknown target function, but is given acess to an oracle providing estimates of probabilities over the sample space of random examples.One of our main results shows that any class of functions learnable from statistical queries is in fact learnable with classification noise in Valiant's model, with a noise rate approaching the information-theoretic barrier of 1/2. We then demonstrate the generality of the statistical query model, showing that practically every class learnable in Valiant's model and its variants can also be learned in the new model (and thus can be learned in the presence of noise). A notable exception to this statement is the class of parity functions, which we prove is not learnable from statistical queries, and for which no noise-tolerant algorithm is known.