메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1121-1128

Manifold identification of dual averaging methods for regularized stochastic online learning

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SUBGRADIENTS; AVERAGING METHOD; COMPUTATIONAL RESULTS; HIGH PROBABILITY; INTRINSIC DIMENSIONS; LOSS FUNCTIONS; LOW-DIMENSIONAL MANIFOLDS; MANIFOLD IDENTIFICATION; NON-SMOOTH; ONLINE LEARNING; REGULARIZER; STOCHASTIC LEARNING; STREAMING DATA;

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

References (13)
  • 2
    • 4544378568 scopus 로고    scopus 로고
    • Identifying active constraints via partial smoothness and prox-regularity
    • Hare, W. L. and Lewis, A. S. Identifying active constraints via partial smoothness and prox-regularity. Journal of Convex Analysis, 11(2):251-266, 2004. (Pubitemid 39216721)
    • (2004) Journal of Convex Analysis , vol.11 , Issue.2 , pp. 251-266
    • Hare, W.L.1    Lewis, A.S.2
  • 5
    • 70450197241 scopus 로고    scopus 로고
    • Robust stochastic approximation approach to stochastic programming
    • Nemirovski, A., Juditsky, A., Lan, G., and Shapiro, A. Robust stochastic approximation approach to stochastic programming. SIAM Journal on Optimization, 19(4):1574-1609, 2009.
    • (2009) SIAM Journal on Optimization , vol.19 , Issue.4 , pp. 1574-1609
    • Nemirovski, A.1    Juditsky, A.2    Lan, G.3    Shapiro, A.4
  • 6
    • 17444406259 scopus 로고    scopus 로고
    • Smooth minimization of nonsmooth functions
    • Nesterov, Y. Smooth minimization of nonsmooth functions. Mathematical Programming, Series A, 103:127-152, 2005.
    • (2005) Mathematical Programming, Series A , vol.103 , pp. 127-152
    • Nesterov, Y.1
  • 7
    • 65249121279 scopus 로고    scopus 로고
    • Primal-dual subgradient methods for convex problems
    • Nesterov, Y. Primal-dual subgradient methods for convex problems. Mathematical Programming, 120:221-259, 2009.
    • (2009) Mathematical Programming , vol.120 , pp. 221-259
    • Nesterov, Y.1
  • 10
    • 0027623858 scopus 로고
    • Identifiable surfaces in constrained optimization
    • Wright, S. J. Identifiable surfaces in constrained optimization. SIAM Journal on Control and Optimization, 31:1063-1079, 1993.
    • (1993) SIAM Journal on Control and Optimization , vol.31 , pp. 1063-1079
    • Wright, S.J.1
  • 12
    • 78649396336 scopus 로고    scopus 로고
    • Dual averaging methods for regularized stochastic learning and online optimization
    • October
    • Xiao, L. Dual averaging methods for regularized stochastic learning and online optimization. Journal of Machine Learning Research, 11:2543-2596, October 2010.
    • (2010) Journal of Machine Learning Research , vol.11 , pp. 2543-2596
    • Xiao, L.1


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