메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2331-2339

Slow learners are fast

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER ARCHITECTURE; E-LEARNING;

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

References (21)
  • 1
    • 85162021730 scopus 로고    scopus 로고
    • Adaptive online gradient descent
    • J. C. Platt, D. Koller, Y. Singer, and S. Roweis, editors Cambridge, MA MIT Press
    • Peter L. Bartlett, Elad Hazan, and Alexander Rakhlin. Adaptive online gradient descent. In J. C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, Cambridge, MA, 2008. MIT Press.
    • (2008) Advances in Neural Information Processing Systems , vol.20
    • Bartlett, P.L.1    Hazan, E.2    Rakhlin, A.3
  • 2
    • 48849085774 scopus 로고    scopus 로고
    • The tradeoffs of large scale learning
    • J. C. Platt, D. Koller, Y. Singer, and S.T. Roweis, editors MIT Press
    • L. Bottou and O. Bousquet. The tradeoffs of large scale learning. In J. C. Platt, D. Koller, Y. Singer, and S.T. Roweis, editors, NIPS. MIT Press, 2007.
    • (2007) NIPS
    • Bottou, L.1    Bousquet, O.2
  • 3
    • 84899022736 scopus 로고    scopus 로고
    • Large scale online learning
    • S. Thrun, L. Saul, and B. Schölkopf, editors Cambridge, MA MIT Press
    • Léon Bottou and Yann LeCun. Large scale online learning. In S. Thrun, L. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16, pages 217-224, Cambridge, MA, 2004. MIT Press.
    • (2004) Advances in Neural Information Processing Systems , vol.16 , pp. 217-224
    • Bottou, L.1    Le Cun, Y.2
  • 7
    • 70049104379 scopus 로고    scopus 로고
    • Proximal regularization for online and batch learning
    • A.P. Danyluk, L. Bottou, and M. L. Littman, editors ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009 ACM
    • C.B. Do, Q.V. Le, and C.-S. Foo. Proximal regularization for online and batch learning. In A.P. Danyluk, L. Bottou, and M. L. Littman, editors, Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, volume 382, page 33. ACM, 2009.
    • (2009) Proceedings of the 26th Annual International Conference on Machine Learning , vol.382 , pp. 33
    • Do, C.B.1    Le, Q.V.2    Foo, C.-S.3
  • 8
    • 35348918820 scopus 로고    scopus 로고
    • Logarithmic regret algorithms for online convex optimization
    • Elad Hazan, Amit Agarwal, and Satyen Kale. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3):169-192, 2007.
    • (2007) Machine Learning , vol.69 , Issue.2-3 , pp. 169-192
    • Hazan, E.1    Agarwal, A.2    Kale, S.3
  • 9
  • 12
    • 0028544395 scopus 로고
    • Network information criterion - Determining the number of hidden units for artificial neural network models
    • N. Murata, S. Yoshizawa, and S. Amari. Network information criterion - determining the number of hidden units for artificial neural network models. IEEE Transactions on Neural Networks, 5:865-872, 1994.
    • (1994) IEEE Transactions on Neural Networks , vol.5 , pp. 865-872
    • Murata, N.1    Yoshizawa, S.2    Amari, S.3
  • 17
    • 84858734243 scopus 로고    scopus 로고
    • Bundle methods for regularized risk minimization
    • Submitted in February 2009
    • Choon Hui Teo, S. V. N. Vishwanthan, Alex J. Smola, and Quoc V. Le. Bundle methods for regularized risk minimization. J. Mach. Learn. Res., 2009. Submitted in February 2009.
    • (2009) J. Mach. Learn. Res.
    • Teo, C.H.1    Vishwanthan, S.V.N.2    Smola, A.J.3    Le, Q.V.4
  • 18
    • 34250731290 scopus 로고    scopus 로고
    • Accelerated training conditional random fields with stochastic gradient methods
    • New York, NY, USA ACM Press
    • S. V. N. Vishwanathan, Nicol N. Schraudolph, Mark Schmidt, and Kevin Murphy. Accelerated training conditional random fields with stochastic gradient methods. In Proc. Intl. Conf. Machine Learning, pages 969-976, New York, NY, USA, 2006. ACM Press.
    • (2006) Proc. Intl. Conf. Machine Learning , pp. 969-976
    • Vishwanathan, S.V.N.1    Schraudolph, N.N.2    Schmidt, M.3    Murphy, K.4
  • 19
    • 85162026715 scopus 로고    scopus 로고
    • Cofi rank - Maximum margin matrix factorization for collaborative ranking
    • J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors MIT Press, Cambridge, MA
    • M. Weimer, A. Karatzoglou, Q. Le, and A. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20. MIT Press, Cambridge, MA, 2008.
    • (2008) Advances in Neural Information Processing Systems , vol.20
    • Weimer, M.1    Karatzoglou, A.2    Le, Q.3    Smola, A.4
  • 21
    • 1942484421 scopus 로고    scopus 로고
    • Online convex programming and generalised infinitesimal gradient ascent
    • M. Zinkevich. Online convex programming and generalised infinitesimal gradient ascent. In Proc. Intl. Conf. Machine Learning, pages 928-936, 2003.
    • (2003) Proc. Intl. Conf. Machine Learning , pp. 928-936
    • Zinkevich, M.1


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