On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation

Authors:
Johannes Köbler;Wolfgang Lindner
Affiliations:
-;-
Venue:
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2000

Citing 17
Cited 0

A theory of the learnable

Communications of the ACM
How to construct random functions

Journal of the ACM (JACM)
Occam's razor

Information Processing Letters
The Strength of Weak Learnability

Machine Learning
When won't membership queries help?

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Almost everywhere high nonuniform complexity

Journal of Computer and System Sciences
Cryptographic hardness of distribution-specific learning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Amplification of weak learning under the uniform distribution

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata

Journal of the ACM (JACM)
Cryptographic primitives based on hard learning problems

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Hardness vs randomness

Journal of Computer and System Sciences
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution

Journal of Computer and System Sciences
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution

Journal of Computer and System Sciences
Resource Bounded Measure and Learnability

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Randomness vs. Time: De-Randomization under a Uniform Assumption

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Separating distribution-free and mistake-bound learning models over the Boolean domain

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a weak version of pseudorandom function generators and show that their existence is equivalent to the non-learnability of Boolean circuits in Valiant's pac-learning model with membership queries on the uniform distribution. Furthermore, we show that this equivalence holds still for the case of non-adaptive membership queries and for any (non-trivial) p-samplable distribution.