{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:50:21Z","timestamp":1773280221424,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729259","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_34","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"469-483","source":"Crossref","is-referenced-by-count":6,"title":["Learning Permutations with Exponential Weights"],"prefix":"10.1007","author":[{"given":"David P.","family":"Helmbold","sequence":"first","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing\u00a032(1), 48\u201377 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-003-1015-8","volume":"36","author":"A. Blum","year":"2003","unstructured":"Blum, A., Chawla, S., Kalai, A.: Static optimality and dynamic search-optimality in lists and trees. Algorithmica\u00a036, 249\u2013260 (2003)","journal-title":"Algorithmica"},{"key":"34_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, Heidelberg (1997)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Balakrishnan, H., Hwang, I., Tomlin, C.: Polynomial approximation algorithms for belief matrix maintenance in identity management. In: 43rd IEEE Conference on Decision and Control, pp. 4874\u20134879 (December 2004)","DOI":"10.1109\/CDC.2004.1429569"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1162\/153244303321897654","volume":"3","author":"O. Bousquet","year":"2002","unstructured":"Bousquet, O., Warmuth, M.K.: Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research\u00a03, 363\u2013396 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"34_CR6","doi-asserted-by":"crossref","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, Cambridge (2006)"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y. Censor","year":"1981","unstructured":"Censor, Y., Lent, A.: An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications\u00a034(3), 321\u2013353 (1981)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0024-3795(89)90490-4","volume":"114","author":"J. Franklin","year":"1989","unstructured":"Franklin, J., Lorenz, J.: On the scaling of multidimensional matrices. Linear Algebra and its applications, 114\/115, 717\u2013735 (1989)","journal-title":"Linear Algebra and its applications"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR10","unstructured":"Martin Furer. Quadratic convergence for scaling of matrices. In: Proceedings of ALENEX\/ANALCO, pp. 216\u2013223. SIAM (2004)"},{"issue":"01","key":"34_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"D.P. Helmbold","year":"1997","unstructured":"Helmbold, D.P., Schapire, R.E.: Predicting nearly as well as the best pruning of a decision tree. Machine Learning\u00a027(01), 51\u201368 (1997)","journal-title":"Machine Learning"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1162\/153244301753683726","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":"34_CR13","unstructured":"Kalai, A.: Simulating weighted majority with FPL. Private communication (2005)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0024-3795(94)00188-X","volume":"240","author":"B. Kalantari","year":"1996","unstructured":"Kalantari, B., Khachiyan, L.: On the complexity of nonnegative-matrix scaling. Linear Algebra and its applications\u00a0240, 87\u2013103 (1996)","journal-title":"Linear Algebra and its applications"},{"issue":"3","key":"34_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2003","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems (Special issue Learning Theory 2003). J. Comput. Syst. Sci.\u00a071(3), 291\u2013307 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"34_CR16","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.: Additive versus exponentiated gradient updates for linear prediction. Information and Computation\u00a0132(1), 1\u201364 (1997)","journal-title":"Information and Computation"},{"key":"34_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-49097-3_13","volume-title":"Computational Learning Theory","author":"J. Kivinen","year":"1999","unstructured":"Kivinen, J., Warmuth, M.K.: Averaging expert predictions. In: Fischer, P., Simon, H.U. (eds.) EuroCOLT 1999. LNCS (LNAI), vol.\u00a01572, pp. 153\u2013167. Springer, Heidelberg (1999)"},{"key":"34_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1007\/11503415_46","volume-title":"Learning Theory","author":"D. Kuzmin","year":"2005","unstructured":"Kuzmin, D., Warmuth, M.K.: Optimum follow the leader algorithm (Open problem). In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol.\u00a03559, pp. 684\u2013686. Springer, Heidelberg (2005)"},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N. Linial","year":"2000","unstructured":"Linial, N., Samorodnitsky, A., Wigderson, A.: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica\u00a020(4), 545\u2013568 (2000)","journal-title":"Combinatorica"},{"issue":"2","key":"34_CR20","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inform. Comput.\u00a0108(2), 212\u2013261 (1994)","journal-title":"Inform. Comput."},{"issue":"1","key":"34_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021840411064","volume":"51","author":"D. McAllester","year":"2003","unstructured":"McAllester, D.: PAC-Bayesian stochastic model selection. Machine Learning\u00a051(1), 5\u201321 (2003)","journal-title":"Machine Learning"},{"issue":"2","key":"34_CR22","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R. Sinkhorn","year":"1964","unstructured":"Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. The. Annals of Mathematical Staticstics\u00a035(2), 876\u2013879 (1964)","journal-title":"The Annals of Mathematical Staticstics"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1162\/1532443041424328","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"34_CR24","volume-title":"Advances in Neural Information Processing Systems 19 (NIPS 06)","author":"M.K. Warmuth","year":"2006","unstructured":"Warmuth, M.K., Kuzmin, D.: Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. In: Advances in Neural Information Processing Systems 19 (NIPS 06), MIT Press, Cambridge (2006)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:06Z","timestamp":1605762486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_34","relation":{},"subject":[]}}