메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1-9

Information-theoretic lower bounds on the oracle complexity of convex optimization

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; LEARNING SYSTEMS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

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

References (11)
  • 2
    • 34250136988 scopus 로고
    • Approximation dans les espaces metriques et theorie de l'estimation
    • L. Birgé. Approximation dans les espaces metriques et theorie de l'estimation. Z. Wahrsch. verw. Gebiete, 65:181-327, 1983.
    • (1983) Z. Wahrsch. Verw. Gebiete , vol.65 , pp. 181-327
    • Birgé, L.1
  • 3
    • 85162035281 scopus 로고    scopus 로고
    • The tradeoffs of large scale learning
    • L. Bottou and O. Bousquet. The tradeoffs of large scale learning. In NIPS. 2008.
    • (2008) NIPS
    • Bottou, L.1    Bousquet, O.2
  • 5
    • 0009387419 scopus 로고
    • A lower bound on the risks of nonparametric estimates of densities in the uniform metric
    • R. Z. Has'minskii. A lower bound on the risks of nonparametric estimates of densities in the uniform metric. Theory Prob. Appl., 23:794-798, 1978.
    • (1978) Theory Prob. Appl. , vol.23 , pp. 794-798
    • Has'minskii, R.Z.1
  • 9
    • 56449110590 scopus 로고    scopus 로고
    • SVM optimization: Inverse dependence on training set size
    • S. Shalev-Shwartz and N. Srebro. SVM optimization: inverse dependence on training set size. In ICML, 2008.
    • (2008) ICML
    • Shalev-Shwartz, S.1    Srebro, N.2


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