메뉴 건너뛰기




Volumn , Issue , 2007, Pages 249-256

Implicit online learning with kernels

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED MEMORIES; COMPACT REPRESENTATION; CONVERGENCE RATES; EXPERIMENTAL EVIDENCE; IMPLICIT ONLINE LEARNING WITH KERNELS; LOSS BOUNDS; LOSS FUNCTIONS; NON-STATIONARY ENVIRONMENT; ONLINE LEARNING; REPRODUCING KERNEL HILBERT SPACES; SOLUTION QUALITY; SYNTHETIC AND REAL DATA;

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

References (8)
  • 1
    • 0008815681 scopus 로고    scopus 로고
    • Exponentiated gradient versus gradient descent for linear predictors
    • J. Kivinen and M. K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-64, 1997.
    • (1997) Information and Computation , vol.132 , Issue.1 , pp. 1-64
    • Kivinen, J.1    Warmuth, M.K.2
  • 4
    • 0004267646 scopus 로고
    • volume 28 of Princeton Mathematics Series. Princeton University Press
    • R. T. Rockafellar. Convex Analysis, volume 28 of Princeton Mathematics Series. Princeton University Press, 1970.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 7
    • 4544304381 scopus 로고    scopus 로고
    • On the generalization ability of on-line learning algorithms
    • N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Trans. Information Theory, 50(9):2050-2057, 2004.
    • (2004) IEEE Trans. Information Theory , vol.50 , Issue.9 , pp. 2050-2057
    • Cesa-Bianchi, N.1    Conconi, A.2    Gentile, C.3


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