Learnability beyond AC0

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 776-784

  Jackson, Jeffrey C ^a   Klivans, Adam R ^b   Servedio, Rocco A ^c  

^a DUQUESNE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FOURIER TRANSFORMS; LEARNING ALGORITHMS; LOGIC CIRCUITS; LOGIC GATES; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

BOOLEAN CIRCUITS; CONSTANT DEPTH CIRCUITS; POLYLOGARITHMIC NUMBER; POLYNOMIAL SIZE CIRCUITS; UNIFORM DISTRIBUTION;

LEARNING SYSTEMS;

EID: 0036039960     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.510018     Document Type: Conference Paper

References (30)

1. The expressive power of voting polynomials
2. A polynomial time algorithm that learns two hidden unit nets
3. When do extra majority gates help? polylog(n) majority gates are equivalent to one
4. Pp is closed under intersection
5. Rank-r decision trees are a subclass of r-decision lists
6. A polynomial time algorithm for learning noisy linear threshold functions
7. Learnability and the vapnik-chervonenkis dimension
8. Harmonic analysis of polynomial threshold functions
9. A subexponential exact learning algorithm for dnf using equivalence queries
10. On boosting with optimal poly-bounded distributions
11. On the fourier spectrum of monotone functions
12. Madaboost: A modified version of adaboost
13. Learning decision trees from random examples
14. Boosting a weak learning algorithm by majority
15. Threshold circuits of bounded depth
16. An efficient membership-query algorithm for learning dnf with respect to the uniform distribution
17. Learning boolean formulas
18. Cryptographic hardness of distribution-specific learning
19. Boosting and hard-core sets
20. ō(n1/3)
21. On the computational power of depth 2 circuits with threshold and modulo gates
22. Constant depth circuits, fourier transform and learnability
23. Number-theoretic constructions of efficient pseudo-random functions
24. Learning dnf by approximating inclusion-exclusion formulae
25. A theory of the learnable
26. A random sampling based algorithm for learning the intersection of halfspaces
27. Complexity of symmetric functions in perceptron-like models