{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:10:16Z","timestamp":1772284216585,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T00:00:00Z","timestamp":1471305600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee (HK)","doi-asserted-by":"crossref","award":["N CityU120\/14"],"award-info":[{"award-number":["N CityU120\/14"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11461161006"],"award-info":[{"award-number":["11461161006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10444-016-9479-7","type":"journal-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T22:30:01Z","timestamp":1471300201000},"page":"127-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Online regularized learning with pairwise loss functions"],"prefix":"10.1007","volume":"43","author":[{"given":"Zheng-Chu","family":"Guo","sequence":"first","affiliation":[]},{"given":"Yiming","family":"Ying","sequence":"additional","affiliation":[]},{"given":"Ding-Xuan","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,16]]},"reference":[{"key":"9479_CR1","first-page":"441","volume":"10","author":"S Agarwal","year":"2009","unstructured":"Agarwal, S., Niyogi, P.: Generalization bounds for ranking algorithms via algorithmic stability. J. Mach. Learn. Res. 10, 441\u2013474 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1090\/S0002-9947-1950-0051437-7","volume":"68","author":"N Aronszajn","year":"1950","unstructured":"Aronszajn, N.: Theory of reproducing kernels. Trans. Am. Math. Soc. 68, 337\u2013404 (1950)","journal-title":"Trans. Am. Math. Soc."},{"key":"9479_CR3","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1214\/009053605000000282","volume":"33","author":"PL Bartlett","year":"2005","unstructured":"Bartlett, P.L., Bousquet, O., Mendelson, S.: Local Rademacher complexities. Ann. Stat. 33, 1497\u20131537 (2005)","journal-title":"Ann. Stat."},{"key":"9479_CR4","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463\u2013482 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR5","unstructured":"Bellet, A., Habrard, A., Sebban, M.: Similarity learning for provably accurate sparse linear classification. ICML (2012)"},{"issue":"1","key":"9479_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10994-015-5499-7","volume":"102","author":"Q Cao","year":"2016","unstructured":"Cao, Q., Guo, Z.C., Ying, Y.: Generalization bounds for metric and similarity learning. Machine Learning Journal 102(1), 115\u2013132 (2016)","journal-title":"Machine Learning Journal"},{"issue":"1","key":"9479_CR7","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TIT.2007.911292","volume":"54","author":"C Cesa-Bianchi","year":"2008","unstructured":"Cesa-Bianchi, C., Gentile, C.: Improved risk tail bounds for online algorithms. IEEE Trans. Inf. Theory 54(1), 286\u2013390 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9479_CR8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.neucom.2013.11.032","volume":"133","author":"H Chen","year":"2014","unstructured":"Chen, H., Pan, Z., Li, L.: Learning performance of coefficient-based regularized ranking. Neurocomputing 133, 54\u201362 (2014)","journal-title":"Neurocomputing"},{"key":"9479_CR9","first-page":"1109","volume":"11","author":"G Chechik","year":"2010","unstructured":"Chechik, G., Sharma, V., Shalit, U., Bengio, S.: Large scale online learning of image similarity through ranking. J. Mach. Learn. Res. 11, 1109\u20131135 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR10","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1214\/009052607000000910","volume":"36","author":"S Cl\u00e9mencon","year":"2008","unstructured":"Cl\u00e9mencon, S., Lugosi, G., Vayatis, N.: Ranking and empirical minimization of U-statistics. Ann. of Stat. 36, 844\u2013874 (2008)","journal-title":"Ann. of Stat."},{"key":"9479_CR11","doi-asserted-by":"crossref","unstructured":"Cucker, F., Zhou, D.-X.: Learning Theory: An Approximation Theory Viewpoint. Cambridge Univesity Press (2007)","DOI":"10.1017\/CBO9780511618796"},{"key":"9479_CR12","doi-asserted-by":"crossref","unstructured":"Davis, J., Kulis, B., Jain, P., Sra, S., Dhillon, I.: Information-theoretic metric learning. In: Proceedings of the 24th International Conference on Machine Learning (ICML) (2007)","DOI":"10.1145\/1273496.1273523"},{"key":"9479_CR13","doi-asserted-by":"publisher","unstructured":"Fan, J., Hu, T., Wu, Q., Zhou, D. X.: Consistency analysis of an empirical minimum error entropy algorithm, Applied and Computational Harmonic Analysis 41(1), 161\u2013189 (2016). doi: 10.1016\/j.acha.2014.12.005","DOI":"10.1016\/j.acha.2014.12.005"},{"key":"9479_CR14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1162\/NECO_a_00556","volume":"26","author":"ZC Guo","year":"2014","unstructured":"Guo, Z. C., Ying, Y.: Guaranteed classification via regularized similarity learning. Neural Comput. 26, 497\u2013522 (2014)","journal-title":"Neural Comput."},{"key":"9479_CR15","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1142\/S0219530514500110","volume":"13","author":"T Hu","year":"2015","unstructured":"Hu, T., Fan, J., Wu, Q., Zhou, D.X.: Regularization schemes for minimum error entropy principle. Anal. Appl. 13, 437\u2013455 (2015)","journal-title":"Anal. Appl."},{"key":"9479_CR16","unstructured":"Kar, P., Sriperumbudur, B., Jain, P., Karnick, H.: On the generalization ability of online learning algorithms for pairwise loss functions. In: Proceedings of the 30th International Conference on Machine Learning (ICML) (2013)"},{"key":"9479_CR17","unstructured":"Jin, R., Wang, S., Zhou, Y.: Regularized distance metric learning: theory and algorithm. In: Advances in Neural Information Processing Systems (NIPS) (2009)"},{"key":"9479_CR18","doi-asserted-by":"crossref","unstructured":"Ledoux, M., Talagrand, M.: Probability in Banach Spaces: isoperimetry and processes. Springer (1991)","DOI":"10.1007\/978-3-642-20212-4"},{"key":"9479_CR19","first-page":"148","volume-title":"Surveys in Combinatorics, Chapter on the methods of bounded differences","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: Surveys in Combinatorics, Chapter on the methods of bounded differences, pp 148\u2013188. Cambridge University Press, Cambridge (UK) (1989)"},{"key":"9479_CR20","first-page":"839","volume":"4","author":"R Meir","year":"2003","unstructured":"Meir, R., Zhang, T.: Generalization error bounds for Bayesian mixture algorithms. J. Mach. Learn. Res. 4, 839\u2013860 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR21","first-page":"2481","volume":"7","author":"S Mukherjee","year":"2006","unstructured":"Mukherjee, S., Wu, Q.: Estimation of gradients and coordinate covariation in classification. J. Mach. Learn. Res. 7, 2481\u20132514 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR22","first-page":"519","volume":"7","author":"S Mukherjee","year":"2006","unstructured":"Mukherjee, S., Zhou, D. X.: Learning coordinate covariances via gradients. J. Mach. Learn. Res. 7, 519\u2013549 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR23","doi-asserted-by":"crossref","first-page":"1679","DOI":"10.1214\/aop\/1176988477","volume":"22","author":"I Pinelis","year":"1994","unstructured":"Pinelis, I.: Optimum bounds for the distributions of martingales in banach spaces. Ann. Prob. 22, 1679\u20131706 (1994)","journal-title":"Ann. Prob."},{"key":"9479_CR24","unstructured":"Rakhlin, A., Shamir, O., Sridharan, K.: Making gradient descent optimal for strongly convex stochastic optimization. In: Proceedings of the 29th International Conference on Machine Learning (ICML) (2012)"},{"key":"9479_CR25","first-page":"1373","volume":"13","author":"W Rejchel","year":"2012","unstructured":"Rejchel, W.: On ranking and generalization bounds. J. Mach. Learn. Res. 13, 1373\u20131392 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR26","unstructured":"Shamir, O., Zhang, T.: Stochastic gradient descent for non-smooth optimization: convergence results and optimal averaging schemes. In: Proceedings of the 30th International Conference on Machine Learning (ICML) (2013)"},{"key":"9479_CR27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10208-004-0160-z","volume":"6","author":"S Smale","year":"2006","unstructured":"Smale, S., Yao, Y.: Online learning algorithms. Found. Comput. Math. 6, 145\u2013170 (2006)","journal-title":"Found. Comput. Math."},{"key":"9479_CR28","unstructured":"Sridharan, K., Srebro, N., Shalev-Shwartz, S.: Fast rates for regularized objectives Advances in Neural Information Processing Systems (NIPS) (2008)"},{"key":"9479_CR29","volume-title":"Support Vector Machines","author":"I Steinwart","year":"2008","unstructured":"Steinwart, I., Christmann, A.: Support Vector Machines. Springer-Verlag, New York (2008)"},{"key":"9479_CR30","unstructured":"Weinberger, K. Q., Blitzer, J., Saul, L.: Distance metric learning for large margin nearest neighbour classification. In: Advances in Neural Information Processing Systems (NIPS) (2005)"},{"issue":"1","key":"9479_CR31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J. S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"9479_CR32","unstructured":"Wang, Y., Khardon, R., Pechyony, D., Jones, R.: Generalization bounds for online learning algorithms with pairwise loss functions. COLT (2012)"},{"key":"9479_CR33","unstructured":"Wang, Y., Khardon, R., Pechyony, D., Jones, R.: Online learning with pairwise loss functions. ArXiv Preprint (2013). arXiv: 1301.5332"},{"issue":"2","key":"9479_CR34","first-page":"99","volume":"8","author":"Q Wu","year":"2006","unstructured":"Wu, Q., Zhou, D.X.: Analysis of support vector machine classification. J. Comput. Anal. Appl. 8(2), 99\u2013119 (2006)","journal-title":"J. Comput. Anal. Appl."},{"key":"9479_CR35","first-page":"1","volume":"13","author":"Y Ying","year":"2012","unstructured":"Ying, Y., Li, P.: Distance metric learning with eigenvalue optimization. J. Mach. Learn. Res. 13, 1\u201326 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9479_CR36","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10208-006-0237-y","volume":"5","author":"Y Ying","year":"2008","unstructured":"Ying, Y., Pontil, M.: Online gradient descent algorithms. Found. Comput. Math. 5, 561\u2013596 (2008)","journal-title":"Found. Comput. Math."},{"key":"9479_CR37","doi-asserted-by":"crossref","first-page":"4775","DOI":"10.1109\/TIT.2006.883632","volume":"11","author":"Y Ying","year":"2006","unstructured":"Ying, Y., Zhou, D.X.: Online regularized classification algorithms. IEEE Trans. Inf. Theory 11, 4775\u20134788 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9479_CR38","unstructured":"Zhao, P., Hoi, S.C.H., Jin, R., Yang, T.: Online AUC Maximization. In: Proceedings of the 28th International Conference on Machine Learning (ICML) (2011)"},{"key":"9479_CR39","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T Zhang","year":"2004","unstructured":"Zhang, T.: Statistical behavior and consistency of classification methods based on convex risk minimization. Ann. of Stat. 32, 56\u201385 (2004)","journal-title":"Ann. of Stat."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-016-9479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-016-9479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-016-9479-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-016-9479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T03:25:35Z","timestamp":1589685935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-016-9479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,16]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9479"],"URL":"https:\/\/doi.org\/10.1007\/s10444-016-9479-7","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,16]]}}}