{"total":11,"rows":[{"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":"2307.15053","title":"On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-$n$ Recommendation","created":"2023-07-27","cited_by_count":13,"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":"2402.03915","title":"Learning Metrics that Maximise Power for Accelerated A/B-Tests","created":"2024-02-06","cited_by_count":6,"area":null},{"id":"2204.01500","title":"Which Tricks Are Important for Learning to Rank?","created":"2022-04-04","cited_by_count":3,"area":null},{"id":"2306.07188","title":"Inference-time Stochastic Ranking with Risk Control","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2410.19055","title":"Newton Losses: Using Curvature Information for Learning with Differentiable Algorithms","created":"2024-10-24","cited_by_count":2,"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":"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":"2506.23319","title":"Learning to Rank with Variable Result Presentation Lengths","created":"2025-06-29","cited_by_count":0,"area":null}],"next_cursor":null}