{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:45:10Z","timestamp":1753886710422,"version":"3.41.2"},"reference-count":24,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T00:00:00Z","timestamp":1342224000000},"content-version":"vor","delay-in-days":195,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11001092","2011QC022","2011PY130"],"award-info":[{"award-number":["11001092","2011QC022","2011PY130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["11001092","2011QC022","2011PY130"],"award-info":[{"award-number":["11001092","2011QC022","2011PY130"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["11001092","2011QC022","2011PY130"],"award-info":[{"award-number":["11001092","2011QC022","2011PY130"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>We introduce a gradient descent algorithm for bipartite ranking with general convex losses. The implementation of this algorithm is simple, and its generalization performance is investigated. Explicit learning rates are presented in terms of the suitable choices of the regularization parameter and the step size. The result fills the theoretical gap in learning rates for ranking problem with general convex losses.<\/jats:p>","DOI":"10.1155\/2012\/189753","type":"journal-article","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T21:00:24Z","timestamp":1342299624000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking"],"prefix":"10.1155","volume":"2012","author":[{"given":"Hong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Fangchao","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhibin","family":"Pan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,7,14]]},"reference":[{"key":"e_1_2_5_1_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1950-0051437-7"},{"key":"e_1_2_5_2_2","doi-asserted-by":"crossref","unstructured":"AgarwalS.andNiyogiP. Stability and generalization of bipartite ranking algorithms In COLT 2005.","DOI":"10.1007\/11503415_3"},{"key":"e_1_2_5_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0160-z"},{"key":"e_1_2_5_4_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219530509001293"},{"key":"e_1_2_5_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883632"},{"key":"e_1_2_5_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2008.04.022"},{"key":"e_1_2_5_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2008.12.002"},{"key":"e_1_2_5_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2007.10.044"},{"key":"e_1_2_5_9_2","doi-asserted-by":"crossref","unstructured":"BurgesC. ShakedT. RenshawE. LazierA. DeedsM. HamiltonN. andHullenderG. Learning to rank using gradient descent Proceedings of the 22nd international conference on Machine learning 2005.","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_5_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70776"},{"key":"e_1_2_5_11_2","unstructured":"ChenH. TangY. LiL. Q. andLiX. Ranking by a gradient descent algorithm manuscript."},{"key":"e_1_2_5_12_2","doi-asserted-by":"publisher","DOI":"10.1162\/1532443041827916"},{"key":"e_1_2_5_13_2","first-page":"393","article-title":"Generalization bounds for the area under the ROC curve","volume":"6","author":"Agarwal S.","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_14_2","doi-asserted-by":"publisher","DOI":"10.1214\/009052607000000910"},{"key":"e_1_2_5_15_2","first-page":"2193","article-title":"Margin-based ranking and an equivalence between AdaBoost and RankBoost","volume":"10","author":"Rudin C.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_16_2","first-page":"2233","article-title":"The P-norm push: a simple convex ranking algorithm that concentrates at the top of the list","volume":"10","author":"Rudin C.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_17_2","first-page":"441","article-title":"Generalization bounds for ranking algorithms via algorithmic stability","volume":"10","author":"Agarwal S.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929939"},{"key":"e_1_2_5_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.03.001"},{"key":"e_1_2_5_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-006-0659-y"},{"key":"e_1_2_5_21_2","first-page":"2481","article-title":"Estimation of gradients and coordinate covariation in classification","volume":"7","author":"Mukherjee S.","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_22_2","first-page":"519","article-title":"Learning coordinate covariances via gradients","volume":"7","author":"Mukherjee S.","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_5_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2010.03.020"},{"key":"e_1_2_5_24_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107359949.008"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/189753.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2012\/189753.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/189753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T07:06:51Z","timestamp":1718089611000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/189753"}},"subtitle":[],"editor":[{"given":"Yuesheng","family":"Xu","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/189753"],"URL":"https:\/\/doi.org\/10.1155\/2012\/189753","archive":["Portico"],"relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2012-03-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-05-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"189753"}}