{"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/3","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":3,"pages_in_order":8,"rows_per_page":100,"rows":[201,300],"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/papers/2","next":"/task/learning-to-rank/papers/4","papers":[{"url":"/paper/hashing-as-tie-aware-learning-to-rank","slug":"hashing-as-tie-aware-learning-to-rank","title":"Hashing as Tie-Aware Learning to Rank","date":"2017-05-23","arxiv_id":"1705.08562","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-using-localized-geometric","slug":"learning-to-rank-using-localized-geometric","title":"Learning to Rank Using Localized Geometric Mean Metrics","date":"2017-05-22","arxiv_id":"1705.07563","repositories_listed":1,"syntology":null},{"url":"/paper/using-titles-vs-full-text-as-source-for","slug":"using-titles-vs-full-text-as-source-for","title":"Using Titles vs. Full-text as Source for Automated Semantic Document Annotation","date":"2017-05-15","arxiv_id":"1705.05311","repositories_listed":1,"syntology":null},{"url":"/paper/match-tensor-a-deep-relevance-model-for","slug":"match-tensor-a-deep-relevance-model-for","title":"Match-Tensor: a Deep Relevance Model for Search","date":"2017-01-26","arxiv_id":"1701.07795","repositories_listed":1,"syntology":null},{"url":"/paper/quantitative-analysis-of-automatic-image","slug":"quantitative-analysis-of-automatic-image","title":"Quantitative Analysis of Automatic Image Cropping Algorithms: A Dataset and Comparative Study","date":"2017-01-05","arxiv_id":"1701.01480","repositories_listed":1,"syntology":null},{"url":"/paper/off-policy-evaluation-for-slate","slug":"off-policy-evaluation-for-slate","title":"Off-policy evaluation for slate recommendation","date":"2016-05-16","arxiv_id":"1605.04812","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":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/off-policy-evaluation-for-slate#ran","syntology_url":"https://syntology.ai/paper/1605.04812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.04812"}},"official":{"repos":["adith387/slates_semisynth_expts"],"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/dcm-bandits-learning-to-rank-with-multiple","slug":"dcm-bandits-learning-to-rank-with-multiple","title":"DCM Bandits: Learning to Rank with Multiple Clicks","date":"2016-02-09","arxiv_id":"1602.03146","repositories_listed":1,"syntology":null},{"url":"/paper/rank-pooling-for-action-recognition","slug":"rank-pooling-for-action-recognition","title":"Rank Pooling for Action Recognition","date":"2015-12-06","arxiv_id":"1512.01848","repositories_listed":1,"syntology":null},{"url":"/paper/more-accurate-question-answering-on-freebase","slug":"more-accurate-question-answering-on-freebase","title":"More Accurate Question Answering on Freebase","date":"2015-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/beer-11-illc-uva-submission-to-metrics-and","slug":"beer-11-illc-uva-submission-to-metrics-and","title":"BEER 1.1: ILLC UvA submission to metrics and tuning task","date":"2015-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-explain-entity-relationships-in","slug":"learning-to-explain-entity-relationships-in","title":"Learning to Explain Entity Relationships in Knowledge Graphs","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/contextual-semibandits-via-supervised","slug":"contextual-semibandits-via-supervised","title":"Contextual Semibandits via Supervised Learning Oracles","date":"2015-02-20","arxiv_id":"1502.05890","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/contextual-semibandits-via-supervised#ran","syntology_url":"https://syntology.ai/paper/1502.05890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05890"}},"official":{"repos":["akshaykr/oracle_cb"],"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/fitting-sentence-level-translation-evaluation","slug":"fitting-sentence-level-translation-evaluation","title":"Fitting Sentence Level Translation Evaluation with Many Dense Features","date":"2014-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"towards-two-stage-counterfactual-learning-to","title":"Towards Two-Stage Counterfactual Learning to Rank","date":"2025-06-25","arxiv_id":"2506.20854","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-abstention-pairwise-learning-to-rank","title":"Bounded-Abstention Pairwise Learning to Rank","date":"2025-05-29","arxiv_id":"2505.23437","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-chain-of-thought-an-energy","title":"Learning to Rank Chain-of-Thought: An Energy-Based Approach with Outcome Supervision","date":"2025-05-21","arxiv_id":"2505.14999","repositories_listed":0,"syntology":null},{"url":"/paper/2505-10940","slug":"2505-10940","title":"Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation","date":"2025-05-16","arxiv_id":"2505.10940","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/2505-10940#ran","syntology_url":"https://syntology.ai/paper/2505.10940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10940"}},"official":null}},{"url":null,"slug":"beyond-pairwise-learning-to-rank-at-airbnb","title":"Beyond Pairwise Learning-To-Rank At Airbnb","date":"2025-05-14","arxiv_id":"2505.09795","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generative-re-ranking-model-for-list-level","title":"A Generative Re-ranking Model for List-level Multi-objective Optimization at Taobao","date":"2025-05-12","arxiv_id":"2505.07197","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-qr-enhancing-fairness-aware-information","title":"FAIR-QR: Enhancing Fairness-aware Information Retrieval through Query Refinement","date":"2025-03-27","arxiv_id":"2503.21092","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-context-modeling-with-ranked-memory","title":"Long Context Modeling with Ranked Memory-Augmented Retrieval","date":"2025-03-19","arxiv_id":"2503.14800","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-supervision-for-improved-precision-in","title":"Weak Supervision for Improved Precision in Search Systems","date":"2025-03-10","arxiv_id":"2503.07025","repositories_listed":0,"syntology":null},{"url":null,"slug":"entailment-preserving-first-order-logic","title":"Entailment-Preserving First-order Logic Representations in Natural Language Entailment","date":"2025-02-24","arxiv_id":"2502.16757","repositories_listed":0,"syntology":null},{"url":null,"slug":"cascading-bandits-robust-to-adversarial","title":"Cascading Bandits Robust to Adversarial Corruptions","date":"2025-02-12","arxiv_id":"2502.08077","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-learning-for-combinatorial-multi","title":"Offline Learning for Combinatorial Multi-armed Bandits","date":"2025-01-31","arxiv_id":"2501.19300","repositories_listed":0,"syntology":null},{"url":null,"slug":"reqo-a-robust-and-explainable-query","title":"Reqo: A Robust and Explainable Query Optimization Cost Model","date":"2025-01-29","arxiv_id":"2501.17414","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-support-ticket-resolution-using","title":"Efficient support ticket resolution using Knowledge Graphs","date":"2024-12-31","arxiv_id":"2501.00461","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-pre-trained-vision-language","title":"Learning to Rank Pre-trained Vision-Language Models for Downstream Tasks","date":"2024-12-30","arxiv_id":"2412.20682","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-and-secure-federated-online","title":"Effective and secure federated online learning to rank","date":"2024-12-26","arxiv_id":"2412.19069","repositories_listed":0,"syntology":null},{"url":null,"slug":"gabar-graph-attention-based-action-ranking","title":"GABAR: Graph Attention-Based Action Ranking for Relational Policy Learning","date":"2024-12-06","arxiv_id":"2412.04752","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-versatile-influence-function-for-data","title":"A Versatile Influence Function for Data Attribution with Non-Decomposable Loss","date":"2024-12-02","arxiv_id":"2412.01335","repositories_listed":0,"syntology":null},{"url":null,"slug":"iclerb-in-context-learning-embedding-and","title":"ICLERB: In-Context Learning Embedding and Reranker Benchmark","date":"2024-11-28","arxiv_id":"2411.18947","repositories_listed":0,"syntology":null},{"url":null,"slug":"leadre-multi-faceted-knowledge-enhanced-llm","title":"LEADRE: Multi-Faceted Knowledge Enhanced LLM Empowered Display Advertisement Recommender System","date":"2024-11-21","arxiv_id":"2411.13789","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-e-commerce-learning-to-rank","title":"A Survey on E-Commerce Learning to Rank","date":"2024-11-19","arxiv_id":"2412.03581","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-early-first-reproduction-and-improvements","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking","date":"2024-11-08","arxiv_id":"2411.05508","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-salient-content-for-query","title":"Learning to Rank Salient Content for Query-focused Summarization","date":"2024-11-01","arxiv_id":"2411.00324","repositories_listed":0,"syntology":null},{"url":null,"slug":"don-t-just-pay-attention-plant-it-transfer","title":"Don't Just Pay Attention, PLANT It: Transfer L2R Models to Fine-tune Attention in Extreme Multi-Label Text Classification","date":"2024-10-30","arxiv_id":"2410.23066","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-preference-alignment-with","title":"Optimizing Preference Alignment with Differentiable NDCG Ranking","date":"2024-10-17","arxiv_id":"2410.18127","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-multiple-retrieval","title":"Learning to Rank for Multiple Retrieval-Augmented Models through Iterative Utility Maximization","date":"2024-10-13","arxiv_id":"2410.09942","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperdpo-hypernetwork-based-multi-objective","title":"COS-DPO: Conditioned One-Shot Multi-Objective Fine-Tuning Framework","date":"2024-10-10","arxiv_id":"2410.08316","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayescns-a-unified-bayesian-approach-to","title":"BayesCNS: A Unified Bayesian Approach to Address Cold Start and Non-Stationarity in Search Systems at Scale","date":"2024-10-03","arxiv_id":"2410.02126","repositories_listed":0,"syntology":null},{"url":null,"slug":"scale-invariant-learning-to-rank","title":"Scale-Invariant Learning-to-Rank","date":"2024-10-02","arxiv_id":"2410.01959","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-to-rank-for-sparsely-supervised","title":"Meta Learning to Rank for Sparsely Supervised Queries","date":"2024-09-29","arxiv_id":"2409.19548","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pointwise-pairwise-learning-to-rank","title":"Efficient Pointwise-Pairwise Learning-to-Rank for News Recommendation","date":"2024-09-26","arxiv_id":"2409.17711","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-more-relevant-product-search-ranking","title":"Towards More Relevant Product Search Ranking Via Large Language Models: An Empirical Study","date":"2024-09-26","arxiv_id":"2409.17460","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-pre-trained-ranking-model-with","title":"Generative Pre-trained Ranking Model with Over-parameterization at Web-Scale (Extended Abstract)","date":"2024-09-25","arxiv_id":"2409.16594","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-trained-graphformer-based-ranking-at-web","title":"Pre-trained Graphformer-based Ranking at Web-scale Search (Extended Abstract)","date":"2024-09-25","arxiv_id":"2409.16590","repositories_listed":0,"syntology":null},{"url":null,"slug":"linkage-listwise-ranking-among-varied-quality","title":"LINKAGE: Listwise Ranking among Varied-Quality References for Non-Factoid QA Evaluation via LLMs","date":"2024-09-23","arxiv_id":"2409.14744","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-effects-of-the-baidu-ultr","title":"Understanding the Effects of the Baidu-ULTR Logging Policy on Two-Tower Models","date":"2024-09-18","arxiv_id":"2409.12043","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-ranking-content-providers","title":"A Framework for Ranking Content Providers Using Prompt Engineering and Self-Attention Network","date":"2024-09-17","arxiv_id":"2409.11511","repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-ranking-policy-optimization-for","title":"Proximal Ranking Policy Optimization for Practical Safety in Counterfactual Learning to Rank","date":"2024-09-15","arxiv_id":"2409.09881","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-bayesian-active-learning-to-rank-with","title":"Deep Bayesian Active Learning-to-Rank with Relative Annotation for Estimation of Ulcerative Colitis Severity","date":"2024-09-08","arxiv_id":"2409.04952","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroshot-listwise-learning-to-rank-algorithm","title":"Zeroshot Listwise Learning to Rank Algorithm for Recommendation","date":"2024-09-05","arxiv_id":"2409.13703","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-variational-adversarial","title":"Semi-Supervised Variational Adversarial Active Learning via Learning to Rank and Agreement-Based Pseudo Labeling","date":"2024-08-23","arxiv_id":"2408.12774","repositories_listed":0,"syntology":null},{"url":null,"slug":"baby-bear-seeking-a-just-right-rating-scale","title":"Baby Bear: Seeking a Just Right Rating Scale for Scalar Annotations","date":"2024-08-19","arxiv_id":"2408.09765","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-dual-learning-algorithm-with","title":"Contextual Dual Learning Algorithm with Listwise Distillation for Unbiased Learning to Rank","date":"2024-08-19","arxiv_id":"2408.09817","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-across-different-content-types-the","title":"Ranking Across Different Content Types: The Robust Beauty of Multinomial Blending","date":"2024-08-17","arxiv_id":"2408.09168","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-judgment-formulation-for-semantic","title":"Pairwise Judgment Formulation for Semantic Embedding Model in Web Search","date":"2024-08-08","arxiv_id":"2408.04197","repositories_listed":0,"syntology":null},{"url":null,"slug":"set2seq-transformer-learning-permutation","title":"Set2Seq Transformer: Learning Permutation Aware Set Representations of Artistic Sequences","date":"2024-08-06","arxiv_id":"2408.03404","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-and-robust-safety-guarantees-for","title":"Practical and Robust Safety Guarantees for Advanced Counterfactual Learning to Rank","date":"2024-07-29","arxiv_id":"2407.19943","repositories_listed":0,"syntology":null},{"url":null,"slug":"modrl-ta-a-multi-objective-deep-reinforcement","title":"MODRL-TA:A Multi-Objective Deep Reinforcement Learning Framework for Traffic Allocation in E-Commerce Search","date":"2024-07-22","arxiv_id":"2407.15476","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-learning-to-rank-by-model","title":"Multi-objective Learning to Rank by Model Distillation","date":"2024-07-09","arxiv_id":"2407.07181","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-domain-specialisation-for-single-model","title":"Deep Domain Specialisation for single-model multi-domain learning to rank","date":"2024-07-01","arxiv_id":"2407.01069","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-search-engine-services-meet-large","title":"When Search Engine Services meet Large Language Models: Visions and Challenges","date":"2024-06-28","arxiv_id":"2407.00128","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-maps-at-airbnb","title":"Learning to Rank for Maps at Airbnb","date":"2024-06-25","arxiv_id":"2407.00091","repositories_listed":0,"syntology":null},{"url":null,"slug":"pistis-rag-a-scalable-cascading-framework","title":"Pistis-RAG: Enhancing Retrieval-Augmented Generation with Human Feedback","date":"2024-06-21","arxiv_id":"2407.00072","repositories_listed":0,"syntology":null},{"url":null,"slug":"mrrank-improving-question-answering-retrieval","title":"MrRank: Improving Question Answering Retrieval System through Multi-Result Ranking Model","date":"2024-06-09","arxiv_id":"2406.05733","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-explainable-test-case-prioritisation","title":"Towards Explainable Test Case Prioritisation with Learning-to-Rank Models","date":"2024-05-22","arxiv_id":"2405.13786","repositories_listed":0,"syntology":null},{"url":null,"slug":"gotfunding-a-grant-recommendation-system","title":"GotFunding: A grant recommendation system based on scientific articles","date":"2024-05-21","arxiv_id":"2405.12840","repositories_listed":0,"syntology":null},{"url":null,"slug":"full-stage-learning-to-rank-a-unified","title":"Full Stage Learning to Rank: A Unified Framework for Multi-Stage Systems","date":"2024-05-08","arxiv_id":"2405.04844","repositories_listed":0,"syntology":null},{"url":null,"slug":"metalearners-for-ranking-treatment-effects","title":"Metalearners for Ranking Treatment Effects","date":"2024-05-03","arxiv_id":"2405.02183","repositories_listed":0,"syntology":null},{"url":null,"slug":"rankshap-a-gold-standard-feature-attribution","title":"RankSHAP: Shapley Value Based Feature Attributions for Learning to Rank","date":"2024-05-03","arxiv_id":"2405.01848","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-responsible-adaptation-of-large","title":"Efficient and Responsible Adaptation of Large Language Models for Robust Top-k Recommendations","date":"2024-05-01","arxiv_id":"2405.00824","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-quantum-circuits-for","title":"Learning to rank quantum circuits for hardware-optimized performance enhancement","date":"2024-04-09","arxiv_id":"2404.06535","repositories_listed":0,"syntology":null},{"url":null,"slug":"chiplet-placement-order-exploration-based-on","title":"Chiplet Placement Order Exploration Based on Learning to Rank with Graph Representation","date":"2024-04-07","arxiv_id":"2404.04943","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-an-in-depth-comprehension-of-case","title":"Towards an In-Depth Comprehension of Case Relevance for Better Legal Retrieval","date":"2024-04-01","arxiv_id":"2404.00947","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fair-ranking-policies-via","title":"Learning Fair Ranking Policies via Differentiable Optimization of Ordered Weighted Averages","date":"2024-02-07","arxiv_id":"2402.05252","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-the-efficiency-of-protein-language","title":"Enhancing the efficiency of protein language models with minimal wet-lab data through few-shot learning","date":"2024-02-03","arxiv_id":"2402.02004","repositories_listed":0,"syntology":null},{"url":null,"slug":"inforank-unbiased-learning-to-rank-via","title":"InfoRank: Unbiased Learning-to-Rank via Conditional Mutual Information Minimization","date":"2024-01-23","arxiv_id":"2401.12553","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-off-policy-reinforcement-learning-for","title":"Towards Off-Policy Reinforcement Learning for Ranking Policies with Human Feedback","date":"2024-01-17","arxiv_id":"2401.08959","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-nested-feedback","title":"Learning-to-Rank with Nested Feedback","date":"2024-01-08","arxiv_id":"2401.04053","repositories_listed":0,"syntology":null},{"url":null,"slug":"fsscore-a-machine-learning-based-synthetic","title":"FSscore: A Machine Learning-based Synthetic Feasibility Score Leveraging Human Expertise","date":"2023-12-20","arxiv_id":"2312.12737","repositories_listed":0,"syntology":null},{"url":null,"slug":"alexr-optimal-single-loop-algorithms-for","title":"A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization","date":"2023-12-04","arxiv_id":"2312.02277","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-learning-to-rank-with-position-based","title":"Bandit Learning to Rank with Position-Based Click Models: Personalized and Equal Treatments","date":"2023-11-08","arxiv_id":"2311.04528","repositories_listed":0,"syntology":null},{"url":null,"slug":"sortnet-learning-to-rank-by-a-neural-based","title":"SortNet: Learning To Rank By a Neural-Based Sorting Algorithm","date":"2023-11-03","arxiv_id":"2311.01864","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-offline-evaluation-for-learning-to","title":"Unbiased Offline Evaluation for Learning to Rank with Business Rules","date":"2023-11-03","arxiv_id":"2311.01828","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-active-learning-via","title":"Learning to Rank for Active Learning via Multi-Task Bilevel Optimization","date":"2023-10-25","arxiv_id":"2310.17044","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-encoders-based-species-normalization","title":"Bi-Encoders based Species Normalization -- Pairwise Sentence Learning to Rank","date":"2023-10-22","arxiv_id":"2310.14366","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-exploratory-study-on-simulated-annealing","title":"An Exploratory Study on Simulated Annealing for Feature Selection in Learning-to-Rank","date":"2023-10-20","arxiv_id":"2310.13269","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-neural-ranking-framework-toward","title":"Adaptive Neural Ranking Framework: Toward Maximized Business Goal for Cascade Ranking Systems","date":"2023-10-16","arxiv_id":"2310.10462","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-onset-occurring-offset","title":"Learning to Rank Onset-Occurring-Offset Representations for Micro-Expression Recognition","date":"2023-10-07","arxiv_id":"2310.04664","repositories_listed":0,"syntology":null},{"url":null,"slug":"replicating-relevance-ranked-synonym","title":"Replicating Relevance-Ranked Synonym Discovery in a New Language and Domain","date":"2023-10-02","arxiv_id":"2310.01507","repositories_listed":0,"syntology":null},{"url":"/paper/spatialrank-urban-event-ranking-with-ndcg","slug":"spatialrank-urban-event-ranking-with-ndcg","title":"SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data","date":"2023-09-30","arxiv_id":"2310.00270","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/spatialrank-urban-event-ranking-with-ndcg#ran","syntology_url":"https://syntology.ai/paper/2310.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00270"}},"official":null}},{"url":null,"slug":"nowj1-alqac-2023-enhancing-legal-task","title":"NOWJ1@ALQAC 2023: Enhancing Legal Task Performance with Classic Statistical Models and Pre-trained Language Models","date":"2023-09-16","arxiv_id":"2309.09070","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-engineering-in-learning-to-rank-for","title":"Feature Engineering in Learning-to-Rank for Community Question Answering Task","date":"2023-09-14","arxiv_id":"2309.07610","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-perspective-learning-to-rank-approach","title":"A Multi-Perspective Learning to Rank Approach to Support Children's Information Seeking in the Classroom","date":"2023-08-29","arxiv_id":"2308.15265","repositories_listed":0,"syntology":null},{"url":null,"slug":"trivea-transparent-ranking-interpretation","title":"TRIVEA: Transparent Ranking Interpretation using Visual Explanation of Black-Box Algorithmic Rankers","date":"2023-08-28","arxiv_id":"2308.14622","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-membership-bias","title":"The Impact of Group Membership Bias on the Quality and Fairness of Exposure in Ranking","date":"2023-08-05","arxiv_id":"2308.02887","repositories_listed":0,"syntology":null},{"url":null,"slug":"replace-scoring-with-arrangement-a-contextual","title":"Replace Scoring with Arrangement: A Contextual Set-to-Arrangement Framework for Learning-to-Rank","date":"2023-08-05","arxiv_id":"2308.02860","repositories_listed":0,"syntology":null},{"url":null,"slug":"pretrained-deep-models-outperform-gbdts-in","title":"Pretrained deep models outperform GBDTs in Learning-To-Rank under label scarcity","date":"2023-07-31","arxiv_id":"2308.00177","repositories_listed":0,"syntology":null}],"record_sha256":"3333ab7c8da323ecd8d9931fecbc19a7799d854f5264aaf562503644c7659d25","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}