{"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/4","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":4,"pages_in_order":8,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/learning-to-rank/papers/5","papers":[{"url":null,"slug":"an-ipw-based-unbiased-ranking-metric-in-two","title":"An IPW-based Unbiased Ranking Metric in Two-sided Markets","date":"2023-07-14","arxiv_id":"2307.10204","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-machine-learned-ranking-algorithm-for","title":"A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services","date":"2023-07-06","arxiv_id":"2307.05697","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-of-untargeted-poisoning-attack","title":"An Analysis of Untargeted Poisoning Attack and Defense Methods for Federated Online Learning to Rank Systems","date":"2023-07-04","arxiv_id":"2307.01565","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-user-behavior-in-carousel","title":"Understanding User Behavior in Carousel Recommendation Systems for Click Modeling and Learning to Rank","date":"2023-07-04","arxiv_id":"2307.01866","repositories_listed":0,"syntology":null},{"url":null,"slug":"thuir2-at-ntcir-16-session-search-ss-task","title":"THUIR2 at NTCIR-16 Session Search (SS) Task","date":"2023-07-01","arxiv_id":"2307.00250","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-when-grades-matter","title":"Learning to Rank when Grades Matter","date":"2023-06-14","arxiv_id":"2306.08650","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-learning-to-rank-with-distribution-free","title":"Inference-time Stochastic Ranking with Risk Control","date":"2023-06-12","arxiv_id":"2306.07188","repositories_listed":0,"syntology":null},{"url":null,"slug":"skellam-rank-fair-learning-to-rank-algorithm","title":"Skellam Rank: Fair Learning to Rank Algorithm Based on Poisson Process and Skellam Distribution for Recommender Systems","date":"2023-06-11","arxiv_id":"2306.06607","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-spider-learning-to-rank-pre-trained","title":"Model Spider: Learning to Rank Pre-Trained Models Efficiently","date":"2023-06-06","arxiv_id":"2306.03900","repositories_listed":0,"syntology":null},{"url":null,"slug":"pairwise-ranking-losses-of-click-through","title":"Pairwise Ranking Losses of Click-Through Rates Prediction for Welfare Maximization in Ad Auctions","date":"2023-06-01","arxiv_id":"2306.01799","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-online-learning-to-1","title":"Adversarial Attacks on Online Learning to Rank with Stochastic Click Models","date":"2023-05-30","arxiv_id":"2305.19218","repositories_listed":0,"syntology":null},{"url":null,"slug":"griprank-bridging-the-gap-between-retrieval","title":"GripRank: Bridging the Gap between Retrieval and Generation via the Generative Knowledge Improved Passage Ranking","date":"2023-05-29","arxiv_id":"2305.18144","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-online-learning-to","title":"Adversarial Attacks on Online Learning to Rank with Click Feedback","date":"2023-05-26","arxiv_id":"2305.17071","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-exploitation-bias-in-learning-to","title":"Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approach","date":"2023-05-26","arxiv_id":"2305.16606","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-utterances-for-query-focused","title":"Learning to Rank Utterances for Query-Focused Meeting Summarization","date":"2023-05-22","arxiv_id":"2305.12753","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-the-importance-of-nodes-in","title":"MGL2Rank: Learning to Rank the Importance of Nodes in Road Networks Based on Multi-Graph Fusion","date":"2023-05-20","arxiv_id":"2305.14375","repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-query-processing-a-risk-sensitive","title":"Selective Query Processing: a Risk-Sensitive Selection of System Configurations","date":"2023-05-17","arxiv_id":"2305.18311","repositories_listed":0,"syntology":null},{"url":null,"slug":"unconfounded-propensity-estimation-for","title":"Unconfounded Propensity Estimation for Unbiased Ranking","date":"2023-05-17","arxiv_id":"2305.09918","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-effective-tree-based-and-neural","title":"Efficient and Effective Tree-based and Neural Learning to Rank","date":"2023-05-15","arxiv_id":"2305.08680","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-position-bias-estimation-against","title":"Position Bias Estimation with Item Embedding for Sparse Dataset","date":"2023-05-10","arxiv_id":"2305.13931","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-reweighting-improves-group","title":"Ranking & Reweighting Improves Group Distributional Robustness","date":"2023-05-09","arxiv_id":"2305.05759","repositories_listed":0,"syntology":null},{"url":null,"slug":"recent-advances-in-the-foundations-and","title":"Recent Advances in the Foundations and Applications of Unbiased Learning to Rank","date":"2023-05-04","arxiv_id":"2305.02914","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploration-of-unranked-items-in-safe-online","title":"Exploration of Unranked Items in Safe Online Learning to Re-Rank","date":"2023-05-02","arxiv_id":"2305.01202","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-re-rank-with-constrained-meta","title":"Learning to Re-rank with Constrained Meta-Optimal Transport","date":"2023-04-29","arxiv_id":"2305.00319","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-perturbations-help-reduce-investment","title":"Can Perturbations Help Reduce Investment Risks? Risk-Aware Stock Recommendation via Split Variational Adversarial Training","date":"2023-04-20","arxiv_id":"2304.11043","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-the-role-of-similarity-and","title":"Revisiting the Role of Similarity and Dissimilarity in Best Counter Argument Retrieval","date":"2023-04-18","arxiv_id":"2304.08807","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-resources-with-gnn","title":"Learning To Rank Resources with GNN","date":"2023-04-17","arxiv_id":"2304.07946","repositories_listed":0,"syntology":null},{"url":null,"slug":"metric-agnostic-ranking-optimization","title":"Metric-agnostic Ranking Optimization","date":"2023-04-17","arxiv_id":"2304.08062","repositories_listed":0,"syntology":null},{"url":null,"slug":"opi-at-semeval-2023-task-1-image-text","title":"OPI at SemEval 2023 Task 1: Image-Text Embeddings and Multimodal Information Retrieval for Visual Word Sense Disambiguation","date":"2023-04-14","arxiv_id":"2304.07127","repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-and-implicit-semantic-ranking","title":"Explicit and Implicit Semantic Ranking Framework","date":"2023-04-11","arxiv_id":"2304.04918","repositories_listed":0,"syntology":null},{"url":null,"slug":"sentence-level-relation-extraction-via","title":"Sentence-Level Relation Extraction via Contrastive Learning with Descriptive Relation Prompts","date":"2023-04-11","arxiv_id":"2304.04935","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-ranking-ensembles-for-hyperparameter","title":"Deep Ranking Ensembles for Hyperparameter Optimization","date":"2023-03-27","arxiv_id":"2303.15212","repositories_listed":0,"syntology":null},{"url":null,"slug":"unbiased-learning-to-rank-with-biased-1","title":"Unbiased Learning to Rank with Biased Continuous Feedback","date":"2023-03-08","arxiv_id":"2303.04335","repositories_listed":0,"syntology":null},{"url":null,"slug":"tile-networks-learning-optimal-geometric","title":"Tile Networks: Learning Optimal Geometric Layout for Whole-page Recommendation","date":"2023-03-03","arxiv_id":"2303.01671","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-emotional-control-of-text-to","title":"Fine-grained Emotional Control of Text-To-Speech: Learning To Rank Inter- And Intra-Class Emotion Intensities","date":"2023-03-02","arxiv_id":"2303.01508","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-better-web-search-performance-pre","title":"Towards Better Web Search Performance: Pre-training, Fine-tuning and Learning to Rank","date":"2023-02-28","arxiv_id":"2303.04710","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-ranking-model-with-multiple","title":"Ensemble Ranking Model with Multiple Pretraining Strategies for Web Search","date":"2023-02-18","arxiv_id":"2302.09340","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-enhanced-network-with-hybrid","title":"Feature-Enhanced Network with Hybrid Debiasing Strategies for Unbiased Learning to Rank","date":"2023-02-15","arxiv_id":"2302.07530","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-normalized-entropy-curves","title":"Learning to Rank Normalized Entropy Curves with Differentiable Window Transformation","date":"2023-01-25","arxiv_id":"2301.10443","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-disentangling-relevance-and-bias-in","title":"Towards Disentangling Relevance and Bias in Unbiased Learning to Rank","date":"2022-12-28","arxiv_id":"2212.13937","repositories_listed":0,"syntology":null},{"url":null,"slug":"rank-lime-local-model-agnostic-feature","title":"Rank-LIME: Local Model-Agnostic Feature Attribution for Learning to Rank","date":"2022-12-24","arxiv_id":"2212.12722","repositories_listed":0,"syntology":null},{"url":null,"slug":"coarse-to-fine-contrastive-learning-on-graphs","title":"Coarse-to-Fine Contrastive Learning on Graphs","date":"2022-12-13","arxiv_id":"2212.06423","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-off-policy-learning-from-bandit","title":"Multi-Task Off-Policy Learning from Bandit Feedback","date":"2022-12-09","arxiv_id":"2212.04720","repositories_listed":0,"syntology":null},{"url":null,"slug":"pareto-pairwise-ranking-for-fairness","title":"Pareto Pairwise Ranking for Fairness Enhancement of Recommender Systems","date":"2022-12-06","arxiv_id":"2212.10459","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-graph-based-application","title":"Learning to Rank Graph-based Application Objects on Heterogeneous Memories","date":"2022-11-04","arxiv_id":"2211.02195","repositories_listed":0,"syntology":null},{"url":null,"slug":"regression-compatible-listwise-objectives-for","title":"Regression Compatible Listwise Objectives for Calibrated Ranking with Binary Relevance","date":"2022-11-02","arxiv_id":"2211.01494","repositories_listed":0,"syntology":null},{"url":null,"slug":"whole-page-unbiased-learning-to-rank","title":"Whole Page Unbiased Learning to Rank","date":"2022-10-19","arxiv_id":"2210.10718","repositories_listed":0,"syntology":null},{"url":null,"slug":"ptde-personalized-training-with-distillated","title":"PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning","date":"2022-10-17","arxiv_id":"2210.08872","repositories_listed":0,"syntology":null},{"url":null,"slug":"menuai-restaurant-food-recommendation-system","title":"MenuAI: Restaurant Food Recommendation System via a Transformer-based Deep Learning Model","date":"2022-10-15","arxiv_id":"2210.08266","repositories_listed":0,"syntology":null},{"url":null,"slug":"off-policy-evaluation-for-learning-to-rank","title":"Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based model","date":"2022-10-15","arxiv_id":"2210.09512","repositories_listed":0,"syntology":null},{"url":null,"slug":"sml-enhance-the-network-smoothness-with-skip","title":"SML:Enhance the Network Smoothness with Skip Meta Logit for CTR Prediction","date":"2022-10-09","arxiv_id":"2210.10725","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-diversely","title":"Learning To Rank Diversely At Airbnb","date":"2022-09-19","arxiv_id":"2210.07774","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-understanding-privileged-features","title":"Toward Understanding Privileged Features Distillation in Learning-to-Rank","date":"2022-09-19","arxiv_id":"2209.08754","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-upper-lower-bound-normalization-for-ir","title":"Joint Upper & Lower Bound Normalization for IR Evaluation","date":"2022-09-12","arxiv_id":"2209.05007","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-to-rank-with-coarse","title":"Reinforcement Learning to Rank with Coarse-grained Labels","date":"2022-08-16","arxiv_id":"2208.07563","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-bayesian-active-learning-to-rank-for","title":"Deep Bayesian Active-Learning-to-Rank for Endoscopic Image Data","date":"2022-08-05","arxiv_id":"2208.03020","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-quality-assessment-learning-to-rank","title":"Image Quality Assessment: Learning to Rank Image Distortion Level","date":"2022-08-04","arxiv_id":"2208.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-tolerance-of-learning-to-rank-under","title":"Noise tolerance of learning to rank under class-conditional label noise","date":"2022-08-03","arxiv_id":"2208.02126","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-makes-you-change-your-mind-an-empirical","title":"What makes you change your mind? An empirical investigation in online group decision-making conversations","date":"2022-07-25","arxiv_id":"2207.12035","repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneously-learning-stochastic-and-2","title":"Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model","date":"2022-07-12","arxiv_id":"2207.05437","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-learning-to-rank-through-multi","title":"Multi-Label Learning to Rank through Multi-Objective Optimization","date":"2022-07-07","arxiv_id":"2207.03060","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-with-small-set-of-ground","title":"Learning to Rank with Small Set of Ground Truth Data","date":"2022-07-04","arxiv_id":"2207.01188","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-systems-with-distribution-free","title":"Recommendation Systems with Distribution-Free Reliability Guarantees","date":"2022-07-04","arxiv_id":"2207.01609","repositories_listed":0,"syntology":null},{"url":null,"slug":"listbert-learning-to-rank-e-commerce-products","title":"ListBERT: Learning to Rank E-commerce products with Listwise BERT","date":"2022-06-30","arxiv_id":"2206.15198","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-the-ranking-of-causal-effects-with","title":"The Amenability Framework: Rethinking Causal Ordering Without Estimating Causal Effects","date":"2022-06-25","arxiv_id":"2206.12532","repositories_listed":0,"syntology":null},{"url":null,"slug":"reaching-the-end-of-unbiasedness-uncovering","title":"Reaching the End of Unbiasedness: Uncovering Implicit Limitations of Click-Based Learning to Rank","date":"2022-06-24","arxiv_id":"2206.12204","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-accurate-top-k-recovery-from","title":"Efficient and Accurate Top-$K$ Recovery from Choice Data","date":"2022-06-23","arxiv_id":"2206.11995","repositories_listed":0,"syntology":null},{"url":null,"slug":"fold-tr-a-scalable-and-efficient-inductive","title":"FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank","date":"2022-06-15","arxiv_id":"2206.07295","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-exploration-for-neural-online","title":"Scalable Exploration for Neural Online Learning to Rank with Perturbed Feedback","date":"2022-06-13","arxiv_id":"2206.05954","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-evaluation-of-ranked-lists-using","title":"Offline Evaluation of Ranked Lists using Parametric Estimation of Propensities","date":"2022-06-06","arxiv_id":"2206.02470","repositories_listed":0,"syntology":null},{"url":null,"slug":"pessimistic-off-policy-optimization-for","title":"Pessimistic Off-Policy Optimization for Learning to Rank","date":"2022-06-06","arxiv_id":"2206.02593","repositories_listed":0,"syntology":null},{"url":null,"slug":"glance-to-count-learning-to-rank-with-anchors","title":"Glance to Count: Learning to Rank with Anchors for Weakly-supervised Crowd Counting","date":"2022-05-29","arxiv_id":"2205.14659","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-strategies-of-active-learning-to","title":"A Simple yet Effective Framework for Active Learning to Rank","date":"2022-05-20","arxiv_id":"2205.10137","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-variance-estimation-in-the-plackett-luce","title":"Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling","date":"2022-05-12","arxiv_id":"2205.06024","repositories_listed":0,"syntology":null},{"url":null,"slug":"compound-virtual-screening-by-learning-to","title":"Compound virtual screening by learning-to-rank with gradient boosting decision tree and enrichment-based cumulative gain","date":"2022-05-04","arxiv_id":"2205.02169","repositories_listed":0,"syntology":null},{"url":null,"slug":"explain-and-conquer-personalised-text-based","title":"Explain and Conquer: Personalised Text-based Reviews to Achieve Transparency","date":"2022-05-03","arxiv_id":"2205.01759","repositories_listed":0,"syntology":null},{"url":null,"slug":"moviemat-context-aware-movie-recommendation","title":"MovieMat: Context-aware Movie Recommendation with Matrix Factorization by Matrix Fitting","date":"2022-04-27","arxiv_id":"2204.13003","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterfactual-learning-to-rank-for-utility","title":"Counterfactual Learning To Rank for Utility-Maximizing Query Autocompletion","date":"2022-04-22","arxiv_id":"2204.10936","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-evolutionary-multi-objective","title":"Interactive Evolutionary Multi-Objective Optimization via Learning-to-Rank","date":"2022-04-06","arxiv_id":"2204.02604","repositories_listed":0,"syntology":null},{"url":null,"slug":"which-tricks-are-important-for-learning-to","title":"Which Tricks Are Important for Learning to Rank?","date":"2022-04-04","arxiv_id":"2204.01500","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-regret-for-cascading-bandits","title":"Minimax Regret for Cascading Bandits","date":"2022-03-23","arxiv_id":"2203.12577","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-execution-time-optimization-for","title":"Personalized Execution Time Optimization for the Scheduled Jobs","date":"2022-03-11","arxiv_id":"2203.06158","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-local-model-agnostic-explanations","title":"Evaluating Local Model-Agnostic Explanations of Learning to Rank Models with Decision Paths","date":"2022-03-04","arxiv_id":"2203.02295","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-perspective-on-classification-optimally","title":"A new perspective on classification: optimally allocating limited resources to uncertain tasks","date":"2022-02-09","arxiv_id":"2202.04369","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-push-notifications-using","title":"Learning to Rank For Push Notifications Using Pairwise Expected Regret","date":"2022-01-19","arxiv_id":"2201.07681","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neural-ranking-models-online-from","title":"Learning Neural Ranking Models Online from Implicit User Feedback","date":"2022-01-17","arxiv_id":"2201.06658","repositories_listed":0,"syntology":null},{"url":null,"slug":"assisting-the-human-fact-checkers-detecting-1","title":"Assisting the Human Fact-Checkers: Detecting All Previously Fact-Checked Claims in a Document","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rank4class-a-ranking-formulation-for","title":"Rank4Class: A Ranking Formulation for Multiclass Classification","date":"2021-12-17","arxiv_id":"2112.09727","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-for-robust-learning-to-rank","title":"Fairness for Robust Learning to Rank","date":"2021-12-12","arxiv_id":"2112.06288","repositories_listed":0,"syntology":null},{"url":null,"slug":"universalizing-weak-supervision-1","title":"Universalizing Weak Supervision","date":"2021-12-07","arxiv_id":"2112.03865","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-structure-of-parametric-tournaments","title":"On The Structure of Parametric Tournaments with Application to Ranking from Pairwise Comparisons","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-learning-for-fair-ranking-systems","title":"End-to-end Learning for Fair Ranking Systems","date":"2021-11-21","arxiv_id":"2111.10723","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-augmented-learning-to-rank-for-querying","title":"Graph-augmented Learning to Rank for Querying Large-scale Knowledge Graph","date":"2021-11-20","arxiv_id":"2111.10541","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-visual-stories-from-human","title":"Learning to Rank Visual Stories From Human Ranking Data","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrating-explore-exploit-trade-off-for","title":"Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank","date":"2021-11-01","arxiv_id":"2111.00735","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-in-the-age-of-muppets","title":"Learning to Rank in the Age of Muppets: Effectiveness–Efficiency Tradeoffs in Multi-Stage Ranking","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scale-invariant-ranking-function-for","title":"A scale invariant ranking function for learning-to-rank: a real-world use case","date":"2021-10-21","arxiv_id":"2110.11259","repositories_listed":0,"syntology":null},{"url":null,"slug":"eileen-a-recommendation-system-for-scientific","title":"EILEEN: A recommendation system for scientific publications and grants","date":"2021-10-19","arxiv_id":"2110.09663","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-facts-for-explaining-answers-to","title":"Ranking Facts for Explaining Answers to Elementary Science Questions","date":"2021-10-18","arxiv_id":"2110.09036","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-modelling-via-learning-to-rank","title":"Language Modelling via Learning to Rank","date":"2021-10-13","arxiv_id":"2110.06961","repositories_listed":0,"syntology":null}],"record_sha256":"5906f80f2365ce7057a28bacac478933e250d31e23c1462657ae7c746bb7c5d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}