Evolution with drifting targets

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 155-167

  Kanade, Varun ^a   Valiant, Leslie G ^a   Vaughan, Jennifer Wortman ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTION ALGORITHMS; GRADUAL CHANGES; LINEAR SEPARATORS; PERFORMANCE DEGRADATION; POLYNOMIAL RESOURCES; SYMMETRIC DISTRIBUTIONS; TARGET CONCEPT; TARGET FUNCTIONS;

NORMAL DISTRIBUTION;

EVOLUTIONARY ALGORITHMS;

EID: 84861582361     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

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(2):191-208, 1998.
2. P. L. Bartlett. Learning with a slowly changing distribution. In COLT 5, 1992.
3. R. D. Barve and P. M. Long. On the complexity of learning from drifting distributions. Information and Computation, 138(2):101-123, 1997.
4. 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.
5. N. H. Bshouty and V. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research, 2:359-395, 2002.
6. S. Dasgupta. Coarse sample complexity bounds for active learning. In NIPS 18, 2005.
7. S. Dasgupta, A. Kalai, and C. Monteleoni. Analysis of perceptron-based active learning. Journal of Machine Learning Research, pages 281-299, 2009.
8. D. I. Diochnos and G. Turàn. On evolvability: The swapping algorithm, product distributions, and covariance. In Fifth Symposium on Stochastic Algorithms, Foundations and Applications, 2009.
9. V. Feldman. Evolvability from learning algorithms. In Proceedings of ACM STOC 40, 2008.
10. V. Feldman. Robustness of evolvability. In COLT 22, 2009.
11. V. Feldman. A complete characterization of statistical query learning with applications to evolvability. In Proceedings of the IEEE Symposium on Foundation of Computer Science, 2009.
12. D. P. Helmbold and P. M. Long. Tracking drifting concepts by minimizing disagreements. Machine Learning, 14(1):27-46, 1994.
13. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30.
14. B. Jacobson. Personal communication, 2007.
15. V. Kanade, L. G. Valiant, and J. W. Vaughan. Evolution with drifting targets. http://arxiv.org/abs/1005.3566, 2010.
16. M. Kearns. Efficient noise-tolerant learning from statistical queries. JACM, 45(6):983-1006, 1998.
17. A. Kuh, T. Petsche, and R. Rivest. Incrementally learning time-varying half-planes. In NIPS 4, 1991.
18. L. Michael. Evolvability via the Fourier transform. Theoretical Computer Science, 2010. To appear.
19. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
20. L. G. Valiant. Evolvability. Journal of the ACM, 56(1):1-21, 2009.