{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:41:30Z","timestamp":1755999690468},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_23","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T08:58:37Z","timestamp":1283245117000},"page":"270-284","source":"Crossref","is-referenced-by-count":4,"title":["A Regularization Approach to Metrical Task Systems"],"prefix":"10.1007","author":[{"given":"Jacob","family":"Abernethy","sequence":"first","affiliation":[]},{"given":"Peter L.","family":"Bartlett","sequence":"additional","affiliation":[]},{"given":"Niv","family":"Buchbinder","sequence":"additional","affiliation":[]},{"given":"Isabelle","family":"Stanton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.: An optimal on-line algorithm for metrical task system. JACM: Journal of the ACM\u00a039(4), 745\u2013763 (1992)","journal-title":"JACM: Journal of the ACM"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"Manasse, M., McGeoch, L., Sleator, D.: Competitive algorithms for server problems. J. Algorithms\u00a011(2), 208\u2013230 (1990)","journal-title":"J. Algorithms"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Freund, S.: A decision-theoretic generalization of on-line learning and an application to boosting. JCSS: Journal of Computer and System Sciences\u00a055 (1997)","DOI":"10.1006\/jcss.1997.1504"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Schafer, G., Sivadasan, N.: Topology matters: Smoothed competitiveness of metrical task systems. TCS: Theoretical Computer Science\u00a0341 (2005)","DOI":"10.1016\/j.tcs.2005.04.006"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Irani, S., Seiden, S.: Randomized algorithms for metrical task systems. Theoretical Computer Science\u00a0194 (1998)","DOI":"10.1016\/S0304-3975(97)00006-6"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Blum, A., Burch, C., Tomkins, A.: A polylog( n )-competitive algorithm for metrical task systems. In: Symposium on Theory Of Computing (STOC), pp. 711\u2013719 (1997)","DOI":"10.1145\/258533.258667"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Symposium Theory Of Computing (STOC), pp. 161\u2013168 (1998)","DOI":"10.1145\/276698.276725"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of computing (STOC), pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Fiat, A., Mendel, M.: Better algorithms for unfair metrical task systems and applications. SIAM Journal on Computing\u00a032 (2003)","DOI":"10.1137\/S0097539700376159"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Naor, S.: Metrical task systems and the k-server problem on hsts (2009) (manuscript)","DOI":"10.1007\/978-3-642-14165-2_25"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Bollob\u00e1s, B., Mendel, M.: A ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 396\u2013405 (2001)","DOI":"10.1109\/SFCS.2001.959914"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1137\/S0097539799351882","volume":"30","author":"A. Blum","year":"2000","unstructured":"Blum, A., Karloff, H., Rabani, Y., Saks, M.: A decomposition theorem and lower bounds for randomized server problems. SIAM Journal on Computing\u00a030, 1624\u20131661 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. In: IEEE Symposium on Foundations of Computer Science, FOCS (2007)","DOI":"10.1109\/FOCS.2007.43"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Bein, W., Larmore, L., Noga, J.: Uniform metrical task systems with a limited number of states. IPL: Information Processing Letters\u00a0104 (2007)","DOI":"10.1016\/j.ipl.2007.06.001"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Naor, S.: Towards the randomized k-server conjecture: A primal-dual approach. In: ACM-SIAM Symposium on Discrete Algorithms, SODA (2010)","DOI":"10.1137\/1.9781611973075.5"},{"issue":"2-3","key":"23_CR16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1561\/0400000024","volume":"3","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, S.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science\u00a03(2-3), 93\u2013263 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1007621832648","volume":"39","author":"A. Blum","year":"2000","unstructured":"Blum, A., Burch, C.: On-line learning and the metrical task system problem. Machine Learning\u00a039(1), 35\u201358 (2000)","journal-title":"Machine Learning"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning\u00a032, 151 (1998)","journal-title":"Machine Learning"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Kivinen, J., Warmuth, M.: Exponentiated gradient versus gradient descent for linear predictors. Information and Computation (1997)","DOI":"10.1006\/inco.1996.2612"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/307400.307410","volume-title":"Proceedings of the Twelfth Annual Conference on Computational Learning Theory","author":"G. Gordon","year":"1999","unstructured":"Gordon, G.: Regret bounds for prediction problems. In: Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pp. 29\u201340. ACM, New York (1999)"},{"key":"23_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, New York (2006)"},{"key":"23_CR22","unstructured":"Rakhlin, A.: Lecture Notes on Online Learning DRAFT (2009)"},{"issue":"3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0034-4877(71)90002-4","volume":"2","author":"S. Guiau","year":"1971","unstructured":"Guiau, S.: Weighted entropy. Reports on Mathematical Physics\u00a02(3), 165\u2013179 (1971)","journal-title":"Reports on Mathematical Physics"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:23:50Z","timestamp":1558286630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}