{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:03Z","timestamp":1725471303347},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_48","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T10:49:15Z","timestamp":1159440555000},"page":"653-654","source":"Crossref","is-referenced-by-count":1,"title":["Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints"],"prefix":"10.1007","author":[{"given":"Manfred K.","family":"Warmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","first-page":"423","volume-title":"Advances in Neural Information Processing Systems 14","author":"R. Khardon","year":"2001","unstructured":"Khardon, R., Roth, D., Servedio, R.: Efficiency versus convergence of Boolean kernels for on-line learning algorithms. In: Advances in Neural Information Processing Systems 14, pp. 423\u2013430. MIT Press, Cambridge (2001)"},{"issue":"1","key":"48_CR2","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":"48_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0004-3702(97)00039-8","volume":"97","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K., Auer, P.: The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence\u00a097, 325\u2013343 (1997)","journal-title":"Artificial Intelligence"},{"key":"48_CR4","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning\u00a02, 285\u2013318 (1988)","journal-title":"Machine Learning"},{"key":"48_CR5","volume-title":"Advances in Neural Information Processing Systems 17","author":"P.M. Long","year":"2004","unstructured":"Long, P.M., Wu, X.: Mistake bounds for maximum entropy discrimination. In: Advances in Neural Information Processing Systems, vol.\u00a017, MIT Press, Cambridge (December 2004)"},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","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, vol.\u00a03559, pp. 366\u2013381. Springer, Heidelberg (2005); A longer journal version is in preperation"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:36Z","timestamp":1619493336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11776420_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}