{"total":30,"rows":[{"id":"2205.00048","title":"Joint Multisided Exposure Fairness for Recommendation","created":"2022-04-29","cited_by_count":22,"area":null},{"id":"2203.17118","title":"Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rank","created":"2022-03-31","cited_by_count":18,"area":null},{"id":"2204.10872","title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity","created":"2022-04-22","cited_by_count":13,"area":null},{"id":"2206.07247","title":"Fair Ranking as Fair Division: Impact-Based Individual Fairness in Ranking","created":"2022-06-15","cited_by_count":13,"area":null},{"id":"2202.03237","title":"Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings","created":"2022-02-07","cited_by_count":11,"area":null},{"id":"2305.01522","title":"Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization","created":"2023-04-26","cited_by_count":11,"area":null},{"id":"2208.06263","title":"Probabilistic Rank and Reward: A Scalable Model for Slate Recommendation","created":"2022-08-10","cited_by_count":8,"area":null},{"id":"2401.16457","title":"Effective Controllable Bias Mitigation for Classification and Retrieval using Gate Adapters","created":"2024-01-29","cited_by_count":8,"area":null},{"id":"2407.19943","title":"Practical and Robust Safety Guarantees for Advanced Counterfactual Learning to Rank","created":"2024-07-29","cited_by_count":7,"area":null},{"id":"2310.04407","title":"Policy-Gradient Training of Language Models for Ranking","created":"2023-10-06","cited_by_count":5,"area":null},{"id":"2204.13765","title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking","created":"2022-04-28","cited_by_count":4,"area":null},{"id":"2506.13743","title":"LTRR: Learning To Rank Retrievers for LLMs","created":"2025-06-16","cited_by_count":4,"area":null},{"id":"2306.07188","title":"Inference-time Stochastic Ranking with Risk Control","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2306.11964","title":"Sampling Individually-Fair Rankings that are Always Group Fair","created":"2023-06-21","cited_by_count":2,"area":null},{"id":"2408.09168","title":"Ranking Across Different Content Types: The Robust Beauty of Multinomial Blending","created":"2024-08-17","cited_by_count":2,"area":null},{"id":"2205.06024","title":"Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling","created":"2022-05-12","cited_by_count":1,"area":null},{"id":"2308.13242","title":"Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness","created":"2023-08-25","cited_by_count":1,"area":null},{"id":"2409.09881","title":"Proximal Ranking Policy Optimization for Practical Safety in Counterfactual Learning to Rank","created":"2024-09-15","cited_by_count":1,"area":null},{"id":"2502.16496","title":"PMAT: Optimizing Action Generation Order in Multi-Agent Reinforcement Learning","created":"2025-02-23","cited_by_count":1,"area":null},{"id":"2504.12063","title":"Optimizing Compound Retrieval Systems","created":"2025-04-16","cited_by_count":1,"area":null},{"id":"2305.00319","title":"Learning to Re-rank with Constrained Meta-Optimal Transport","created":"2023-04-29","cited_by_count":0,"area":null},{"id":"2404.12190","title":"Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees","created":"2024-04-18","cited_by_count":0,"area":null},{"id":"2406.14004","title":"Do Not Wait: Learning Re-Ranking Model Without User Feedback At Serving Time in E-Commerce","created":"2024-06-20","cited_by_count":0,"area":null},{"id":"2506.00446","title":"Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modeling","created":"2025-05-31","cited_by_count":0,"area":null},{"id":"2506.23319","title":"Learning to Rank with Variable Result Presentation Lengths","created":"2025-06-29","cited_by_count":0,"area":null},{"id":"2508.14180","title":"RewardRank: Optimizing True Learning-to-Rank Utility","created":"2025-08-19","cited_by_count":0,"area":null},{"id":"2606.26369","title":"Scoring Is Not Enough: Addressing Gaps in Utility-fairness Trade-offs for Ranking","created":"2026-06-24","cited_by_count":0,"area":null},{"id":"2607.00448","title":"Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2607.11146","title":"Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2607.25268","title":"Structure-aware Relative Policy Optimization for Ranking","created":"2026-07-28","cited_by_count":0,"area":null}],"next_cursor":null}