{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T11:17:52Z","timestamp":1772882272425,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,7,11]],"date-time":"2007-07-11T00:00:00Z","timestamp":1184112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2007,10,11]]},"DOI":"10.1007\/s10994-007-5014-x","type":"journal-article","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T00:43:18Z","timestamp":1184632998000},"page":"115-142","source":"Crossref","is-referenced-by-count":59,"title":["A primal-dual perspective of online learning algorithms"],"prefix":"10.1007","volume":"69","author":[{"given":"Shai","family":"Shalev-Shwartz","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,11]]},"reference":[{"issue":"3","key":"5014_CR1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. Azoury","year":"2001","unstructured":"Azoury, K., & Warmuth, M. (2001). Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3), 211\u2013246.","journal-title":"Machine Learning"},{"key":"5014_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"key":"5014_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L. M. Bregman","year":"1967","unstructured":"Bregman, L. M. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7, 200\u2013217.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"5014_CR4","volume-title":"Parallel optimization: theory, algorithms, and applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., & Zenios, S. A. (1997). Parallel optimization: theory, algorithms, and applications. New York: Oxford University Press."},{"key":"5014_CR5","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2002). On the generalization ability of on-line learning algorithms. In Advances in neural information processing systems (Vol. 14, pp.\u00a0359\u2013366).","DOI":"10.7551\/mitpress\/1120.003.0051"},{"issue":"3","key":"5014_CR6","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1137\/S0097539703432542","volume":"34","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005). A second-order perceptron algorithm. SIAM Journal on Computing, 34(3), 640\u2013668.","journal-title":"SIAM Journal on Computing"},{"key":"5014_CR7","unstructured":"Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., & Singer, Y. (2005). Online passive aggressive algorithms. Technical report, The Hebrew University."},{"key":"5014_CR8","unstructured":"Dekel, O., Shalev-Shwartz, S., & Singer, Y. (2005). The forgetron: a kernel-based perceptron on a fixed budget. In Advances in neural information processing systems (Vol. 18)."},{"key":"5014_CR9","first-page":"213","volume":"2","author":"C. Gentile","year":"2001","unstructured":"Gentile, C. (2001). A new approximate maximal margin classification algorithm. Journal of Machine Learning Research, 2, 213\u2013242.","journal-title":"Journal of Machine Learning Research"},{"key":"5014_CR10","unstructured":"Gentile, C. (2002). The robustness of the p-norm algorithms. Machine Learning, 53(3)."},{"issue":"3","key":"5014_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1010844028087","volume":"43","author":"A. J. Grove","year":"2001","unstructured":"Grove, A. J., Littlestone, N., & Schuurmans, D. (2001). General convergence results for linear discriminant updates. Machine Learning, 43(3), 173\u2013210.","journal-title":"Machine Learning"},{"key":"5014_CR12","first-page":"97","volume-title":"Contributions to the theory of games","author":"J. Hannan","year":"1957","unstructured":"Hannan, J. (1957). Approximation to Bayes risk in repeated play. In M. Dresher, A. W. Tucker, & P. Wolfe (Eds.), Contributions to the theory of games (Vol.\u00a0III, pp. 97\u2013139). Princeton: Princeton University Press."},{"issue":"6","key":"5014_CR13","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/72.809075","volume":"10","author":"D. P. Helmbold","year":"1999","unstructured":"Helmbold, D. P., Kivinen, J., & Warmuth, M. (1999). Relative loss bounds for single neurons. IEEE Transactions on Neural Networks, 10(6), 1291\u20131304.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"5014_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., & Warmuth, M. (1997). Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1), 1\u201364.","journal-title":"Information and Computation"},{"issue":"3","key":"5014_CR15","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J., & Warmuth, M. (2001). Relative loss bounds for multidimensional regression problems. Journal of Machine Learning, 45(3), 301\u2013329.","journal-title":"Journal of Machine Learning"},{"issue":"8","key":"5014_CR16","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1109\/TSP.2004.830991","volume":"52","author":"J. Kivinen","year":"2002","unstructured":"Kivinen, J., Smola, A. J., & Williamson, R. C. (2002). Online learning with kernels. IEEE Transactions on Signal Processing, 52(8), 2165\u20132176.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1\u20133","key":"5014_CR17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1023\/A:1012435301888","volume":"46","author":"Y. Li","year":"2002","unstructured":"Li, Y., & Long, P. M. (2002). The relaxed online maximum margin algorithm. Machine Learning, 46(1\u20133), 361\u2013387.","journal-title":"Machine Learning"},{"key":"5014_CR18","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2, 285\u2013318.","journal-title":"Machine Learning"},{"key":"5014_CR19","unstructured":"Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, U.C. Santa Cruz, March 1989."},{"key":"5014_CR20","unstructured":"Novikoff, A. B. J. (1962). On convergence proofs on perceptrons. In Proceedings of the symposium on the mathematical theory of automata (Vol. XII, pp.\u00a0615\u2013622)."},{"key":"5014_CR21","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R. T. Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton: Princeton University Press."},{"key":"5014_CR22","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F. Rosenblatt","year":"1958","unstructured":"Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65, 386\u2013407. (Reprinted in Neurocomputing, MIT Press, 1988.)","journal-title":"Psychological Review"},{"key":"5014_CR23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1111\/j.1751-5823.2001.tb00457.x","volume":"69","author":"V. Vovk","year":"2001","unstructured":"Vovk, V. (2001). Competitive on-line statistics. International Statistical Review, 69, 213\u2013248.","journal-title":"International Statistical Review"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5014-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-007-5014-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5014-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T20:21:19Z","timestamp":1708114879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-007-5014-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,11]]},"references-count":23,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,10,11]]}},"alternative-id":["5014"],"URL":"https:\/\/doi.org\/10.1007\/s10994-007-5014-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,11]]}}}