{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/learning-to-rank","name":"Learning-To-Rank","slug":"learning-to-rank","description_markdown":"Learning to rank is the application of machine learning to build ranking models. Some common use cases for ranking models are information retrieval (e.g., web search) and news feeds application (think Twitter, Facebook, Instagram).","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":753,"papers_with_code":213,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":9,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/mslr-web10k","name":"MSLR-WEB10K","full_name":"","num_papers_in_archive":36},{"url":"/dataset/mq2007","name":"MQ2007","full_name":"","num_papers_in_archive":32},{"url":"/dataset/mq2008","name":"MQ2008","full_name":"","num_papers_in_archive":31},{"url":"/dataset/learning-to-rank-challenge","name":"Learning to Rank Challenge","full_name":"Yahoo! Learning to Rank Challenge","num_papers_in_archive":25},{"url":"/dataset/multifc","name":"MultiFC","full_name":"","num_papers_in_archive":21},{"url":"/dataset/reqa","name":"ReQA","full_name":"Retrieval Question-Answering","num_papers_in_archive":10},{"url":"/dataset/art-dataset","name":"ART Dataset","full_name":"Abductive Reasoning in narrative Text","num_papers_in_archive":9},{"url":"/dataset/flickr-cropping-dataset","name":"Flickr Cropping Dataset","full_name":null,"num_papers_in_archive":5},{"url":"/dataset/refresd","name":"REFreSD","full_name":"Rationalized English-French Semantic Divergences","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":8,"rows_per_page":100,"shown":100,"of":753,"of_with_code":213,"tagged_in_all":753,"counts":{"archive_papers_tagged":753,"with_a_code_link":213,"where_syntology_ran_a_sample":43,"not_listed_spam_title":0,"listed":753,"listed_where_code_ran":43,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":9,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","repositories_listed":12,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}},"official":{"repos":["tensorflow/recommenders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improving-pairwise-ranking-for-multi-label","slug":"improving-pairwise-ranking-for-multi-label","title":"Improving Pairwise Ranking for Multi-label Image Classification","date":"2017-04-11","arxiv_id":"1704.03135","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-rank-question-answer-pairs-using","slug":"learning-to-rank-question-answer-pairs-using","title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering","date":"2017-10-10","arxiv_id":"1710.03430","repositories_listed":3,"syntology":null},{"url":"/paper/support-vector-comparison-machines","slug":"support-vector-comparison-machines","title":"Support vector comparison machines","date":"2014-01-30","arxiv_id":"1401.8008","repositories_listed":3,"syntology":null},{"url":"/paper/13062597","slug":"13062597","title":"Introducing LETOR 4.0 Datasets","date":"2013-06-09","arxiv_id":"1306.2597","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-rank-aspects-and-opinions-for","slug":"learning-to-rank-aspects-and-opinions-for","title":"Learning to Rank Aspects and Opinions for Comparative Explanations","date":"2025-01-16","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/offline-model-based-optimization-by-learning","slug":"offline-model-based-optimization-by-learning","title":"Offline Model-Based Optimization by Learning to Rank","date":"2024-10-15","arxiv_id":"2410.11502","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":1,"n_ran_checked":9,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":3,"n_no_contract":6,"n_pointer_only":9,"phrase":"15 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 3 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/offline-model-based-optimization-by-learning#ran","syntology_url":"https://syntology.ai/paper/2410.11502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.11502"}},"official":{"repos":["ggchen1997/bdi","lamda-bbo/offline-ram"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["community","found_in_text","official"]}}},{"url":"/paper/unbiased-learning-to-rank-meets-reality","slug":"unbiased-learning-to-rank-meets-reality","title":"Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search Dataset","date":"2024-04-03","arxiv_id":"2404.02543","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-rank-in-generative-retrieval","slug":"learning-to-rank-in-generative-retrieval","title":"Learning to Rank in Generative Retrieval","date":"2023-06-27","arxiv_id":"2306.15222","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-rank-meets-language-boosting-1","slug":"learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","arxiv_id":"2306.13856","repositories_listed":2,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":8,"n_instrument":10,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 10 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-to-rank-meets-language-boosting-1#ran","syntology_url":"https://syntology.ai/paper/2306.13856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13856"}},"official":{"repos":["raywang335/l2rclip"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unified-off-policy-learning-to-rank-a","slug":"unified-off-policy-learning-to-rank-a","title":"Unified Off-Policy Learning to Rank: a Reinforcement Learning Perspective","date":"2023-06-13","arxiv_id":"2306.07528","repositories_listed":2,"syntology":null},{"url":"/paper/thuir-coliee-2023-incorporating-structural","slug":"thuir-coliee-2023-incorporating-structural","title":"THUIR@COLIEE 2023: Incorporating Structural Knowledge into Pre-trained Language Models for Legal Case Retrieval","date":"2023-05-11","arxiv_id":"2305.06812","repositories_listed":2,"syntology":null},{"url":"/paper/thuir-coliee-2023-more-parameters-and-legal","slug":"thuir-coliee-2023-more-parameters-and-legal","title":"THUIR@COLIEE 2023: More Parameters and Legal Knowledge for Legal Case Entailment","date":"2023-05-11","arxiv_id":"2305.06817","repositories_listed":2,"syntology":null},{"url":"/paper/an-offline-metric-for-the-debiasedness-of","slug":"an-offline-metric-for-the-debiasedness-of","title":"An Offline Metric for the Debiasedness of Click Models","date":"2023-04-19","arxiv_id":"2304.09560","repositories_listed":2,"syntology":null},{"url":"/paper/fantastic-rewards-and-how-to-tame-them-a-case","slug":"fantastic-rewards-and-how-to-tame-them-a-case","title":"Fantastic Rewards and How to Tame Them: A Case Study on Reward Learning for Task-oriented Dialogue Systems","date":"2023-02-20","arxiv_id":"2302.10342","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fantastic-rewards-and-how-to-tame-them-a-case#ran","syntology_url":"https://syntology.ai/paper/2302.10342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10342"}},"official":{"repos":["budzianowski/multiwoz","shentao-yang/fantastic_reward_iclr2023"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pairwise-learning-for-neural-link-prediction","slug":"pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","arxiv_id":"2112.02936","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pairwise-learning-for-neural-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2112.02936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02936"}},"official":{"repos":["zhitao-wang/plnlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-approach-for-cross-silo","slug":"an-efficient-approach-for-cross-silo","title":"An Efficient Approach for Cross-Silo Federated Learning to Rank","date":"2021-06-21","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-explain-recommendations","slug":"learning-to-explain-recommendations","title":"On the Relationship between Explanation and Recommendation: Learning to Rank Explanations for Improved Performance","date":"2021-02-01","arxiv_id":"2102.00627","repositories_listed":2,"syntology":null},{"url":"/paper/ranking-for-individual-and-group-fairness","slug":"ranking-for-individual-and-group-fairness","title":"On the Problem of Underranking in Group-Fair Ranking","date":"2020-09-24","arxiv_id":"2010.06986","repositories_listed":2,"syntology":null},{"url":"/paper/ranking-incentivized-quality-preserving","slug":"ranking-incentivized-quality-preserving","title":"Ranking-Incentivized Quality Preserving Content Modification","date":"2020-05-26","arxiv_id":"2005.12989","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-rank-via-combining","slug":"learning-to-rank-via-combining","title":"Distance-based Positive and Unlabeled Learning for Ranking","date":"2020-05-20","arxiv_id":"2005.10700","repositories_listed":2,"syntology":null},{"url":"/paper/that-is-a-known-lie-detecting-previously-fact","slug":"that-is-a-known-lie-detecting-previously-fact","title":"That is a Known Lie: Detecting Previously Fact-Checked Claims","date":"2020-05-12","arxiv_id":"2005.06058","repositories_listed":2,"syntology":null},{"url":"/paper/setrank-learning-a-permutation-invariant","slug":"setrank-learning-a-permutation-invariant","title":"SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval","date":"2019-12-12","arxiv_id":"1912.05891","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/setrank-learning-a-permutation-invariant#ran","syntology_url":"https://syntology.ai/paper/1912.05891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05891"}},"official":{"repos":["pl8787/SetRank"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/to-model-or-to-intervene-a-comparison-of","slug":"to-model-or-to-intervene-a-comparison-of","title":"To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactions","date":"2019-07-15","arxiv_id":"1907.06412","repositories_listed":2,"syntology":null},{"url":"/paper/exploiting-unlabeled-data-in-cnns-by-self","slug":"exploiting-unlabeled-data-in-cnns-by-self","title":"Exploiting Unlabeled Data in CNNs by Self-supervised Learning to Rank","date":"2019-02-17","arxiv_id":"1902.06285","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploiting-unlabeled-data-in-cnns-by-self#ran","syntology_url":"https://syntology.ai/paper/1902.06285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06285"}},"official":null}},{"url":"/paper/tf-ranking-scalable-tensorflow-library-for","slug":"tf-ranking-scalable-tensorflow-library-for","title":"TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank","date":"2018-11-30","arxiv_id":"1812.00073","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tf-ranking-scalable-tensorflow-library-for#ran","syntology_url":"https://syntology.ai/paper/1812.00073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00073"}},"official":{"repos":["tensorflow/ranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-groupwise-scoring-functions-using","slug":"learning-groupwise-scoring-functions-using","title":"Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks","date":"2018-11-11","arxiv_id":"1811.04415","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-groupwise-scoring-functions-using#ran","syntology_url":"https://syntology.ai/paper/1811.04415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04415"}},"official":null}},{"url":"/paper/joint-representation-learning-for-top-n","slug":"joint-representation-learning-for-top-n","title":"Joint Representation Learning for Top-N Recommendation with Heterogeneous Information Sources","date":"2017-11-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-latent-vector-spaces-for-product","slug":"learning-latent-vector-spaces-for-product","title":"Learning Latent Vector Spaces for Product Search","date":"2016-08-25","arxiv_id":"1608.07253","repositories_listed":2,"syntology":null},{"url":"/paper/kamae-bridging-spark-and-keras-for-seamless","slug":"kamae-bridging-spark-and-keras-for-seamless","title":"Kamae: Bridging Spark and Keras for Seamless ML Preprocessing","date":"2025-07-08","arxiv_id":"2507.06021","repositories_listed":1,"syntology":null},{"url":"/paper/unidentified-and-confounded-understanding-two","slug":"unidentified-and-confounded-understanding-two","title":"Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank","date":"2025-06-25","arxiv_id":"2506.20501","repositories_listed":1,"syntology":null},{"url":"/paper/ltrr-learning-to-rank-retrievers-for-llms","slug":"ltrr-learning-to-rank-retrievers-for-llms","title":"LTRR: Learning To Rank Retrievers for LLMs","date":"2025-06-16","arxiv_id":"2506.13743","repositories_listed":1,"syntology":null},{"url":"/paper/paths-to-causality-finding-informative","slug":"paths-to-causality-finding-informative","title":"Paths to Causality: Finding Informative Subgraphs Within Knowledge Graphs for Knowledge-Based Causal Discovery","date":"2025-06-10","arxiv_id":"2506.08771","repositories_listed":1,"syntology":null},{"url":"/paper/visualquality-r1-reasoning-induced-image","slug":"visualquality-r1-reasoning-induced-image","title":"VisualQuality-R1: Reasoning-Induced Image Quality Assessment via Reinforcement Learning to Rank","date":"2025-05-20","arxiv_id":"2505.14460","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/visualquality-r1-reasoning-induced-image#ran","syntology_url":"https://syntology.ai/paper/2505.14460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.14460"}},"official":{"repos":["tianhewu/visualquality-r1"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/unlearning-for-federated-online-learning-to","slug":"unlearning-for-federated-online-learning-to","title":"Unlearning for Federated Online Learning to Rank: A Reproducibility Study","date":"2025-05-19","arxiv_id":"2505.12791","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-annotation-barriers-generalized","slug":"breaking-annotation-barriers-generalized","title":"Breaking Annotation Barriers: Generalized Video Quality Assessment via Ranking-based Self-Supervision","date":"2025-05-06","arxiv_id":"2505.03631","repositories_listed":1,"syntology":null},{"url":"/paper/hapi-a-model-for-learning-robot-facial","slug":"hapi-a-model-for-learning-robot-facial","title":"HAPI: A Model for Learning Robot Facial Expressions from Human Preferences","date":"2025-03-21","arxiv_id":"2503.17046","repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-learning-to-rank-with-query-level","slug":"unbiased-learning-to-rank-with-query-level","title":"Unbiased Learning to Rank with Query-Level Click Propensity Estimation: Beyond Pointwise Observation and Relevance","date":"2025-02-17","arxiv_id":"2502.11414","repositories_listed":1,"syntology":null},{"url":"/paper/improving-similar-case-retrieval-ranking","slug":"improving-similar-case-retrieval-ranking","title":"Improving Similar Case Retrieval Ranking Performance By Revisiting RankSVM","date":"2025-02-16","arxiv_id":"2502.11131","repositories_listed":1,"syntology":null},{"url":"/paper/ramqa-a-unified-framework-for-retrieval","slug":"ramqa-a-unified-framework-for-retrieval","title":"RAMQA: A Unified Framework for Retrieval-Augmented Multi-Modal Question Answering","date":"2025-01-23","arxiv_id":"2501.13297","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-aware-adapter-for-text-driven-image","slug":"ranking-aware-adapter-for-text-driven-image","title":"Ranking-aware adapter for text-driven image ordering with CLIP","date":"2024-12-09","arxiv_id":"2412.06760","repositories_listed":1,"syntology":null},{"url":"/paper/learning-cluster-representatives-for","slug":"learning-cluster-representatives-for","title":"Learning Cluster Representatives for Approximate Nearest Neighbor Search","date":"2024-12-08","arxiv_id":"2412.05921","repositories_listed":1,"syntology":null},{"url":"/paper/tsprank-bridging-pairwise-and-listwise","slug":"tsprank-bridging-pairwise-and-listwise","title":"TSPRank: Bridging Pairwise and Listwise Methods with a Bilinear Travelling Salesman Model","date":"2024-11-18","arxiv_id":"2411.12064","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-logistic-bandits","slug":"combinatorial-logistic-bandits","title":"Combinatorial Logistic Bandits","date":"2024-10-22","arxiv_id":"2410.17075","repositories_listed":1,"syntology":null},{"url":"/paper/mirage-bench-automatic-multilingual-benchmark","slug":"mirage-bench-automatic-multilingual-benchmark","title":"MIRAGE-Bench: Automatic Multilingual Benchmark Arena for Retrieval-Augmented Generation Systems","date":"2024-10-17","arxiv_id":"2410.13716","repositories_listed":1,"syntology":null},{"url":"/paper/patch-ranking-efficient-clip-by-learning-to","slug":"patch-ranking-efficient-clip-by-learning-to","title":"Patch Ranking: Efficient CLIP by Learning to Rank Local Patches","date":"2024-09-22","arxiv_id":"2409.14607","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-llm-scheduling-by-learning-to-rank","slug":"efficient-llm-scheduling-by-learning-to-rank","title":"Efficient LLM Scheduling by Learning to Rank","date":"2024-08-28","arxiv_id":"2408.15792","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/efficient-llm-scheduling-by-learning-to-rank#ran","syntology_url":"https://syntology.ai/paper/2408.15792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15792"}},"official":{"repos":["hao-ai-lab/vllm-ltr"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/mitigating-exposure-bias-in-online-learning","slug":"mitigating-exposure-bias-in-online-learning","title":"Mitigating Exposure Bias in Online Learning to Rank Recommendation: A Novel Reward Model for Cascading Bandits","date":"2024-08-08","arxiv_id":"2408.04332","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02156","slug":"2408-02156","title":"Calibration-Disentangled Learning and Relevance-Prioritized Reranking for Calibrated Sequential Recommendation","date":"2024-08-04","arxiv_id":"2408.02156","repositories_listed":1,"syntology":null},{"url":"/paper/hidden-or-inferred-fair-learning-to-rank-with","slug":"hidden-or-inferred-fair-learning-to-rank-with","title":"Hidden or Inferred: Fair Learning-To-Rank with Unknown Demographics","date":"2024-07-24","arxiv_id":"2407.17459","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":5,"n_honours":3,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/hidden-or-inferred-fair-learning-to-rank-with#ran","syntology_url":"https://syntology.ai/paper/2407.17459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.17459"}},"official":{"repos":["sewen007/hoiltr"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-topic-specificity-and-social","slug":"leveraging-topic-specificity-and-social","title":"Leveraging Topic Specificity and Social Relationships for Expert Finding in Community Question Answering Platforms","date":"2024-07-04","arxiv_id":"2407.04018","repositories_listed":1,"syntology":null},{"url":"/paper/first-faster-improved-listwise-reranking-with","slug":"first-faster-improved-listwise-reranking-with","title":"FIRST: Faster Improved Listwise Reranking with Single Token Decoding","date":"2024-06-21","arxiv_id":"2406.15657","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/first-faster-improved-listwise-reranking-with#ran","syntology_url":"https://syntology.ai/paper/2406.15657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15657"}},"official":{"repos":["gangiswag/llm-reranker"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-passage-embeddings-for-efficient","slug":"leveraging-passage-embeddings-for-efficient","title":"Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models","date":"2024-06-21","arxiv_id":"2406.14848","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/leveraging-passage-embeddings-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2406.14848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14848"}},"official":{"repos":["liuqi6777/pe_rank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/step-level-value-preference-optimization-for","slug":"step-level-value-preference-optimization-for","title":"Step-level Value Preference Optimization for Mathematical Reasoning","date":"2024-06-16","arxiv_id":"2406.10858","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/step-level-value-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.10858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10858"}},"official":{"repos":["MARIO-Math-Reasoning/Super_MARIO"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-user-retention-through-generative","slug":"modeling-user-retention-through-generative","title":"Modeling User Retention through Generative Flow Networks","date":"2024-06-10","arxiv_id":"2406.06043","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-user-retention-through-generative#ran","syntology_url":"https://syntology.ai/paper/2406.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06043"}},"official":{"repos":["Applied-Machine-Learning-Lab/GFN4Retention"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-branch-network-for-portrait-image","slug":"dual-branch-network-for-portrait-image","title":"Dual-Branch Network for Portrait Image Quality Assessment","date":"2024-05-14","arxiv_id":"2405.08555","repositories_listed":1,"syntology":null},{"url":"/paper/is-interpretable-machine-learning-effective","slug":"is-interpretable-machine-learning-effective","title":"Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?","date":"2024-05-13","arxiv_id":"2405.07782","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-the-hessian-matrix-of-ranking","slug":"estimating-the-hessian-matrix-of-ranking","title":"Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees","date":"2024-04-18","arxiv_id":"2404.12190","repositories_listed":1,"syntology":null},{"url":"/paper/a-learning-to-rank-formulation-of-clustering","slug":"a-learning-to-rank-formulation-of-clustering","title":"A Learning-to-Rank Formulation of Clustering-Based Approximate Nearest Neighbor Search","date":"2024-04-17","arxiv_id":"2404.11731","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-learning-to-rank-formulation-of-clustering#ran","syntology_url":"https://syntology.ai/paper/2404.11731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11731"}},"official":{"repos":["tomvek/mips-learnt-ivf"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/investigating-the-robustness-of","slug":"investigating-the-robustness-of","title":"Investigating the Robustness of Counterfactual Learning to Rank Models: A Reproducibility Study","date":"2024-04-04","arxiv_id":"2404.03707","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-patches-for-unbiased-image","slug":"learning-to-rank-patches-for-unbiased-image","title":"Learning to Rank Patches for Unbiased Image Redundancy Reduction","date":"2024-03-31","arxiv_id":"2404.00680","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-rank-patches-for-unbiased-image#ran","syntology_url":"https://syntology.ai/paper/2404.00680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00680"}},"official":{"repos":["irslu/ltrp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rankingshap-listwise-feature-attribution","slug":"rankingshap-listwise-feature-attribution","title":"RankingSHAP -- Listwise Feature Attribution Explanations for Ranking Models","date":"2024-03-24","arxiv_id":"2403.16085","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rankingshap-listwise-feature-attribution#ran","syntology_url":"https://syntology.ai/paper/2403.16085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16085"}},"official":{"repos":["mariaheuss/rankingshap"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metasql-a-generate-then-rank-framework-for","slug":"metasql-a-generate-then-rank-framework-for","title":"Metasql: A Generate-then-Rank Framework for Natural Language to SQL Translation","date":"2024-02-27","arxiv_id":"2402.17144","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/metasql-a-generate-then-rank-framework-for#ran","syntology_url":"https://syntology.ai/paper/2402.17144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17144"}},"official":{"repos":["Kaimary/MetaSQL"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/explain-then-rank-scale-calibration-of-neural","slug":"explain-then-rank-scale-calibration-of-neural","title":"Explain then Rank: Scale Calibration of Neural Rankers Using Natural Language Explanations from LLMs","date":"2024-02-19","arxiv_id":"2402.12276","repositories_listed":1,"syntology":null},{"url":"/paper/list-aware-reranking-truncation-joint-model","slug":"list-aware-reranking-truncation-joint-model","title":"List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation","date":"2024-02-05","arxiv_id":"2402.02764","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/list-aware-reranking-truncation-joint-model#ran","syntology_url":"https://syntology.ai/paper/2402.02764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02764"}},"official":{"repos":["xsc1234/genrt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lipo-listwise-preference-optimization-through","slug":"lipo-listwise-preference-optimization-through","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","date":"2024-02-02","arxiv_id":"2402.01878","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lipo-listwise-preference-optimization-through#ran","syntology_url":"https://syntology.ai/paper/2402.01878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01878"}},"official":null}},{"url":"/paper/sharp-explaining-rankings-with-shapley-values","slug":"sharp-explaining-rankings-with-shapley-values","title":"ShaRP: A Novel Feature Importance Framework for Ranking","date":"2024-01-30","arxiv_id":"2401.16744","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sharp-explaining-rankings-with-shapley-values#ran","syntology_url":"https://syntology.ai/paper/2401.16744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16744"}},"official":{"repos":["dataresponsibly/sharp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-forget-clients-in-federated-online","slug":"how-to-forget-clients-in-federated-online","title":"How to Forget Clients in Federated Online Learning to Rank?","date":"2024-01-24","arxiv_id":"2401.13410","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-approach-for-identifying","slug":"learning-to-rank-approach-for-identifying","title":"Learning-To-Rank Approach for Identifying Everyday Objects Using a Physical-World Search Engine","date":"2023-12-26","arxiv_id":"2312.15844","repositories_listed":1,"syntology":null},{"url":"/paper/sardine-a-simulator-for-automated","slug":"sardine-a-simulator-for-automated","title":"SARDINE: A Simulator for Automated Recommendation in Dynamic and Interactive Environments","date":"2023-11-28","arxiv_id":"2311.16586","repositories_listed":1,"syntology":null},{"url":"/paper/glen-generative-retrieval-via-lexical-index","slug":"glen-generative-retrieval-via-lexical-index","title":"GLEN: Generative Retrieval via Lexical Index Learning","date":"2023-11-06","arxiv_id":"2311.03057","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/glen-generative-retrieval-via-lexical-index#ran","syntology_url":"https://syntology.ai/paper/2311.03057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03057"}},"official":{"repos":["skleee/GLEN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/raifle-reconstruction-attacks-on-interaction","slug":"raifle-reconstruction-attacks-on-interaction","title":"RAIFLE: Reconstruction Attacks on Interaction-based Federated Learning with Adversarial Data Manipulation","date":"2023-10-29","arxiv_id":"2310.19163","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-context-for-named-entity","slug":"learning-to-rank-context-for-named-entity","title":"Learning to Rank Context for Named Entity Recognition Using a Synthetic Dataset","date":"2023-10-16","arxiv_id":"2310.10118","repositories_listed":1,"syntology":null},{"url":"/paper/identifiability-matters-revealing-the-hidden","slug":"identifiability-matters-revealing-the-hidden","title":"Identifiability Matters: Revealing the Hidden Recoverable Condition in Unbiased Learning to Rank","date":"2023-09-27","arxiv_id":"2309.15560","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/identifiability-matters-revealing-the-hidden#ran","syntology_url":"https://syntology.ai/paper/2309.15560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15560"}},"official":{"repos":["keytoyze/ultr-identifiability"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimizing-group-fair-plackett-luce-ranking","slug":"optimizing-group-fair-plackett-luce-ranking","title":"Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness","date":"2023-08-25","arxiv_id":"2308.13242","repositories_listed":1,"syntology":null},{"url":"/paper/sustainable-transparency-in-recommender","slug":"sustainable-transparency-in-recommender","title":"Sustainable transparency in Recommender Systems: Bayesian Ranking of Images for Explainability","date":"2023-07-27","arxiv_id":"2308.01196","repositories_listed":1,"syntology":null},{"url":"/paper/a-probabilistic-position-bias-model-for-short","slug":"a-probabilistic-position-bias-model-for-short","title":"A Probabilistic Position Bias Model for Short-Video Recommendation Feeds","date":"2023-07-26","arxiv_id":"2307.14059","repositories_listed":1,"syntology":null},{"url":"/paper/mist-cf-chemical-formula-inference-from","slug":"mist-cf-chemical-formula-inference-from","title":"MIST-CF: Chemical formula inference from tandem mass spectra","date":"2023-07-17","arxiv_id":"2307.08240","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mist-cf-chemical-formula-inference-from#ran","syntology_url":"https://syntology.ai/paper/2307.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08240"}},"official":{"repos":["samgoldman97/mist-cf"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-reference-less-quality-metric-for-automatic","slug":"a-reference-less-quality-metric-for-automatic","title":"A Reference-less Quality Metric for Automatic Speech Recognition via Contrastive-Learning of a Multi-Language Model with Self-Supervision","date":"2023-06-21","arxiv_id":"2306.13114","repositories_listed":1,"syntology":null},{"url":"/paper/norefer-a-referenceless-quality-metric-for","slug":"norefer-a-referenceless-quality-metric-for","title":"NoRefER: a Referenceless Quality Metric for Automatic Speech Recognition via Semi-Supervised Language Model Fine-Tuning with Contrastive Learning","date":"2023-06-21","arxiv_id":"2306.12577","repositories_listed":1,"syntology":null},{"url":"/paper/rankformer-listwise-learning-to-rank-using","slug":"rankformer-listwise-learning-to-rank-using","title":"RankFormer: Listwise Learning-to-Rank Using Listwide Labels","date":"2023-06-09","arxiv_id":"2306.05808","repositories_listed":1,"syntology":null},{"url":"/paper/libauc-a-deep-learning-library-for-x-risk","slug":"libauc-a-deep-learning-library-for-x-risk","title":"LibAUC: A Deep Learning Library for X-Risk Optimization","date":"2023-06-05","arxiv_id":"2306.03065","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/libauc-a-deep-learning-library-for-x-risk#ran","syntology_url":"https://syntology.ai/paper/2306.03065","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03065"}},"official":{"repos":["Optimization-AI/LibAUC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rankcse-unsupervised-sentence-representations","slug":"rankcse-unsupervised-sentence-representations","title":"RankCSE: Unsupervised Sentence Representations Learning via Learning to Rank","date":"2023-05-26","arxiv_id":"2305.16726","repositories_listed":1,"syntology":null},{"url":"/paper/selfood-self-supervised-out-of-distribution","slug":"selfood-self-supervised-out-of-distribution","title":"SELFOOD: Self-Supervised Out-Of-Distribution Detection via Learning to Rank","date":"2023-05-24","arxiv_id":"2305.14696","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selfood-self-supervised-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2305.14696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14696"}},"official":{"repos":["dheeraj7596/selfood"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-impact-of-outlier-bias-on-user-clicks","slug":"on-the-impact-of-outlier-bias-on-user-clicks","title":"On the Impact of Outlier Bias on User Clicks","date":"2023-05-01","arxiv_id":"2305.00857","repositories_listed":1,"syntology":null},{"url":"/paper/safe-deployment-for-counterfactual-learning","slug":"safe-deployment-for-counterfactual-learning","title":"Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization","date":"2023-04-26","arxiv_id":"2305.01522","repositories_listed":1,"syntology":null},{"url":"/paper/thuir-at-wsdm-cup-2023-task-1-unbiased","slug":"thuir-at-wsdm-cup-2023-task-1-unbiased","title":"THUIR at WSDM Cup 2023 Task 1: Unbiased Learning to Rank","date":"2023-04-25","arxiv_id":"2304.12650","repositories_listed":1,"syntology":null},{"url":"/paper/laser-language-specific-event-recommendation","slug":"laser-language-specific-event-recommendation","title":"LaSER: Language-Specific Event Recommendation","date":"2023-02-24","arxiv_id":"2303.04712","repositories_listed":1,"syntology":null},{"url":"/paper/lero-a-learning-to-rank-query-optimizer","slug":"lero-a-learning-to-rank-query-optimizer","title":"Lero: A Learning-to-Rank Query Optimizer","date":"2023-02-14","arxiv_id":"2302.06873","repositories_listed":1,"syntology":null},{"url":"/paper/passerrank-prediction-of-allosteric-sites","slug":"passerrank-prediction-of-allosteric-sites","title":"PASSerRank: Prediction of Allosteric Sites with Learning to Rank","date":"2023-02-02","arxiv_id":"2302.01117","repositories_listed":1,"syntology":null},{"url":"/paper/overcoming-prior-misspecification-in-online","slug":"overcoming-prior-misspecification-in-online","title":"Overcoming Prior Misspecification in Online Learning to Rank","date":"2023-01-25","arxiv_id":"2301.10651","repositories_listed":1,"syntology":null},{"url":"/paper/cosplade-contextualizing-splade-for","slug":"cosplade-contextualizing-splade-for","title":"CoSPLADE: Contextualizing SPLADE for Conversational Information Retrieval","date":"2023-01-11","arxiv_id":"2301.04413","repositories_listed":1,"syntology":null},{"url":"/paper/rankdnn-learning-to-rank-for-few-shot","slug":"rankdnn-learning-to-rank-for-few-shot","title":"RankDNN: Learning to Rank for Few-shot Learning","date":"2022-11-28","arxiv_id":"2211.15320","repositories_listed":1,"syntology":null},{"url":"/paper/rankcse-unsupervised-representation-learning","slug":"rankcse-unsupervised-representation-learning","title":"RankCSE: Unsupervised Representation Learning via Learning to Rank","date":"2022-11-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/supervised-metric-learning-for-retrieval-via","slug":"supervised-metric-learning-for-retrieval-via","title":"Supervised Metric Learning to Rank for Retrieval via Contextual Similarity Optimization","date":"2022-10-04","arxiv_id":"2210.01908","repositories_listed":1,"syntology":null},{"url":"/paper/imital-learned-active-learning-strategy-on","slug":"imital-learned-active-learning-strategy-on","title":"ImitAL: Learned Active Learning Strategy on Synthetic Data","date":"2022-08-24","arxiv_id":"2208.11636","repositories_listed":1,"syntology":null},{"url":"/paper/intersection-of-parallels-as-an-early","slug":"intersection-of-parallels-as-an-early","title":"Intersection of Parallels as an Early Stopping Criterion","date":"2022-08-19","arxiv_id":"2208.09529","repositories_listed":1,"syntology":null},{"url":"/paper/using-clarification-questions-to-improve-1","slug":"using-clarification-questions-to-improve-1","title":"Using clarification questions to improve software developers' Web search","date":"2022-07-26","arxiv_id":"2207.12768","repositories_listed":1,"syntology":null},{"url":"/paper/model-based-unbiased-learning-to-rank","slug":"model-based-unbiased-learning-to-rank","title":"Model-based Unbiased Learning to Rank","date":"2022-07-24","arxiv_id":"2207.11785","repositories_listed":1,"syntology":null},{"url":"/paper/a-general-framework-for-pairwise-unbiased","slug":"a-general-framework-for-pairwise-unbiased","title":"A General Framework for Pairwise Unbiased Learning to Rank","date":"2022-07-18","arxiv_id":"2207.08537","repositories_listed":1,"syntology":null}],"syntology_records":28,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":43,"papers_where_code_ran_first_page":"/task/learning-to-rank/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":8,"url":"/task/learning-to-rank/papers/2","json":"/task/learning-to-rank/papers/2.json","rows":100},{"order":"archive","page":3,"of":8,"url":"/task/learning-to-rank/papers/3","json":"/task/learning-to-rank/papers/3.json","rows":100},{"order":"archive","page":4,"of":8,"url":"/task/learning-to-rank/papers/4","json":"/task/learning-to-rank/papers/4.json","rows":100},{"order":"archive","page":5,"of":8,"url":"/task/learning-to-rank/papers/5","json":"/task/learning-to-rank/papers/5.json","rows":100},{"order":"archive","page":6,"of":8,"url":"/task/learning-to-rank/papers/6","json":"/task/learning-to-rank/papers/6.json","rows":100},{"order":"archive","page":7,"of":8,"url":"/task/learning-to-rank/papers/7","json":"/task/learning-to-rank/papers/7.json","rows":100},{"order":"archive","page":8,"of":8,"url":"/task/learning-to-rank/papers/8","json":"/task/learning-to-rank/papers/8.json","rows":53},{"order":"ran","page":1,"of":1,"url":"/task/learning-to-rank/papers/ran/1","json":"/task/learning-to-rank/papers/ran/1.json","rows":43}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"8bd71ed83eb9cb893c14b42a29f1a1df51f52f973631e40cee0bac576aa441c7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}