{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T16:19:29Z","timestamp":1791303569195,"version":"4.1.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T00:00:00Z","timestamp":1252540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T00:00:00Z","timestamp":1252540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10791-009-9110-3","type":"journal-article","created":{"date-parts":[[2009,9,8]],"date-time":"2009-09-08T23:05:52Z","timestamp":1252451152000},"page":"216-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":140,"title":["Gradient descent optimization of smoothed information retrieval metrics"],"prefix":"10.1007","volume":"13","author":[{"given":"Olivier","family":"Chapelle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingrui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"key":"9110_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1162\/153244303321897690","volume":"3","author":"P. Bartlett","year":"2003","unstructured":"Bartlett, P., & Mendelson, S. (2003). Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, 463\u2013482.","journal-title":"Journal of Machine Learning Research"},{"key":"9110_CR2","doi-asserted-by":"crossref","unstructured":"Bridle, J. (1990). Probabilistic interpretation of feedforward classification network outputs, with relationships to statistical pattern recognition. In F. F. Soulie & J. Herault (Eds.), Neurocomputing: Algorithms architectures and applications (pp. 227\u2013236). Berlin: Springer.","DOI":"10.1007\/978-3-642-76153-9_28"},{"key":"9110_CR3","doi-asserted-by":"crossref","unstructured":"Burges, C. J., Le, Q. V., & Ragno, R. (2007). Learning to rank with nonsmooth cost functions. In Sch\u00f6lkopf, J. Platt, & T. Hofmann (Eds.), Advances in neural information processing systems (Vol. 19).","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"9110_CR4","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., et\u00a0al. (2005). Learning to rank using gradient descent. In Proceedings of the international conference on machine learning.","DOI":"10.1145\/1102351.1102363"},{"key":"9110_CR5","doi-asserted-by":"crossref","unstructured":"Cao, Y., Xu, J., Liu, T. Y., Li, H,. Huang, Y., & Hon, H. W. (2006). Adapting ranking SVM to document retrieval. In SIGIR.","DOI":"10.1145\/1148170.1148205"},{"key":"9110_CR6","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T. Y., Tsai, M. F., & Li, H. (2007) Learning to rank: From pairwise approach to listwise approach. In International conference on machine learning.","DOI":"10.1145\/1273496.1273513"},{"key":"9110_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Khanna, R., Sawant, U., & Bhattacharyya, C. (2008). Structured learning for non-smooth ranking losses. In International conference on knowledge discovery and data mining (KDD).","DOI":"10.1145\/1401890.1401906"},{"key":"9110_CR8","doi-asserted-by":"crossref","unstructured":"Chapelle, O., Chi, M., & Zien, A. (2006) A continuation method for semi-supervised SVMs. In International conference on machine learning.","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"key":"9110_CR9","unstructured":"Chapelle, O., Le, Q., & Smola, A. (2007) Large margin optimization of ranking measures. In NIPS workshop on machine learning for web search."},{"key":"9110_CR10","doi-asserted-by":"crossref","unstructured":"Cossock, D., & Zhang, T. (2006). Subset ranking using regression. In 19th Annual conference on learning theory, Lecture Notes in Computer Science (Vol. 4005, pp. 605\u2013619). Springer.","DOI":"10.1007\/11776420_44"},{"key":"9110_CR11","doi-asserted-by":"crossref","unstructured":"Donmez, P., Svore, K., & Burges, C. (2009). On the local optimality of LambdaRank. In SIGIR\u201909: Proceedings of the 32nd international ACM SIGIR conference on research and development in information retrieval, ACM (pp. 460\u2013467).","DOI":"10.1145\/1571941.1572021"},{"key":"9110_CR12","doi-asserted-by":"crossref","unstructured":"Dunlavy, D., & O\u2019Leary, D. (2005). Homotopy optimization methods for global optimization. Tech. Rep. SAND2005-7495, Sandia National Laboratories.","DOI":"10.2172\/876373"},{"key":"9110_CR13","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1162\/jmlr.2003.4.6.933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003) An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"Journal of Machine Learning Research"},{"key":"9110_CR14","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J. Friedman","year":"2001","unstructured":"Friedman, J. (2001) Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29, 1189\u20131232.","journal-title":"Annals of Statistics"},{"key":"9110_CR15","doi-asserted-by":"crossref","unstructured":"Guiver, J., & Snelson, E. (2008). Learning to rank with softrank and gaussian processes. In: SIGIR\u201908: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval, ACM (pp. 259\u2013266).","DOI":"10.1145\/1390334.1390380"},{"key":"9110_CR16","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In A. Smola, P. Bartlett, B. Sch\u00f6lkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers. Cambridge, MA: MIT Press.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"issue":"4","key":"9110_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. Jarvelin","year":"2002","unstructured":"Jarvelin, K., & Kekalainen, J. (2002) Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4), 422\u2013446.","journal-title":"ACM Transactions on Information Systems"},{"key":"9110_CR18","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2002) Optimizing search engines using clickthrough data. In Proceedings of the ACM conference on knowledge discovery and data mining (KDD), ACM.","DOI":"10.1145\/775047.775067"},{"key":"9110_CR19","unstructured":"Le, Q. V., Smola, A., Chapelle, O., & Teo, C. H. (2009). Optimization of ranking measures (submitted)."},{"key":"9110_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in banach spaces: Isoperimetry and processes","author":"M. Ledoux","year":"1991","unstructured":"Ledoux, M., & Talagrand, M. (1991) Probability in banach spaces: Isoperimetry and processes. Berlin: Springer."},{"key":"9110_CR21","unstructured":"Li, P., Burges, C., & Wu, Q. (2008) Mcrank Learning to rank using multiple classification and gradient boosting. In J. Platt, D. Koller, Y. Singe, & S. Roweis (Eds.), Advances in neural information processing systems (Vol. 20, pp. 897\u2013904). Cambridge, MA: MIT Press."},{"key":"9110_CR22","unstructured":"Liu, T. Y., Xu, J., Qin, T., Xiong, W., & Li, H. (2007). Letor: Benchmark dataset for research on learning to rank for information retrieval. In LR4IR 2007, in conjunction with SIGIR 2007."},{"key":"9110_CR23","doi-asserted-by":"crossref","unstructured":"Robertson, S. E., & Walker, S. (1994). Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In Proceedings of the 17th annual international ACM SIGIR conference on research and development in information retrieval.","DOI":"10.1007\/978-1-4471-2099-5_24"},{"key":"9110_CR24","unstructured":"Shewchuk, J. R. (1994). An introduction to the conjugate gradient method without the agonizing pain. Tech. Rep. CMU-CS-94-125, School of Computer Science, Carnegie Mellon University."},{"key":"9110_CR25","doi-asserted-by":"crossref","unstructured":"Taylor, M., Guiver, J., Robertson, S., & Minka, T. (2008). Softrank: Optimizing non-smooth rank metrics. In WSDM\u201908: Proceedings of the international conference on web search and web data mining, ACM (pp. 77\u201386).","DOI":"10.1145\/1341531.1341544"},{"key":"9110_CR26","doi-asserted-by":"crossref","unstructured":"Tsai, M. F., Liu, T. Y., Qin, T., Chen, H. H., & Ma, W. Y. (2007). Frank: A ranking method with fidelity loss. In International ACM SIGIR conference on research and development in information retrieval.","DOI":"10.1145\/1277741.1277808"},{"key":"9110_CR27","doi-asserted-by":"crossref","unstructured":"Wu, M., Chang, Y., Zheng, Z., & Zha, H. (2009). Smoothing DCG for learning to rank: A novel approach using smoothed hinge functions. In Proceedings of the 17th ACM conference on information and knowledge management, CIKM.","DOI":"10.1145\/1645953.1646266"},{"key":"9110_CR28","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, T., Wang, J., Zhang, W., & Li, H. (2008). Listwise approach to learning to rank: Theory and algorithm. In Proceedings of the 25th international conference on machine learning (pp. 1192\u20131199).","DOI":"10.1145\/1390156.1390306"},{"key":"9110_CR29","doi-asserted-by":"crossref","unstructured":"Xu, J., & Li, H. (2007). Adarank: A boosting algorithm for information retrieval. In International ACM SIGIR conference on research and development in information retrieval.","DOI":"10.1145\/1277741.1277809"},{"key":"9110_CR30","doi-asserted-by":"publisher","unstructured":"Yilmaz, E., & Robertson, S. (2009). On the choice of effectiveness measures for learning to rank. Information Retrieval Journal To appear in the special issue of Learning to Rank for Information Retrieval. doi:10.1007\/s10791-009-9116-x.","DOI":"10.1007\/s10791-009-9116-x"},{"key":"9110_CR31","unstructured":"Yue, Y., & Burges, C. (2007). On using simultaneous perturbation stochastic approximation for learning to rank, and the empirical optimality of LambdaRank. Tech. Rep. MSR-TR-2007-115, Microsoft Reseach."},{"key":"9110_CR32","doi-asserted-by":"crossref","unstructured":"Yue, Y., Finley, T., Radlinski, F., & Joachims, T. (2007) A support vector method for optimizing average precision. In SIGIR \u201907: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, ACM (pp. 271\u2013278).","DOI":"10.1145\/1277741.1277790"},{"key":"9110_CR33","unstructured":"Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., & Sun, G. (2008). A general boosting method and its application to learning ranking functions for web search. In Advances in neural information processing systems (Vol. 20, pp 1697\u20131704). MIT Press."}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9110-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-009-9110-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9110-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-009-9110-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:49:09Z","timestamp":1704206949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-009-9110-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,10]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9110"],"URL":"https:\/\/doi.org\/10.1007\/s10791-009-9110-3","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,10]]},"assertion":[{"value":"27 March 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}