{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:25:15Z","timestamp":1744259115050,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_28","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:27Z","timestamp":1349070987000},"page":"350-364","source":"Crossref","is-referenced-by-count":0,"title":["Kernelization of Matrix Updates, When and How?"],"prefix":"10.1007","author":[{"given":"Manfred K.","family":"Warmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Kot\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuisheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","first-page":"803","volume":"10","author":"J. Abernethy","year":"2009","unstructured":"Abernethy, J., Bach, F., Evgeniou, T., Vert, J.P.: A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning\u00a010, 803\u2013826 (2009)","journal-title":"Journal of Machine Learning"},{"key":"28_CR2","first-page":"2507","volume":"10","author":"A. Argyriou","year":"2009","unstructured":"Argyriou, A., Micchelli, C.A., Pontil, M.: When is there a representer theorem? vector versus matrix regularizers. Journal of Machine Learning Research\u00a010, 2507\u20132529 (2009)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. Azoury","year":"2001","unstructured":"Azoury, K., Warmuth, M.K.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Journal of Machine Learning\u00a043(3), 211\u2013246 (2001)","journal-title":"Journal of Machine Learning"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/130385.130401","volume-title":"Proc. 5th Annual ACM Workshop on Comput. Learning Theory","author":"B.E. Boser","year":"1992","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proc. 5th Annual ACM Workshop on Comput. Learning Theory, pp. 144\u2013152. ACM Press, New York (1992)"},{"key":"28_CR5","unstructured":"Cavallanti, G., Cesa-Bianchi, N., Gentile, C.: Linear algorithms for online multitask classification. In: Proceedings of the 21st Annual Conference on Learning Theory (COLT 2008), pp. 251\u2013262 (July 2008)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-48321-7_22","volume-title":"Fundamentals of Computation Theory","author":"J. Forster","year":"1999","unstructured":"Forster, J.: On Relative Loss Bounds in Generalized Linear Regression. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 269\u2013280. Springer, Heidelberg (1999)"},{"key":"28_CR7","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"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0022-247X(71)90184-3","volume":"33","author":"G.S. Kimeldorf","year":"1971","unstructured":"Kimeldorf, G.S., Wahba, G.: Some results on Tchebycheffian spline functions. J.\u00a0Math.\u00a0Anal.\u00a0Applic.\u00a033, 82\u201395 (1971)","journal-title":"J.\u00a0Math.\u00a0Anal.\u00a0Applic."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Kuzmin, D., Warmuth, M.K.: Online Kernel PCA with entropic matrix updates. In: Proceedings of the 24th International Conference on Machine Learning (ICML 2007). ACM International Conference Proceedings Series, pp. 465\u2013471 (June 2007)","DOI":"10.1145\/1273496.1273555"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Mika, S., Ratsch, G., Weston, J., Sch\u00f6lkopf, B., Mullers, K.R.: Fisher discriminant analysis with kernels. In: Proc. NNSP 1999. IEEE Signal Processing Society Workshop, pp. 41\u201348 (1999)","DOI":"10.1109\/NNSP.1999.788121"},{"key":"28_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-44581-1_27","volume-title":"Computational Learning Theory","author":"B. Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., Smola, A.J.: A Generalized Representer Theorem. In: Helmbold, D.P., Williamson, B. (eds.) COLT\/EuroCOLT 2001. LNCS (LNAI), vol.\u00a02111, pp. 416\u2013426. Springer, Heidelberg (2001)"},{"issue":"5","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B. Sch\u00f6lkopf","year":"1998","unstructured":"Sch\u00f6lkopf, B., Smola, A.J., M\u00fcller, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation\u00a010(5), 1299\u20131319 (1998)","journal-title":"Neural Computation"},{"key":"28_CR13","unstructured":"Srebro, N., Sridharan, K., Tewari, A.: On the universality of online mirror descent. In: Advances in Neural Information Processing Systems 23 (NIPS 2011), pp. 2645\u20132653 (2011)"},{"key":"28_CR14","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":"28_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1111\/j.1751-5823.2001.tb00457.x","volume":"69","author":"V. Vovk","year":"2001","unstructured":"Vovk, V.: Competitive on-line statistics. International Statistical Review\u00a069, 213\u2013248 (2001)","journal-title":"International Statistical Review"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Warmuth, M.K.: Winnowing subspaces. In: Proceedings of the 24th International Conference on Machine Learning (ICML 2007), ACM Press (June 2007)","DOI":"10.1145\/1273496.1273622"},{"key":"28_CR17","first-page":"2217","volume":"9","author":"M.K. Warmuth","year":"2008","unstructured":"Warmuth, M.K., Kuzmin, D.: Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research\u00a09, 2217\u20132250 (2008)","journal-title":"Journal of Machine Learning Research"},{"key":"28_CR18","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); Journal version in progress"}],"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-34106-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T20:50:56Z","timestamp":1744231856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}