{"id":"https://openalex.org/W4284685307","doi":"https://doi.org/10.1145/3477495.3531849","title":"On Optimizing Top-K Metrics for Neural Ranking Models","display_name":"On Optimizing Top-K Metrics for Neural Ranking Models","publication_year":2022,"publication_date":"2022-07-06","ids":{"openalex":"https://openalex.org/W4284685307","doi":"https://doi.org/10.1145/3477495.3531849"},"language":"en","primary_location":{"id":"doi:10.1145/3477495.3531849","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3477495.3531849","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3477495.3531849","source":{"id":"https://openalex.org/S4363608773","display_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3477495.3531849","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042795557","display_name":"Rolf Jagerman","orcid":"https://orcid.org/0000-0002-5169-495X"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rolf Jagerman","raw_affiliation_strings":["Google Research, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100763095","display_name":"Zhen Qin","orcid":"https://orcid.org/0000-0001-7857-9719"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhen Qin","raw_affiliation_strings":["Google Research, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064608039","display_name":"Xuanhui Wang","orcid":"https://orcid.org/0009-0000-1388-1423"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuanhui Wang","raw_affiliation_strings":["Google Research, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032248436","display_name":"Michael Bendersky","orcid":"https://orcid.org/0000-0002-2941-6240"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Bendersky","raw_affiliation_strings":["Google Research, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037200145","display_name":"Marc Najork","orcid":"https://orcid.org/0000-0003-1423-0854"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marc Najork","raw_affiliation_strings":["Google Research, Mountain View, CA, USA"],"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5042795557"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":1.4543,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83845076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2303","last_page":"2307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.7704733610153198},{"id":"https://openalex.org/keywords/softmax-function","display_name":"Softmax function","score":0.7639791965484619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7622950077056885},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6946169137954712},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.6621403098106384},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.6285158395767212},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5659604072570801},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5571564435958862},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.5197779536247253},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4917738735675812},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.46979960799217224},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.46576571464538574},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4601273238658905},{"id":"https://openalex.org/keywords/ranking-svm","display_name":"Ranking SVM","score":0.4236091375350952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11456954479217529}],"concepts":[{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7704733610153198},{"id":"https://openalex.org/C188441871","wikidata":"https://www.wikidata.org/wiki/Q7554146","display_name":"Softmax function","level":3,"score":0.7639791965484619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7622950077056885},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6946169137954712},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6621403098106384},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.6285158395767212},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5659604072570801},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5571564435958862},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.5197779536247253},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4917738735675812},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.46979960799217224},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.46576571464538574},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4601273238658905},{"id":"https://openalex.org/C124975894","wikidata":"https://www.wikidata.org/wiki/Q7293290","display_name":"Ranking SVM","level":3,"score":0.4236091375350952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11456954479217529},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3477495.3531849","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3477495.3531849","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3477495.3531849","source":{"id":"https://openalex.org/S4363608773","display_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3477495.3531849","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3477495.3531849","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3477495.3531849","source":{"id":"https://openalex.org/S4363608773","display_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4284685307.pdf","grobid_xml":"https://content.openalex.org/works/W4284685307.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1973435495","https://openalex.org/W2059001985","https://openalex.org/W2069870183","https://openalex.org/W2091158010","https://openalex.org/W2115584760","https://openalex.org/W2143331230","https://openalex.org/W2340526403","https://openalex.org/W2507134384","https://openalex.org/W2566147423","https://openalex.org/W2769473018","https://openalex.org/W2898073868","https://openalex.org/W2902365885","https://openalex.org/W2947404296","https://openalex.org/W2955669675","https://openalex.org/W2959353218","https://openalex.org/W2994069334","https://openalex.org/W3028135017","https://openalex.org/W3047934539","https://openalex.org/W3101935024","https://openalex.org/W3105136066","https://openalex.org/W3132466668","https://openalex.org/W3195689301","https://openalex.org/W4288280739","https://openalex.org/W6643393412"],"related_works":["https://openalex.org/W3127142483","https://openalex.org/W2036613096","https://openalex.org/W2138488530","https://openalex.org/W2963493716","https://openalex.org/W4385565564","https://openalex.org/W2104465941","https://openalex.org/W2293317945","https://openalex.org/W4318960487","https://openalex.org/W2096682819","https://openalex.org/W1786507113"],"abstract_inverted_index":{"Top-K":[0],"metrics":[1,100],"such":[2,17,101],"as":[3,18,102],"[email":[4,33,103,115,137],"protected]":[5,34,104,116,138],"are":[6,21,29,57,85],"frequently":[7],"used":[8,81],"to":[9,31,70,98,112],"evaluate":[10],"ranking":[11,50,79,119,176],"performance.":[12],"The":[13],"traditional":[14],"tree-based":[15],"models":[16,51,56,64,84],"LambdaMART,":[19],"which":[20],"based":[22],"on":[23,48,110,158],"Gradient":[24],"Boosted":[25],"Decision":[26],"Trees":[27],"(GBDT),":[28],"designed":[30],"optimize":[32,114],"using":[35,149],"the":[36,61,76,86,90,126,141,155,159,166],"LambdaRank":[37],"losses.":[38],"Recently,":[39],"there":[40],"is":[41],"a":[42,108],"good":[43],"amount":[44],"of":[45],"research":[46],"interest":[47],"neural":[49,83,118,175],"for":[52,117,136,174],"learning-to-rank":[53],"tasks.":[54],"These":[55,93],"fundamentally":[58],"different":[59,71],"from":[60],"decision":[62],"tree":[63],"and":[65,89,129,132,163],"behave":[66],"differently":[67],"with":[68],"respect":[69],"loss":[72,88],"functions.":[73],"For":[74],"example,":[75],"most":[77],"popular":[78],"losses":[80,94,135,157,168,173],"in":[82],"Softmax":[87],"GumbelApproxNDCG":[91],"loss.":[92],"do":[95,147],"not":[96],"connect":[97],"top-K":[99],"naturally.":[105],"It":[106],"remains":[107],"question":[109],"how":[111],"effectively":[113],"models.":[120,177],"In":[121],"this":[122],"paper,":[123],"we":[124],"follow":[125],"LambdaLoss":[127,143],"framework":[128],"design":[130],"novel":[131],"theoretically":[133],"sound":[134],"metrics,":[139],"while":[140],"original":[142],"paper":[144],"can":[145],"only":[146],"so":[148],"an":[150],"unsound":[151],"heuristic.":[152],"We":[153],"study":[154],"new":[156,167],"LETOR":[160],"benchmark":[161],"datasets":[162],"show":[164],"that":[165],"work":[169],"better":[170],"than":[171],"other":[172]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}