{"total":12,"rows":[{"id":"2310.00968","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","created":"2023-10-02","cited_by_count":22,"area":null},{"id":"2303.08816","title":"Borda Regret Minimization for Generalized Linear Dueling Bandits","created":"2023-03-15","cited_by_count":17,"area":null},{"id":"2406.04793","title":"Learning-Augmented Priority Queues","created":"2024-06-07","cited_by_count":7,"area":null},{"id":"2405.03059","title":"Active Preference Learning for Ordering Items In- and Out-of-sample","created":"2024-05-05","cited_by_count":6,"area":null},{"id":"2206.00383","title":"Neural Improvement Heuristics for Graph Combinatorial Optimization Problems","created":"2022-06-01","cited_by_count":4,"area":null},{"id":"2403.12950","title":"Non-Stationary Dueling Bandits Under a Weighted Borda Criterion","created":"2024-03-19","cited_by_count":2,"area":null},{"id":"2409.17711","title":"Efficient Pointwise-Pairwise Learning-to-Rank for News Recommendation","created":"2024-09-26","cited_by_count":1,"area":null},{"id":"2508.19780","title":"Interestingness First Classifiers","created":"2025-08-27","cited_by_count":1,"area":null},{"id":"2509.15420","title":"Top-$k$ Feature Importance Ranking","created":"2025-09-18","cited_by_count":1,"area":null},{"id":"2510.01871","title":"Ranking Items from Discrete Ratings: The Cost of Unknown User Thresholds","created":"2025-10-02","cited_by_count":0,"area":null},{"id":"2606.07492","title":"Bradley-Terry Rankings for Recommender Systems Across Dataset Taxonomies","created":"2026-06-05","cited_by_count":0,"area":null},{"id":"2609.30360","title":"Cost-Aware Best-LLM Identification using Dueling Feedback","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}