메뉴 건너뛰기




Volumn 60, Issue 9, 2014, Pages 5716-5735

Online learning as stochastic approximation of regularization paths: Optimality and almost-sure convergence

Author keywords

Online learning; regularization path; reproducing kernel Hilbert space; stochastic approximations

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; LEARNING ALGORITHMS; MULTIMEDIA SERVICES; OPTIMIZATION;

EID: 84906663901     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2332531     Document Type: Article
Times cited : (97)

References (38)
  • 1
    • 84860244324 scopus 로고    scopus 로고
    • Information-Theoretic lower bounds on the oracle complexity of convex optimization
    • May 2012
    • A. Agarwal, P. L. Bartlett, P. Ravikumar, and M. J. Wainwright, "Information-Theoretic lower bounds on the oracle complexity of convex optimization," IEEE Trans. Inform. Theory, vol. 58, no. 5, pp. 3235-3249, May 2012
    • IEEE Trans. Inform. Theory , vol.58 , Issue.5 , pp. 3235-3249
    • Agarwal, A.1    Bartlett, P.L.2    Ravikumar, P.3    Wainwright, M.J.4
  • 2
    • 5844297152 scopus 로고
    • Theory of reproducing kernels
    • N. Aronszajn, "Theory of reproducing kernels," Trans. Amer. Math. Soc., vol. 68, no. 3, pp. 337-404, 1950
    • (1950) Trans. Amer. Math. Soc , vol.68 , Issue.3 , pp. 337-404
    • Aronszajn, N.1
  • 3
    • 85162480829 scopus 로고    scopus 로고
    • Non-Asymptotic analysis of stochastic approximation algorithms for machine learning
    • F. R. Bach and E. Moulines, "Non-Asymptotic analysis of stochastic approximation algorithms for machine learning," in Proc. Adv. Neural Inform. Process. Syst. (NIPS), 2011, pp. 451-459
    • (2011) Proc. Adv. Neural Inform. Process. Syst. (NIPS , pp. 451-459
    • Bach, F.R.1    Moulines, E.2
  • 6
    • 81155150371 scopus 로고    scopus 로고
    • Incremental proximal methods for large scale convex optimization
    • Oct
    • D. P. Bertsekas, "Incremental proximal methods for large scale convex optimization," Math. Program., vol. 129, no. 2, pp. 163-195, Oct. 2011
    • (2011) Math. Program , vol.129 , Issue.2 , pp. 163-195
    • Bertsekas, D.P.1
  • 7
    • 34548537866 scopus 로고    scopus 로고
    • Optimal rates for regularized least squares algorithm
    • Jul
    • A. Caponnetto and E. De Vito, "Optimal rates for regularized least squares algorithm," Found. Comput. Math., vol. 7, no. 3, pp. 331-368, Jul. 2007
    • (2007) Found. Comput. Math , vol.7 , Issue.3 , pp. 331-368
    • Caponnetto, A.1    De Vito, E.2
  • 8
    • 48849086653 scopus 로고    scopus 로고
    • Vector valued reproducing kernel hilbert spaces integrable, functions and mercer theorem
    • C. Carmeli, E. De Vito, and A. Toigo, "Vector valued reproducing kernel hilbert spaces integrable, functions and mercer theorem," Anal. Appl., vol. 4, pp. 377-408, 2006
    • (2006) Anal. Appl , vol.4 , pp. 377-408
    • Carmeli, C.1    De Vito, E.2    Toigo, A.3
  • 9
    • 0036071370 scopus 로고    scopus 로고
    • On the mathematical foundations of learning
    • F. Cucker and S. Smale, "On the mathematical foundations of learning," Bull. Amer. Math. Soc., vol. 29, no. 1, pp. 1-49, 2002
    • (2002) Bull. Amer. Math. Soc , vol.29 , Issue.1 , pp. 1-49
    • Cucker, F.1    Smale, S.2
  • 14
    • 0034419669 scopus 로고    scopus 로고
    • Regularized networks and support vector machines
    • Apr
    • T. Evgeniou, M. Pontil, and T. Poggio, "Regularized networks and support vector machines," Adv. Comput. Math., vol. 13, no. 1, pp. 1-50, Apr. 2000
    • (2000) Adv. Comput. Math , vol.13 , Issue.1 , pp. 1-50
    • Evgeniou, T.1    Pontil, M.2    Poggio, T.3
  • 17
    • 0001079593 scopus 로고
    • Stochastic estimation of the maximum of a regression function
    • J. Kiefer and J. Wolfowitz, "Stochastic estimation of the maximum of a regression function," Ann. Math. Statist., vol. 23, no. 3, pp. 462-466. 1952
    • (1952) Ann. Math. Statist , vol.23 , Issue.3 , pp. 462-466
    • Kiefer, J.1    Wolfowitz, J.2
  • 20
    • 0003294026 scopus 로고
    • Fonctions alèatoires du second ordre
    • P. Lèvy, Ed. Paris, France: Gauthier-Villars
    • M. Loéve, "Fonctions alèatoires du second ordre," in Processus Stochastiques et Mouvement Brownien, P. Lèvy, Ed. Paris, France: Gauthier-Villars, 1948
    • (1948) Processus Stochastiques et Mouvement Brownien
    • Loéve, M.1
  • 22
    • 0000461110 scopus 로고
    • An approach to time series analysis
    • E. Parzen, "An approach to time series analysis," Ann. Math. Statist., vol. 32, no. 4, pp. 951-989, 1961
    • (1961) Ann. Math. Statist , vol.32 , Issue.4 , pp. 951-989
    • Parzen, E.1
  • 23
    • 0001638327 scopus 로고
    • Optimum bounds for the distributions of martingales in banach spaces
    • I. Pinelis, "Optimum bounds for the distributions of martingales in Banach spaces," Ann. Probab., vol. 22, no. 4, pp. 1679-1706, 1994
    • (1994) Ann. Probab , vol.22 , Issue.4 , pp. 1679-1706
    • Pinelis, I.1
  • 24
    • 0000016172 scopus 로고
    • A stochastic approximation method
    • H. Robbins and S. Monro, "A stochastic approximation method," Ann. Math. Statist., vol. 22, no. 3, pp. 400-407, 1951
    • (1951) Ann. Math. Statist , vol.22 , Issue.3 , pp. 400-407
    • Robbins, H.1    Monro, S.2
  • 25
    • 34548452938 scopus 로고    scopus 로고
    • Piecewise linear regularized solution paths
    • S. Rosset and J. Zhu, "Piecewise linear regularized solution paths," Ann. Statist., vol. 35, no. 3, pp. 1012-1030, 2007
    • (2007) Ann. Statist , vol.35 , Issue.3 , pp. 1012-1030
    • Rosset, S.1    Zhu, J.2
  • 27
    • 33744740175 scopus 로고    scopus 로고
    • Online learning algorithms
    • S. Smale and Y. Yao, "Online learning algorithms," Found. Comput. Math., vol. 6, no. 2, pp. 145-170, 2006
    • (2006) Found. Comput. Math , vol.6 , Issue.2 , pp. 145-170
    • Smale, S.1    Yao, Y.2
  • 28
    • 3042850649 scopus 로고    scopus 로고
    • Shannon sampling and function reconstruction from point values
    • S. Smale and D.-X. Zhou, "Shannon sampling and function reconstruction from point values," Bull. Amer. Math. Soc., vol. 41, no. 3, pp. 279-305, 2004
    • (2004) Bull. Amer. Math. Soc , vol.41 , Issue.3 , pp. 279-305
    • Smale, S.1    Zhou, D.-X.2
  • 29
    • 34547455409 scopus 로고    scopus 로고
    • Learning theory estimates via integral operators and their approximations
    • S. Smale and D.-X. Zhou, "Learning theory estimates via integral operators and their approximations," Constructive Approx., vol. 26, no. 2, pp. 153-172, 2007
    • (2007) Constructive Approx , vol.26 , Issue.2 , pp. 153-172
    • Smale, S.1    Zhou, D.-X.2
  • 30
    • 67649954573 scopus 로고    scopus 로고
    • Online learning with Markov sampling
    • Jan
    • S. Smale and D.-X. Zhou, "Online learning with Markov sampling," Anal. Appl., vol. 7, no. 1, pp. 87-113, Jan. 2009
    • (2009) Anal. Appl , vol.7 , Issue.1 , pp. 87-113
    • Smale, S.1    Zhou, D.-X.2
  • 32
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc, Ser. B., vol. 58, no. 1, pp. 267-288, 1996
    • (1996) J. Roy. Statist. Soc, Ser. B. , vol.58 , Issue.1 , pp. 267-288
    • Tibshirani, R.1
  • 35
    • 84906685861 scopus 로고    scopus 로고
    • Ph.D dissertation, Dept. Math., Univ. Calfornia, Berkeley, CA, USA
    • Y. Yao, "A dynamic theory of learning," Ph.D dissertation, Dept. Math., Univ. Calfornia, Berkeley, CA, USA, 2006
    • (2006) A Dynamic Theory of Learning
    • Yao, Y.1
  • 36
    • 78649381411 scopus 로고    scopus 로고
    • On complexity issue of online learning algorithms
    • Dec
    • Y. Yao, "On complexity issue of online learning algorithms," IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6470-6481, Dec. 2010
    • (2010) IEEE Trans. Inform. Theory , vol.56 , Issue.12 , pp. 6470-6481
    • Yao, Y.1
  • 37
    • 52949113792 scopus 로고    scopus 로고
    • Online gradient descent learning algorithms
    • Y. Ying and M. Pontil, "Online gradient descent learning algorithms," Found. Comput. Math., vol. 5, no. 5, pp. 561-596, 2008
    • (2008) Found. Comput. Math , vol.5 , Issue.5 , pp. 561-596
    • Ying, Y.1    Pontil, M.2
  • 38
    • 84886467988 scopus 로고    scopus 로고
    • Density problem and approximation error in learning theory
    • 2013, Article ID 715683 doi:10.1155/2013/715683
    • D.-X. Zhou, "Density problem and approximation error in learning theory," in Proc. Abstract Appl. Anal., vol. 2013, 2013, Article ID 715683, doi:10.1155/2013/715683.
    • (2013) Proc. Abstract Appl. Anal
    • Zhou, D.-X.1


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