{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:58:54Z","timestamp":1768708734215,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273555","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"465-472","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Online kernel PCA with entropic matrix updates"],"prefix":"10.1145","author":[{"given":"Dima","family":"Kuzmin","sequence":"first","affiliation":[{"name":"University of California - Santa Cruz"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[{"name":"University of California - Santa Cruz"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"e_1_3_2_1_2_1","first-page":"363","article-title":"Tracking a small set of experts by mixing past posteriors","volume":"3","author":"Bousquet O.","year":"2002","unstructured":"Bousquet , O. , & Warmuth , M. K. ( 2002 ). Tracking a small set of experts by mixing past posteriors . Journal of Machine Learning Research , 3 , 363 -- 396 . Bousquet, O., & Warmuth, M. K. (2002). Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research, 3, 363--396.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"Boyd S.","year":"2004","unstructured":"Boyd , S. , & Vandenberghe , L. ( 2004 ). Convex optimization . Cambridge University Press . Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753683726"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"e_1_3_2_1_7_1","volume-title":"4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29--31, 1999, Proceedings (pp. 153--167)","author":"Kivinen J.","year":"1999","unstructured":"Kivinen , J. , & Warmuth , M. K. ( 1999 ). Averaging expert predictions. Computational Learning Theory , 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29--31, 1999, Proceedings (pp. 153--167) . Springer. Kivinen, J., & Warmuth, M. K. (1999). Averaging expert predictions. Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29--31, 1999, Proceedings (pp. 153--167). Springer."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017467"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964295"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088706"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_38"},{"key":"e_1_3_2_1_12_1","volume-title":"Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. Advances in Neural Information Processing Systems 19 (NIPS 06)","author":"Warmuth M. K.","year":"2006","unstructured":"Warmuth , M. K. , & Kuzmin , D. ( 2006 b). Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. Advances in Neural Information Processing Systems 19 (NIPS 06) . MIT Press . Warmuth, M. K., & Kuzmin, D. (2006b). Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. Advances in Neural Information Processing Systems 19 (NIPS 06). MIT Press."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_25"}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07","sponsor":["Machine Learning Journal"]},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273555","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:01Z","timestamp":1750258681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":13,"alternative-id":["10.1145\/1273496.1273555","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273555","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}