{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:13Z","timestamp":1725750313385},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_8","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T05:14:50Z","timestamp":1380258890000},"page":"98-112","source":"Crossref","is-referenced-by-count":2,"title":["Online PCA with Optimal Regrets"],"prefix":"10.1007","author":[{"given":"Jiazhong","family":"Nie","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Kot\u0142owski","sequence":"additional","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Abernethy, J., Agarwal, A., Bartlett, P.L., Rakhlin, A.: A stochastic view of optimal regret through minimax duality. In: COLT (2009)","key":"8_CR1"},{"unstructured":"Abernethy, J., Warmuth, M.K., Yellin, J.: When random play is optimal against an adversary. In: COLT, pp. 437\u2013446 (2008)","key":"8_CR2"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K.S. Azoury","year":"2001","unstructured":"Azoury, K.S., Warmuth, M.K.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043(3), 211\u2013246 (2001)","journal-title":"Machine Learning"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D.P., Schapire, R.E., Warmuth, M.K.: How to use expert advice. J. ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"J. ACM"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/72.501719","volume":"7","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-Bianchi, N., Long, P.M., Warmuth, M.K.: Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Trans. Neural Netw. Learning Syst.\u00a07(3), 604\u2013619 (1996)","journal-title":"IEEE Trans. Neural Netw. Learning Syst."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/72.501719","volume":"7","author":"N. Cesa-Bianchi","year":"1996","unstructured":"Cesa-Bianchi, N., Long, P.M., Warmuth, M.K.: Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Trans. Neural Netw. Learning Syst.\u00a07(3), 604\u2013619 (1996)","journal-title":"IEEE Trans. Neural Netw. Learning Syst."},{"doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press (2006)","key":"8_CR7","DOI":"10.1017\/CBO9780511546921"},{"key":"8_CR8","first-page":"1705","volume":"10","author":"D.P. Helmbold","year":"2009","unstructured":"Helmbold, D.P., Warmuth, M.K.: Learning permutations with exponential weights. Journal of Machine Learning Research\u00a010, 1705\u20131736 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"8_CR9","first-page":"281","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. Journal of Machine Learning Research\u00a01, 281\u2013309 (2001)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A.T. Kalai","year":"2005","unstructured":"Kalai, A.T., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci.\u00a071(3), 291\u2013307 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K.: Exponentiated gradient versus gradient descent for linear predictors. Inf. Comput.\u00a0132(1), 1\u201363 (1997)","journal-title":"Inf. Comput."},{"unstructured":"Koolen, W.M., Warmuth, M.K., Kivinen, J.: Hedging structured concepts. In: COLT, pp. 93\u2013105 (2010)","key":"8_CR12"},{"doi-asserted-by":"crossref","unstructured":"Kuzmin, D., Warmuth, M.K.: Online kernel PCA with entropic matrix updates. In: ICML, pp. 465\u2013472 (2007)","key":"8_CR13","DOI":"10.1145\/1273496.1273555"},{"unstructured":"Srebro, N., Sridharan, K., Tewari, A.: On the universality of online mirror descent. In: NIPS, pp. 2645\u20132653 (2011)","key":"8_CR14"},{"unstructured":"Sridharan, K., Tewari, A.: Convex games in banach spaces. In: Proceedings of the 23nd Annual Conference on Learning Theory (COLT) (2010)","key":"8_CR15"},{"key":"8_CR16","first-page":"995","volume":"6","author":"K. Tsuda","year":"2005","unstructured":"Tsuda, K., R\u00e4tsch, G., Warmuth, M.K.: Matrix exponentiated gradient updates for on-line learning and Bregman projections. Journal of Machine Learning Research\u00a06, 995\u20131018 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"8_CR17","first-page":"2287","volume":"9","author":"M.K. Warmuth","year":"2008","unstructured":"Warmuth, M.K., Kuzmin, D.: Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research\u00a09, 2287\u20132320 (2008)","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"crossref","unstructured":"Warmuth, M.K., Liao, J., R\u00e4tsch, G.: Totally corrective boosting algorithms that maximize the margin. In: ICML, pp. 1001\u20131008 (2006)","key":"8_CR18","DOI":"10.1145\/1143844.1143970"},{"key":"8_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/11503415_25","volume-title":"Learning Theory","author":"M.K. Warmuth","year":"2005","unstructured":"Warmuth, M.K., Vishwanathan, S.V.N.: Leaving the span. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 366\u2013381. Springer, Heidelberg (2005)"},{"unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Fawcett, T., Mishra, N. (eds.) ICML, pp. 928\u2013936. AAAI Press (2003)","key":"8_CR20"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:08:32Z","timestamp":1558105712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}