메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Robustness of evolvability

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL CAPABILITY; EVOLUTIONARY PROCESS; FUNCTION CLASS; MUTATION ALGORITHMS; ORIGINAL MODEL; PAC LEARNING; QUADRATIC LOSS; SELECTION RULES;

EID: 84898066322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (24)
  • 1
    • 0032047249 scopus 로고    scopus 로고
    • Specification and simulation of statistical query algorithms for efficiency and noise tolerance
    • 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.
    • (1998) Journal of Computer and System Sciences , vol.56 , pp. 191-208
    • Aslam, J.1    Decatur, S.2
  • 3
    • 0037708179 scopus 로고    scopus 로고
    • On using extended statistical queries to avoid membership queries
    • N. Bshouty and V. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research, 2: 359-395, 2002.
    • (2002) Journal of Machine Learning Research , vol.2 , pp. 359-395
    • Bshouty, N.1    Feldman, V.2
  • 6
    • 57049148607 scopus 로고    scopus 로고
    • Evolvability from learning algorithms
    • V. Feldman. Evolvability from learning algorithms. In Proceedings of STOC, pages 619-628, 2008.
    • (2008) Proceedings of STOC , pp. 619-628
    • Feldman, V.1
  • 8
  • 10
    • 0002192516 scopus 로고
    • Decision theoretic generalizations of the PAC model for neural net and other learning applications
    • D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1): 78-150, 1992.
    • (1992) Information and Computation , vol.100 , Issue.1 , pp. 78-150
    • Haussler, D.1
  • 12
  • 14
    • 0032202014 scopus 로고    scopus 로고
    • Efficient noise-tolerant learning from statistical queries
    • M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6): 983-1006, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.6 , pp. 983-1006
    • Kearns, M.1
  • 15
    • 0028460231 scopus 로고
    • Efficient distribution-free learning of probabilistic concepts
    • M. Kearns and R. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48: 464-497, 1994.
    • (1994) Journal of Computer and System Sciences , vol.48 , pp. 464-497
    • Kearns, M.1    Schapire, R.2
  • 18
    • 0021518106 scopus 로고
    • A theory of the learnable
    • L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11): 1134-1142, 1984.
    • (1984) Communications of the ACM , vol.27 , Issue.11 , pp. 1134-1142
    • Valiant, L.G.1
  • 20
    • 84898073197 scopus 로고    scopus 로고
    • L. G. Valiant, 2008. Personal communication
    • L. G. Valiant, 2008. Personal communication.
  • 21
    • 60349123335 scopus 로고    scopus 로고
    • Evolvability
    • L. G. Valiant. Evolvability. Journal of the ACM, 56(1): 3.1-3.21, 2009.
    • (2009) Journal of the ACM , vol.56 , Issue.1 , pp. 31-321
    • Valiant, L.G.1
  • 22
    • 84879523147 scopus 로고    scopus 로고
    • Theoretical aspects of evolutionary algorithms
    • I. Wegener. Theoretical aspects of evolutionary algorithms. In Proceedings of ICALP, pages 64-78, 2001.
    • (2001) Proceedings of ICALP , pp. 64-78
    • Wegener, I.1
  • 24
    • 0032121805 scopus 로고    scopus 로고
    • A decision-theoretic extension of stochcastic complexity and its applications to learning
    • K. Yamanishi. A decision-theoretic extension of stochcastic complexity and its applications to learning. IEEE Transactions on Information Theory, 44(4): 1424-1439, 1998.
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.4 , pp. 1424-1439
    • Yamanishi, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.