메뉴 건너뛰기




Volumn 5809 LNAI, Issue , 2009, Pages 186-200

Characterizing statistical query learning: Simplified notions and proofs

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT CLASS; CONSISTENT ALGORITHM; LEARNABILITY; SIMPLE APPROACH; STATISTICAL QUERIES; STATISTICAL QUERY MODELS; TARGET CONCEPT; UNIFORM DISTRIBUTION;

EID: 77952015400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04414-4_18     Document Type: Conference Paper
Times cited : (44)

References (12)
  • 1
    • 0346398224 scopus 로고    scopus 로고
    • General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
    • Aslam, J.A., Decatur, S.E.: General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Inf. Comput. 141(2), 85-118 (1998)
    • (1998) Inf. Comput. , vol.141 , Issue.2 , pp. 85-118
    • Aslam, J.A.1    Decatur, S.E.2
  • 4
    • 0037708179 scopus 로고    scopus 로고
    • On using extended statistical queries to avoid membership queries
    • Bshouty, N.H., Feldman, V.: 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.H.1    Feldman, V.2
  • 6
    • 0032202014 scopus 로고    scopus 로고
    • Efficient noise-tolerant learning from statistical queries
    • Kearns, M.: Efficient noise-tolerant learning from statistical queries. J. ACM 45(6), 983-1006 (1998)
    • (1998) J. ACM , vol.45 , Issue.6 , pp. 983-1006
    • Kearns, M.1
  • 7
    • 29144433948 scopus 로고    scopus 로고
    • The complexity of learning concept classes with polynomial general dimension
    • Köbler, J., Lindner, W.: The complexity of learning concept classes with polynomial general dimension. Theor. Comput. Sci. 350(1), 49-62 (2006)
    • (2006) Theor. Comput. Sci. , vol.350 , Issue.1 , pp. 49-62
    • Köbler, J.1    Lindner, W.2
  • 8
    • 38049178958 scopus 로고    scopus 로고
    • A characterization of strong learnability in the statistical query model
    • Thomas, W., Weil, P. (eds.) STACS 2007. Springer, Heidelberg
    • Simon, H.U.: A characterization of strong learnability in the statistical query model. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 393-404. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4393 , pp. 393-404
    • Simon, H.U.1
  • 10
    • 17444425308 scopus 로고    scopus 로고
    • New lower bounds for statistical query learning
    • Yang, K.: New lower bounds for statistical query learning. J. Comput. Syst. Sci. 70(4), 485-509 (2005);
    • (2005) J. Comput. Syst. Sci. , vol.70 , Issue.4 , pp. 485-509
    • Yang, K.1
  • 11
    • 77952035066 scopus 로고    scopus 로고
    • Kivinen, J., Sloan, R.H. (eds.) COLT 2002. Springer, Heidelberg
    • In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 229-509. Springer, Heidelberg (2002)
    • (2002) LNCS (LNAI) , vol.2375 , pp. 229-509
  • 12
    • 84948123449 scopus 로고    scopus 로고
    • On learning correlated boolean functions using statistical queries
    • Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. Springer, Heidelberg
    • Yang, K.: On learning correlated boolean functions using statistical queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 591-676 Springer, Heidelberg (2001)
    • (2001) LNCS (LNAI) , vol.2225 , pp. 591-676
    • Yang, K.1


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