{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T20:39:13Z","timestamp":1775335153398,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,19]]},"DOI":"10.1145\/1571941.1571987","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"259-266","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Robust sparse rank learning for non-smooth ranking measures"],"prefix":"10.1145","author":[{"given":"Zhengya","family":"Sun","sequence":"first","affiliation":[{"name":"Institute of Automation Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Qin","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Tao","sequence":"additional","affiliation":[{"name":"Institute of Automation Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jue","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Automation Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"benchmark datasets for learning to rank","author":"Asia M.R.","year":"2008","unstructured":"M.R. Asia . Letor3.0 : benchmark datasets for learning to rank . Microsoft Corporation , December 2008 . M.R. Asia. Letor3.0: benchmark datasets for learning to rank. Microsoft Corporation, December 2008."},{"key":"e_1_3_2_1_2_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison Wesley , 1999 . R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5058-6"},{"key":"e_1_3_2_1_4_1","first-page":"11","article-title":"Reductions between classification tasks","author":"Beygelzimer A.","year":"2004","unstructured":"A. Beygelzimer , V. Dani , T. Hayes , and J. Langford . Reductions between classification tasks . Electronic Colloquium on Computational Complexity , 11 , 2004 . A. Beygelzimer, V. Dani, T. Hayes, and J. Langford. Reductions between classification tasks. Electronic Colloquium on Computational Complexity, 11, 2004.","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102358"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.7551\/mitpress\/7503.003.0029","volume-title":"Advances in Neural Information Processing Systems 19","author":"Burges C.","year":"2007","unstructured":"C. Burges , R. Ragno , and Q. Le . Learning to rank with nonsmooth cost functions . In Advances in Neural Information Processing Systems 19 , pages 193 -- 200 . MIT Press , 2007 . C. Burges, R. Ragno, and Q. Le. Learning to rank with nonsmooth cost functions. In Advances in Neural Information Processing Systems 19, pages 193--200. MIT Press, 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401906"},{"key":"e_1_3_2_1_9_1","volume-title":"NIPS Workshop on Machine Learning for Web Search","author":"Chapelle O.","year":"2007","unstructured":"O. Chapelle , Q. Le , and A. Smola . Large margin optimization of ranking measures . In NIPS Workshop on Machine Learning for Web Search , 2007 . O. Chapelle, Q. Le, and A. Smola. Large margin optimization of ranking measures. In NIPS Workshop on Machine Learning for Web Search, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390380"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_11"},{"key":"e_1_3_2_1_13_1","volume-title":"Sparse online learning via truncated gradient. CoRR, abs\/0806.4686","author":"Langford J.","year":"2008","unstructured":"J. Langford , L. Li and T. Zhang . Sparse online learning via truncated gradient. CoRR, abs\/0806.4686 , 2008 . J. Langford, L. Li and T. Zhang. Sparse online learning via truncated gradient. CoRR, abs\/0806.4686, 2008."},{"key":"e_1_3_2_1_14_1","volume-title":"Direct optimization of ranking measures. CoRR, abs\/0704.3359","author":"Le Q.","year":"2007","unstructured":"Q. Le and A. Smola . Direct optimization of ranking measures. CoRR, abs\/0704.3359 , 2007 . Q. Le and A. Smola. Direct optimization of ranking measures. CoRR, abs\/0704.3359, 2007."},{"key":"e_1_3_2_1_15_1","volume-title":"Microsoft Research","author":"Qin T.","year":"2008","unstructured":"T. Qin , T.-Y. Liu , and H. Li . A general approximation framework for direct optimization of information retrieval measures. MSR-TR-2008-164 , Microsoft Research , 2008 . T. Qin, T.-Y. Liu, and H. Li. A general approximation framework for direct optimization of information retrieval measures. MSR-TR-2008-164, Microsoft Research, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_17_1","first-page":"115","volume-title":"Overview of the TREC 2002 question answering track. In Proceedings of the Eleventh Text Retrieval Conference(TREC)","author":"Voorhees E.","year":"2002","unstructured":"E. Voorhees . Overview of the TREC 2002 question answering track. In Proceedings of the Eleventh Text Retrieval Conference(TREC) , pages 115 -- 123 , 2002 . E. Voorhees. Overview of the TREC 2002 question answering track. In Proceedings of the Eleventh Text Retrieval Conference(TREC), pages 115--123, 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_19_1","volume-title":"LR4IR","author":"Yeh J.-Y.","year":"2007","unstructured":"J.-Y. Yeh , J.-Y. Lin , H.-R. Ke , and W.-P. Yang . Learning to rank for information retrieval using genetic programming . In LR4IR , 2007 . J.-Y. Yeh, J.-Y. Lin, H.-R. Ke, and W.-P. Yang. Learning to rank for information retrieval using genetic programming. In LR4IR, 2007."},{"key":"e_1_3_2_1_20_1","volume-title":"Microsoft Research","author":"Yue Y.","year":"2007","unstructured":"Y. Yue and C. Burges . On using simultaneous perturbation stochastic approximation for learning to rank, and the empirical optimality of lambdarank. MSR-TR-2007-115 , Microsoft Research , 2007 . Y. Yue and C. Burges. On using simultaneous perturbation stochastic approximation for learning to rank, and the empirical optimality of lambdarank. MSR-TR-2007-115, Microsoft Research, 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1079120130"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248637"}],"event":{"name":"SIGIR '09: The 32nd International ACM SIGIR conference on research and development in Information Retrieval","location":"Boston MA USA","acronym":"SIGIR '09","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1571941.1571987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1571941.1571987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:45Z","timestamp":1750249065000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1571941.1571987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":22,"alternative-id":["10.1145\/1571941.1571987","10.1145\/1571941"],"URL":"https:\/\/doi.org\/10.1145\/1571941.1571987","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}