{"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/papers/2","list_of":"/task/learning-to-rank","task":"Learning-To-Rank","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":8,"rows_per_page":100,"rows":[101,200],"of":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":36,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":36,"listed_every_run_a_failure_of_syntologys_instrument":7,"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"},"first_page":"/task/learning-to-rank","prev":"/task/learning-to-rank","next":"/task/learning-to-rank/papers/3","papers":[{"url":"/paper/a-large-scale-search-dataset-for-unbiased","slug":"a-large-scale-search-dataset-for-unbiased","title":"A Large Scale Search Dataset for Unbiased Learning to Rank","date":"2022-07-07","arxiv_id":"2207.03051","repositories_listed":1,"syntology":null},{"url":"/paper/on-curriculum-learning-for-commonsense","slug":"on-curriculum-learning-for-commonsense","title":"On Curriculum Learning for Commonsense Reasoning","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/using-clarification-questions-to-improve","slug":"using-clarification-questions-to-improve","title":"Using clarification questions to improve software developers’ Web search","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-rationales-for-explainable","slug":"learning-to-rank-rationales-for-explainable","title":"Learning to Rank Rationales for Explainable Recommendation","date":"2022-06-10","arxiv_id":"2206.05368","repositories_listed":1,"syntology":null},{"url":"/paper/scalar-is-not-enough-vectorization-based","slug":"scalar-is-not-enough-vectorization-based","title":"Scalar is Not Enough: Vectorization-based Unbiased Learning to Rank","date":"2022-06-03","arxiv_id":"2206.01702","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":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) · 0 unverified","sample_list":"/paper/scalar-is-not-enough-vectorization-based#ran","syntology_url":"https://syntology.ai/paper/2206.01702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01702"}},"official":{"repos":["keytoyze/vectorization"],"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/ilmart-interpretable-ranking-with-constrained","slug":"ilmart-interpretable-ranking-with-constrained","title":"ILMART: Interpretable Ranking with Constrained LambdaMART","date":"2022-06-01","arxiv_id":"2206.00473","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-of-decision-tree-evaluation","slug":"optimization-of-decision-tree-evaluation","title":"Optimization of Decision Tree Evaluation Using SIMD Instructions","date":"2022-05-15","arxiv_id":"2205.07307","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-visual-stories-from-human-1","slug":"learning-to-rank-visual-stories-from-human-1","title":"Learning to Rank Visual Stories From Human Ranking Data","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-permutation-graph-search-black","slug":"probabilistic-permutation-graph-search-black","title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking","date":"2022-04-28","arxiv_id":"2204.13765","repositories_listed":1,"syntology":null},{"url":"/paper/groupwise-query-performance-prediction-with","slug":"groupwise-query-performance-prediction-with","title":"Groupwise Query Performance Prediction with BERT","date":"2022-04-25","arxiv_id":"2204.11489","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-at-the-speed-of-sampling","slug":"learning-to-rank-at-the-speed-of-sampling","title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity","date":"2022-04-22","arxiv_id":"2204.10872","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/learning-to-rank-at-the-speed-of-sampling#ran","syntology_url":"https://syntology.ai/paper/2204.10872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10872"}},"official":{"repos":["harrieo/2022-sigir-plackett-luce"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/is-non-iid-data-a-threat-in-federated-online","slug":"is-non-iid-data-a-threat-in-federated-online","title":"Is Non-IID Data a Threat in Federated Online Learning to Rank?","date":"2022-04-20","arxiv_id":"2204.09272","repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-top-k-learning-to-rank-with-causal","slug":"unbiased-top-k-learning-to-rank-with-causal","title":"Unbiased Top-k Learning to Rank with Causal Likelihood Decomposition","date":"2022-04-02","arxiv_id":"2204.00815","repositories_listed":1,"syntology":null},{"url":"/paper/unimodal-concentrated-loss-fully-adaptive","slug":"unimodal-concentrated-loss-fully-adaptive","title":"Unimodal-Concentrated Loss: Fully Adaptive Label Distribution Learning for Ordinal Regression","date":"2022-04-01","arxiv_id":"2204.00309","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":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) · 0 unverified","sample_list":"/paper/unimodal-concentrated-loss-fully-adaptive#ran","syntology_url":"https://syntology.ai/paper/2204.00309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00309"}},"official":null}},{"url":"/paper/doubly-robust-estimation-for-unbiased","slug":"doubly-robust-estimation-for-unbiased","title":"Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rank","date":"2022-03-31","arxiv_id":"2203.17118","repositories_listed":1,"syntology":null},{"url":"/paper/distilled-neural-networks-for-efficient","slug":"distilled-neural-networks-for-efficient","title":"Distilled Neural Networks for Efficient Learning to Rank","date":"2022-02-22","arxiv_id":"2202.10728","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-from-relevance-judgments","slug":"learning-to-rank-from-relevance-judgments","title":"Learning to Rank from Relevance Judgments Distributions","date":"2022-02-13","arxiv_id":"2202.06337","repositories_listed":1,"syntology":null},{"url":"/paper/ultra-fine-entity-typing-with-indirect","slug":"ultra-fine-entity-typing-with-indirect","title":"Ultra-fine Entity Typing with Indirect Supervision from Natural Language Inference","date":"2022-02-12","arxiv_id":"2202.06167","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-online-learning-to-rank-with","slug":"reinforcement-online-learning-to-rank-with","title":"Reinforcement Online Learning to Rank with Unbiased Reward Shaping","date":"2022-01-05","arxiv_id":"2201.01534","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-combinatorial-optimization-model","slug":"an-efficient-combinatorial-optimization-model","title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation","date":"2021-12-24","arxiv_id":"2201.00695","repositories_listed":1,"syntology":null},{"url":"/paper/predict-and-optimize-through-the-lens-of","slug":"predict-and-optimize-through-the-lens-of","title":"Decision-Focused Learning: Through the Lens of Learning to Rank","date":"2021-12-07","arxiv_id":"2112.03609","repositories_listed":1,"syntology":{"n":12,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/predict-and-optimize-through-the-lens-of#ran","syntology_url":"https://syntology.ai/paper/2112.03609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03609"}},"official":{"repos":["jayman91/ltr-predopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/unbiased-pairwise-learning-to-rank-in","slug":"unbiased-pairwise-learning-to-rank-in","title":"Unbiased Pairwise Learning to Rank in Recommender Systems","date":"2021-11-25","arxiv_id":"2111.12929","repositories_listed":1,"syntology":null},{"url":"/paper/assisting-the-human-fact-checkers-detecting","slug":"assisting-the-human-fact-checkers-detecting","title":"Assisting the Human Fact-Checkers: Detecting All Previously Fact-Checked Claims in a Document","date":"2021-09-14","arxiv_id":"2109.07410","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-based-correction-for-position-and","slug":"mixture-based-correction-for-position-and","title":"Mixture-Based Correction for Position and Trust Bias in Counterfactual Learning to Rank","date":"2021-08-19","arxiv_id":"2108.08538","repositories_listed":1,"syntology":null},{"url":"/paper/imital-learning-active-learning-strategies","slug":"imital-learning-active-learning-strategies","title":"ImitAL: Learning Active Learning Strategies from Synthetic Data","date":"2021-08-17","arxiv_id":"2108.07670","repositories_listed":1,"syntology":null},{"url":"/paper/acenas-learning-to-rank-ace-neural","slug":"acenas-learning-to-rank-ace-neural","title":"Learning to Rank Ace Neural Architectures via Normalized Discounted Cumulative Gain","date":"2021-08-06","arxiv_id":"2108.03001","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-words-optimizing-ranking","slug":"learning-to-rank-words-optimizing-ranking","title":"Learning to Rank Words: Optimizing Ranking Metrics for Word Spotting","date":"2021-06-09","arxiv_id":"2106.05144","repositories_listed":1,"syntology":null},{"url":"/paper/new-insights-into-metric-optimization-for","slug":"new-insights-into-metric-optimization-for","title":"New Insights into Metric Optimization for Ranking-based Recommendation","date":"2021-06-04","arxiv_id":"2106.02545","repositories_listed":1,"syntology":null},{"url":"/paper/zipf-matrix-factorization-matrix","slug":"zipf-matrix-factorization-matrix","title":"Zipf Matrix Factorization : Matrix Factorization with Matthew Effect Reduction","date":"2021-06-01","arxiv_id":"2106.07347","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-cross-sectional-currency-strategies","slug":"enhancing-cross-sectional-currency-strategies","title":"Enhancing Cross-Sectional Currency Strategies by Context-Aware Learning to Rank with Self-Attention","date":"2021-05-20","arxiv_id":"2105.10019","repositories_listed":1,"syntology":null},{"url":"/paper/smoothi-smooth-rank-indicators-for","slug":"smoothi-smooth-rank-indicators-for","title":"SmoothI: Smooth Rank Indicators for Differentiable IR Metrics","date":"2021-05-03","arxiv_id":"2105.00942","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-structured-objects-with-graph-neural","slug":"ranking-structured-objects-with-graph-neural","title":"Ranking Structured Objects with Graph Neural Networks","date":"2021-04-18","arxiv_id":"2104.08869","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-microphones-for-distant","slug":"learning-to-rank-microphones-for-distant","title":"Learning to Rank Microphones for Distant Speech Recognition","date":"2021-04-06","arxiv_id":"2104.02819","repositories_listed":1,"syntology":null},{"url":"/paper/pairrank-online-pairwise-learning-to-rank-by","slug":"pairrank-online-pairwise-learning-to-rank-by","title":"PairRank: Online Pairwise Learning to Rank by Divide-and-Conquer","date":"2021-02-28","arxiv_id":"2103.00368","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-marginal-fairness-for-dynamic","slug":"maximizing-marginal-fairness-for-dynamic","title":"Maximizing Marginal Fairness for Dynamic Learning to Rank","date":"2021-02-18","arxiv_id":"2102.09670","repositories_listed":1,"syntology":null},{"url":"/paper/neuralndcg-direct-optimisation-of-a-ranking","slug":"neuralndcg-direct-optimisation-of-a-ranking","title":"NeuralNDCG: Direct Optimisation of a Ranking Metric via Differentiable Relaxation of Sorting","date":"2021-02-15","arxiv_id":"2102.07831","repositories_listed":1,"syntology":null},{"url":"/paper/robust-generalization-and-safe-query","slug":"robust-generalization-and-safe-query","title":"Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rank","date":"2021-02-11","arxiv_id":"2102.05990","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-calibration-and-uncertainty-of-neural","slug":"on-the-calibration-and-uncertainty-of-neural","title":"On the Calibration and Uncertainty of Neural Learning to Rank Models","date":"2021-01-12","arxiv_id":"2101.04356","repositories_listed":1,"syntology":null},{"url":"/paper/metric-learning-for-session-based","slug":"metric-learning-for-session-based","title":"Metric Learning for Session-based Recommendations","date":"2021-01-07","arxiv_id":"2101.02655","repositories_listed":1,"syntology":null},{"url":"/paper/meta-adaptive-neural-ranking-with-contrastive","slug":"meta-adaptive-neural-ranking-with-contrastive","title":"Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision","date":"2020-12-29","arxiv_id":"2012.14862","repositories_listed":1,"syntology":null},{"url":"/paper/autoregressive-reasoning-over-chains-of-facts","slug":"autoregressive-reasoning-over-chains-of-facts","title":"Autoregressive Reasoning over Chains of Facts with Transformers","date":"2020-12-17","arxiv_id":"2012.11321","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-label-smoothing","slug":"weakly-supervised-label-smoothing","title":"Weakly Supervised Label Smoothing","date":"2020-12-15","arxiv_id":"2012.08575","repositories_listed":1,"syntology":null},{"url":"/paper/pirank-learning-to-rank-via-differentiable","slug":"pirank-learning-to-rank-via-differentiable","title":"PiRank: Scalable Learning To Rank via Differentiable Sorting","date":"2020-12-12","arxiv_id":"2012.06731","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-online-and-counterfactual-learning","slug":"unifying-online-and-counterfactual-learning","title":"Unifying Online and Counterfactual Learning to Rank","date":"2020-12-08","arxiv_id":"2012.04426","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-fine-grained-cross-lingual-semantic","slug":"detecting-fine-grained-cross-lingual-semantic","title":"Detecting Fine-Grained Cross-Lingual Semantic Divergences without Supervision by Learning to Rank","date":"2020-10-07","arxiv_id":"2010.03662","repositories_listed":1,"syntology":null},{"url":"/paper/pt-ranking-a-benchmarking-platform-for-neural","slug":"pt-ranking-a-benchmarking-platform-for-neural","title":"PT-Ranking: A Benchmarking Platform for Neural Learning-to-Rank","date":"2020-08-31","arxiv_id":"2008.13368","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pt-ranking-a-benchmarking-platform-for-neural#ran","syntology_url":"https://syntology.ai/paper/2008.13368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13368"}},"official":{"repos":["wildltr/ptranking"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/when-inverse-propensity-scoring-does-not-work","slug":"when-inverse-propensity-scoring-does-not-work","title":"When Inverse Propensity Scoring does not Work: Affine Corrections for Unbiased Learning to Rank","date":"2020-08-24","arxiv_id":"2008.10242","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-multivariate-scoring-functions","slug":"analysis-of-multivariate-scoring-functions","title":"Analysis of Multivariate Scoring Functions for Automatic Unbiased Learning to Rank","date":"2020-08-20","arxiv_id":"2008.09061","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-experts-category-hierarchy-soft","slug":"mixture-of-experts-category-hierarchy-soft","title":"Adversarial Mixture Of Experts with Category Hierarchy Soft Constraint","date":"2020-07-24","arxiv_id":"2007.12349","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-learning-to-rank-using","slug":"counterfactual-learning-to-rank-using","title":"Counterfactual Learning to Rank using Heterogeneous Treatment Effect Estimation","date":"2020-07-19","arxiv_id":"2007.09798","repositories_listed":1,"syntology":null},{"url":"/paper/serank-optimize-sequencewise-learning-to-rank","slug":"serank-optimize-sequencewise-learning-to-rank","title":"SERank: Optimize Sequencewise Learning to Rank Using Squeeze-and-Excitation Network","date":"2020-06-07","arxiv_id":"2006.04084","repositories_listed":1,"syntology":null},{"url":"/paper/controlling-fairness-and-bias-in-dynamic","slug":"controlling-fairness-and-bias-in-dynamic","title":"Controlling Fairness and Bias in Dynamic Learning-to-Rank","date":"2020-05-29","arxiv_id":"2005.14713","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-blind-image-quality","slug":"uncertainty-aware-blind-image-quality","title":"Uncertainty-Aware Blind Image Quality Assessment in the Laboratory and Wild","date":"2020-05-28","arxiv_id":"2005.13983","repositories_listed":1,"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":1,"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/uncertainty-aware-blind-image-quality#ran","syntology_url":"https://syntology.ai/paper/2005.13983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13983"}},"official":{"repos":["zwx8981/UNIQUE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/l2r2-leveraging-ranking-for-abductive","slug":"l2r2-leveraging-ranking-for-abductive","title":"L2R2: Leveraging Ranking for Abductive Reasoning","date":"2020-05-22","arxiv_id":"2005.11223","repositories_listed":1,"syntology":null},{"url":"/paper/accelerated-convergence-for-counterfactual","slug":"accelerated-convergence-for-counterfactual","title":"Accelerated Convergence for Counterfactual Learning to Rank","date":"2020-05-21","arxiv_id":"2005.10615","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-learning-to-rank-with-self","slug":"context-aware-learning-to-rank-with-self","title":"Context-Aware Learning to Rank with Self-Attention","date":"2020-05-20","arxiv_id":"2005.10084","repositories_listed":1,"syntology":null},{"url":"/paper/policy-aware-unbiased-learning-to-rank-for","slug":"policy-aware-unbiased-learning-to-rank-for","title":"Policy-Aware Unbiased Learning to Rank for Top-k Rankings","date":"2020-05-18","arxiv_id":"2005.09035","repositories_listed":1,"syntology":null},{"url":"/paper/ract-toward-amortized-ranking-critical","slug":"ract-toward-amortized-ranking-critical","title":"RaCT: Toward Amortized Ranking-Critical Training For Collaborative Filtering","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-entity-typing-via-multi-level","slug":"hierarchical-entity-typing-via-multi-level","title":"Hierarchical Entity Typing via Multi-level Learning to Rank","date":"2020-04-05","arxiv_id":"2004.02286","repositories_listed":1,"syntology":null},{"url":"/paper/a-recurrent-model-for-collective-entity","slug":"a-recurrent-model-for-collective-entity","title":"A Recurrent Model for Collective Entity Linking with Adaptive Features","date":"2020-04-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/trec-cast-2019-the-conversational-assistance","slug":"trec-cast-2019-the-conversational-assistance","title":"TREC CAsT 2019: The Conversational Assistance Track Overview","date":"2020-03-30","arxiv_id":"2003.13624","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-boosting-neural-networks-grownet","slug":"gradient-boosting-neural-networks-grownet","title":"Gradient Boosting Neural Networks: GrowNet","date":"2020-02-19","arxiv_id":"2002.07971","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"3 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-boosting-neural-networks-grownet#ran","syntology_url":"https://syntology.ai/paper/2002.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07971"}},"official":{"repos":["sbadirli/GrowNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-exploration-for-optimizing-contextual","slug":"safe-exploration-for-optimizing-contextual","title":"Safe Exploration for Optimizing Contextual Bandits","date":"2020-02-02","arxiv_id":"2002.00467","repositories_listed":1,"syntology":null},{"url":"/paper/selective-weak-supervision-for-neural","slug":"selective-weak-supervision-for-neural","title":"Selective Weak Supervision for Neural Information Retrieval","date":"2020-01-28","arxiv_id":"2001.10382","repositories_listed":1,"syntology":null},{"url":"/paper/listwise-learning-to-rank-by-exploring-unique","slug":"listwise-learning-to-rank-by-exploring-unique","title":"Listwise Learning to Rank by Exploring Unique Ratings","date":"2020-01-07","arxiv_id":"2001.01828","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/listwise-learning-to-rank-by-exploring-unique#ran","syntology_url":"https://syntology.ai/paper/2001.01828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01828"}},"official":{"repos":["XiaofengZhu/uRank_uMart"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/duet-at-trec-2019-deep-learning-track","slug":"duet-at-trec-2019-deep-learning-track","title":"Duet at TREC 2019 Deep Learning Track","date":"2019-12-10","arxiv_id":"1912.04471","repositories_listed":1,"syntology":null},{"url":"/paper/fair-learning-to-rank-from-implicit-feedback","slug":"fair-learning-to-rank-from-implicit-feedback","title":"Policy-Gradient Training of Fair and Unbiased Ranking Functions","date":"2019-11-19","arxiv_id":"1911.08054","repositories_listed":1,"syntology":null},{"url":"/paper/select-answer-and-explain-interpretable-multi","slug":"select-answer-and-explain-interpretable-multi","title":"Select, Answer and Explain: Interpretable Multi-hop Reading Comprehension over Multiple Documents","date":"2019-11-01","arxiv_id":"1911.00484","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/select-answer-and-explain-interpretable-multi#ran","syntology_url":"https://syntology.ai/paper/1911.00484","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00484"}},"official":null}},{"url":"/paper/automatic-quality-estimation-for-natural","slug":"automatic-quality-estimation-for-natural","title":"Automatic Quality Estimation for Natural Language Generation: Ranting (Jointly Rating and Ranking)","date":"2019-10-10","arxiv_id":"1910.04731","repositories_listed":1,"syntology":null},{"url":"/paper/pairwise-learning-to-rank-by-neural-networks","slug":"pairwise-learning-to-rank-by-neural-networks","title":"Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance","date":"2019-09-06","arxiv_id":"1909.02768","repositories_listed":1,"syntology":null},{"url":"/paper/fairy-a-framework-for-understanding","slug":"fairy-a-framework-for-understanding","title":"FAIRY: A Framework for Understanding Relationships between Users' Actions and their Social Feeds","date":"2019-08-08","arxiv_id":"1908.03109","repositories_listed":1,"syntology":null},{"url":"/paper/reward-learning-for-efficient-reinforcement","slug":"reward-learning-for-efficient-reinforcement","title":"Reward Learning for Efficient Reinforcement Learning in Extractive Document Summarisation","date":"2019-07-30","arxiv_id":"1907.12894","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":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) · 0 unverified","sample_list":"/paper/reward-learning-for-efficient-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1907.12894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12894"}},"official":{"repos":["UKPLab/ijcai2019-relis"],"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/counterfactual-learning-from-logs-for","slug":"counterfactual-learning-from-logs-for","title":"Mend The Learning Approach, Not the Data: Insights for Ranking E-Commerce Products","date":"2019-07-24","arxiv_id":"1907.10409","repositories_listed":1,"syntology":null},{"url":"/paper/pnovo-3-precise-de-novo-peptide-sequencing","slug":"pnovo-3-precise-de-novo-peptide-sequencing","title":"pNovo 3: precise de novo peptide sequencing using a learning-to-rank framework","date":"2019-07-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-blindly-assess-image-quality-in","slug":"learning-to-blindly-assess-image-quality-in","title":"Learning to Blindly Assess Image Quality in the Laboratory and Wild","date":"2019-07-01","arxiv_id":"1907.00516","repositories_listed":1,"syntology":null},{"url":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","repositories_listed":1,"syntology":null},{"url":"/paper/deep-metric-learning-to-rank","slug":"deep-metric-learning-to-rank","title":"Deep Metric Learning to Rank","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/uncoupled-regression-from-pairwise-comparison","slug":"uncoupled-regression-from-pairwise-comparison","title":"Uncoupled Regression from Pairwise Comparison Data","date":"2019-05-31","arxiv_id":"1905.13659","repositories_listed":1,"syntology":null},{"url":"/paper/joint-optimization-of-cascade-ranking-models","slug":"joint-optimization-of-cascade-ranking-models","title":"Joint Optimization of Cascade Ranking Models","date":"2019-02-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/policy-learning-for-fairness-in-ranking","slug":"policy-learning-for-fairness-in-ranking","title":"Policy Learning for Fairness in Ranking","date":"2019-02-11","arxiv_id":"1902.04056","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/policy-learning-for-fairness-in-ranking#ran","syntology_url":"https://syntology.ai/paper/1902.04056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04056"}},"official":{"repos":["ashudeep/Fair-PGRank"],"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/opportunistic-learning-budgeted-cost","slug":"opportunistic-learning-budgeted-cost","title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams","date":"2019-01-02","arxiv_id":"1901.00243","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/opportunistic-learning-budgeted-cost#ran","syntology_url":"https://syntology.ai/paper/1901.00243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00243"}},"official":{"repos":["mkachuee/Opportunistic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-query-graphs-for-complex","slug":"learning-to-rank-query-graphs-for-complex","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","date":"2018-11-02","arxiv_id":"1811.01118","repositories_listed":1,"syntology":null},{"url":"/paper/entity-linking-within-a-social-media-platform","slug":"entity-linking-within-a-social-media-platform","title":"Entity Linking within a Social Media Platform: A Case Study on Yelp","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-unbiased-online-learning-to","slug":"differentiable-unbiased-online-learning-to","title":"Differentiable Unbiased Online Learning to Rank","date":"2018-09-22","arxiv_id":"1809.08415","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-distillation-learning-compact-ranking","slug":"ranking-distillation-learning-compact-ranking","title":"Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender System","date":"2018-09-19","arxiv_id":"1809.07428","repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-lambdamart-an-unbiased-pairwise","slug":"unbiased-lambdamart-an-unbiased-pairwise","title":"Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm","date":"2018-09-16","arxiv_id":"1809.05818","repositories_listed":1,"syntology":null},{"url":"/paper/exact-passive-aggressive-algorithms-for","slug":"exact-passive-aggressive-algorithms-for","title":"Exact Passive-Aggressive Algorithms for Learning to Rank Using Interval Labels","date":"2018-08-18","arxiv_id":"1808.06107","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-for-censored-survival-data","slug":"learning-to-rank-for-censored-survival-data","title":"Learning to rank for censored survival data","date":"2018-06-06","arxiv_id":"1806.01984","repositories_listed":1,"syntology":null},{"url":"/paper/distractor-generation-for-multiple-choice","slug":"distractor-generation-for-multiple-choice","title":"Distractor Generation for Multiple Choice Questions Using Learning to Rank","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ranking-for-relevance-and-display-preferences","slug":"ranking-for-relevance-and-display-preferences","title":"Ranking for Relevance and Display Preferences in Complex Presentation Layouts","date":"2018-05-07","arxiv_id":"1805.02404","repositories_listed":1,"syntology":null},{"url":"/paper/180405938","slug":"180405938","title":"Unbiased Learning to Rank with Unbiased Propensity Estimation","date":"2018-04-16","arxiv_id":"1804.05938","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/180405938#ran","syntology_url":"https://syntology.ai/paper/1804.05938","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05938"}},"official":{"repos":["QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-a-deep-listwise-context-model-for","slug":"learning-a-deep-listwise-context-model-for","title":"Learning a Deep Listwise Context Model for Ranking Refinement","date":"2018-04-16","arxiv_id":"1804.05936","repositories_listed":1,"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/learning-a-deep-listwise-context-model-for#ran","syntology_url":"https://syntology.ai/paper/1804.05936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05936"}},"official":{"repos":["QingyaoAi/Deep-Listwise-Context-Model-for-Ranking-Refinement"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/unsupervised-cross-dataset-person-re","slug":"unsupervised-cross-dataset-person-re","title":"Unsupervised Cross-dataset Person Re-identification by Transfer Learning of Spatial-Temporal Patterns","date":"2018-03-20","arxiv_id":"1803.07293","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-unlabeled-data-for-crowd-counting","slug":"leveraging-unlabeled-data-for-crowd-counting","title":"Leveraging Unlabeled Data for Crowd Counting by Learning to Rank","date":"2018-03-08","arxiv_id":"1803.03095","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-to-rank-in-e-commerce","slug":"reinforcement-learning-to-rank-in-e-commerce","title":"Reinforcement Learning to Rank in E-Commerce Search Engine: Formalization, Analysis, and Application","date":"2018-03-02","arxiv_id":"1803.00710","repositories_listed":1,"syntology":null},{"url":"/paper/prune-preserving-proximity-and-global-ranking","slug":"prune-preserving-proximity-and-global-ranking","title":"PRUNE: Preserving Proximity and Global Ranking for Network Embedding","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/balancing-speed-and-quality-in-online","slug":"balancing-speed-and-quality-in-online","title":"Balancing Speed and Quality in Online Learning to Rank for Information Retrieval","date":"2017-11-26","arxiv_id":"1711.09446","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-label-ambiguity-for-neural-list-wise","slug":"modeling-label-ambiguity-for-neural-list-wise","title":"Modeling Label Ambiguity for Neural List-Wise Learning to Rank","date":"2017-07-24","arxiv_id":"1707.07493","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-question-answer-pairs-with","slug":"learning-to-rank-question-answer-pairs-with","title":"Learning to Rank Question Answer Pairs with Holographic Dual LSTM Architecture","date":"2017-07-20","arxiv_id":"1707.06372","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-neural-ad-hoc-ranking-with-kernel","slug":"end-to-end-neural-ad-hoc-ranking-with-kernel","title":"End-to-End Neural Ad-hoc Ranking with Kernel Pooling","date":"2017-06-20","arxiv_id":"1706.06613","repositories_listed":1,"syntology":null}],"record_sha256":"e52070f5897e21c38541ea0a9995f62611692cb894d8baef76106446f8ba808e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}