Evolvability from learning algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 619-628

  Feldman, Vitaly ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Evolvability; PAC learning; Statistical query

Indexed keywords

COMPUTATION THEORY; EQUIVALENCE CLASSES; LEARNING ALGORITHMS;

BOOLEAN VARIABLES; EVOLUTIONARY PROCESS; EVOLVABILITY; LINEAR THRESHOLD FUNCTIONS; PAC LEARNING; STATISTICAL QUERIES; STATISTICAL QUERY MODELS; UNIFORM DISTRIBUTION;

FUNCTIONS;

EID: 57049148607     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374465     Document Type: Conference Paper

References (26)

1. J. Aslam and S. Decatur, Specification and simulation of statistical query algorithms for efficiency and noise tolerance. Journal of Computer and System Sciences, 56:191-208, 1998.
2. S. Ben-David, B. Ghor, O. Goldreich, and M. Luby. On the theory of average case complexity. Journal of Computer and System Sciences, 44(2):193-219, 1992.
3. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(l/2):35-52, 1997.
4. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour. and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in Proceedings of STOCJ, pages 253-262, 1994.
5. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM, 50(4):506-519, 2003.
6. N. Bshouty and V. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research, 2:359-395, 2002.
7. H. Buhrman, N. Vereshchagin, and R. de Wolf. On computation and communication with small bias. In Proceedings of IEEE Conference on Computational Complexity, pages 24-32, 2007.
8. T. Bylander. Learning linear threshold functions in the presence of classification noise. In Proceedings of COLT, pages 340-347, 1994.
9. J. Dunagan and S. Vempala. A simple polynomial-time reseating algorithm for solving linear programs, in Proceedings of STOC, pages 315-320, 2004.
10. V. Feldman. Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions, Journal of Machine Learning Research, (8):1431-1460, 2007.
11. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, 1995.
12. M. Goldmann, J. Hastad, and A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
13. A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, and G. Turan. Threshold circuits of bounded depth. Journal of Computer and System Sciences, 46:129-154, 1993.
14. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the. American Statistical Association, 58:13-30, 1963.
15. J. Jackson, E. Shamir, and C. Shwartzman. Learning with queries corrupted by classification noise. In Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems, pages 45-53. 1997.
16. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
17. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, ALA, 1994.
18. th Conference on Learning Theory (COLT), 2006.
19. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
20. L. Michael. Evolving decision lists. Manuscript, 2007.
21. R. Rivest. Learning decision lists. Machine, Learning, 2(3):229-246, 1987.
22. A. A. Sherstov. Halfspace matrices, In Proceedings of LEEE Conference, on Computational Complexity, pages 83-95, 2007.
23. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11 ):1134-1142, 1984.
24. L. G. Valiant. Evolvability. Electronic. Colloquium on Computational Complexity (ECCC), 6(120), 2006.
25. L. G. Valiant. Evolvability. In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science, pages 22-43, 2007.
26. K. Yang. New lower bounds for statistical query learning. Journal of Computer and System Sciences, 70(4):485-509, 2005.