메뉴 건너뛰기




Volumn 2, Issue January, 2014, Pages 1197-1205

From stochastic mixability to fast rates

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; STOCHASTIC MODELS;

EID: 84937879849     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (24)
  • 2
    • 68649088331 scopus 로고    scopus 로고
    • Fast learning rates in statistical inference through aggregation
    • Jean-Yves Audibert. Fast learning rates in statistical inference through aggregation. The Annals of Statistics, 37(4): 1591-1646, 2009.
    • (2009) The Annals of Statistics , vol.37 , Issue.4 , pp. 1591-1646
    • Audibert, J.-Y.1
  • 9
    • 0002515295 scopus 로고
    • The general moment problem, a geometric approach
    • Johannes H.B. Kemperman. The general moment problem, a geometric approach. The Annals of Mathematical Statistics, 39(1): 93-122, 1968.
    • (1968) The Annals of Mathematical Statistics , vol.39 , Issue.1 , pp. 93-122
    • Kemperman, J.H.B.1
  • 10
    • 33746194045 scopus 로고    scopus 로고
    • Local rademacher complexities and oracle inequalities in risk minimization
    • Vladimir Koltchinskii. Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics, 34(6): 2593-2656, 2006.
    • (2006) The Annals of Statistics , vol.34 , Issue.6 , pp. 2593-2656
    • Koltchinskii, V.1
  • 15
    • 0033234630 scopus 로고    scopus 로고
    • Smooth discrimination analysis
    • Enno Mammen and Alexandre B. Tsybakov. Smooth discrimination analysis. The Annals of Statistics, 27(6): 1808-1829, 1999.
    • (1999) The Annals of Statistics , vol.27 , Issue.6 , pp. 1808-1829
    • Mammen, E.1    Tsybakov, A.B.2
  • 16
    • 33746243474 scopus 로고    scopus 로고
    • Risk bounds for statistical learning
    • Pascal Massart and Élodie Nédélec. Risk bounds for statistical learning. The Annals of Statistics, 34(5): 2326-2366, 2006.
    • (2006) The Annals of Statistics , vol.34 , Issue.5 , pp. 2326-2366
    • Massart, P.1    Nédélec, E.2
  • 17
    • 48849092018 scopus 로고    scopus 로고
    • Lower bounds for the empirical minimization algorithm
    • Shahar Mendelson. Lower bounds for the empirical minimization algorithm. IEEE Transactions on Information Theory, 54(8): 3797-3803, 2008.
    • (2008) IEEE Transactions on Information Theory , vol.54 , Issue.8 , pp. 3797-3803
    • Mendelson, S.1
  • 18
    • 44649102735 scopus 로고    scopus 로고
    • Obtaining fast error rates in nonconvex situations
    • Shahar Mendelson. Obtaining fast error rates in nonconvex situations. Journal of Complexity, 24(3): 380-397, 2008.
    • (2008) Journal of Complexity , vol.24 , Issue.3 , pp. 380-397
    • Mendelson, S.1
  • 20
    • 3142725508 scopus 로고    scopus 로고
    • Optimal aggregation of classifiers in statistical learning
    • Alexander B. Tsybakov. Optimal aggregation of classifiers in statistical learning. The Annals of Statistics, 32(1): 135-166, 2004.
    • (2004) The Annals of Statistics , vol.32 , Issue.1 , pp. 135-166
    • Tsybakov, A.B.1
  • 23
    • 0032047115 scopus 로고    scopus 로고
    • A game of prediction with expert advice
    • Volodya Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56(2): 153-173, 1998.
    • (1998) Journal of Computer and System Sciences , vol.56 , Issue.2 , pp. 153-173
    • Vovk, V.1
  • 24
    • 0035413537 scopus 로고    scopus 로고
    • Competitive on-line statistics
    • Volodya Vovk. Competitive on-line statistics. International Statistical Review, 69(2): 213-248, 2001.
    • (2001) International Statistical Review , vol.69 , Issue.2 , pp. 213-248
    • Vovk, V.1


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