{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:07:55Z","timestamp":1725732475204},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40994-3_2","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T13:07:10Z","timestamp":1377695230000},"page":"17-32","source":"Crossref","is-referenced-by-count":10,"title":["Parallel Boosting with Momentum"],"prefix":"10.1007","author":[{"given":"Indraneel","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Canini","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Frongillo","sequence":"additional","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A. Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal of Imaging Sciences\u00a02, 183\u2013202 (2009)","journal-title":"SIAM Journal of Imaging Sciences"},{"issue":"2\/3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"47","author":"M. Collins","year":"2002","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, AdaBoost and Bregman distances. Machine Learning\u00a047(2\/3), 253\u2013285 (2002)","journal-title":"Machine Learning"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley (1991)","DOI":"10.1002\/0471200611"},{"key":"2_CR4","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 2121\u20132159 (2011)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Duchi, J., Singer, Y.: Boosting with structural sparsity. In: Proceedings of the 26th International Conference on Machine Learning (2009)","DOI":"10.1145\/1553374.1553412"},{"key":"2_CR6","unstructured":"McMahan, H.B., Streeter, M.: Adaptive bound optimization for online convex optimization. In: Proceedings of the Twenty Third Annual Conference on Computational Learning Theory (2010)"},{"key":"2_CR7","unstructured":"Nemirovski, A., Yudin, D.: Problem complexity and method efficiency in optimization. John Wiley and Sons (1983)"},{"issue":"2","key":"2_CR8","first-page":"372","volume":"27","author":"Y. Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate o(1\/k 2). Soviet Mathematics Doklady\u00a027(2), 372\u2013376 (1983)","journal-title":"Soviet Mathematics Doklady"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y. Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of nonsmooth functions. Mathematical Programming\u00a0103, 127\u2013152 (2005)","journal-title":"Mathematical Programming"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Mathematical Programming\u00a0120(1), 221\u2013259 (2009)","journal-title":"Mathematical Programming"},{"key":"2_CR12","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Salton, G., Buckley, C.: Term weighting approaches in automatic text retrieval. Information Processing and Management\u00a024(5) (1988)","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"2_CR14","unstructured":"Shalev-Shwartz, S., Singer, Y.: On the equivalence of weak learnability and linear separability: new relaxations and efficient algorithms. In: Proceedings of the Twenty First Annual Conference on Computational Learning Theory (2008)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Svore, K., Burges, C.: Large-scale learning to rank using boosted decision trees. In: Bekkerman, R., Bilenko, M., Langford, J. (eds.) Scaling Up Machine Learning. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139042918.009"},{"key":"2_CR16","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM Journal on Optimization (2008)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P. Tseng","year":"2007","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Mathematical Programming Series B\u00a0117, 387\u2013423 (2007)","journal-title":"Mathematical Programming Series B"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40994-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T04:40:43Z","timestamp":1688445643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40994-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40994-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}