{"total":18,"rows":[{"id":"2306.00242","title":"Combinatorial Neural Bandits","created":"2023-05-31","cited_by_count":16,"area":null},{"id":"2506.08607","title":"Sample Efficient Demonstration Selection for In-Context Learning","created":"2025-06-10","cited_by_count":13,"area":null},{"id":"2203.12577","title":"Minimax Regret for Cascading Bandits","created":"2022-03-23","cited_by_count":10,"area":null},{"id":"2103.00368","title":"PairRank: Online Pairwise Learning to Rank by Divide-and-Conquer","created":"2021-02-28","cited_by_count":6,"area":null},{"id":"2305.17071","title":"Adversarial Attacks on Online Learning to Rank with Click Feedback","created":"2023-05-26","cited_by_count":6,"area":null},{"id":"2305.19218","title":"Adversarial Attacks on Online Learning to Rank with Stochastic Click Models","created":"2023-05-30","cited_by_count":6,"area":null},{"id":"2112.02165","title":"On Submodular Contextual Bandits","created":"2021-12-03","cited_by_count":2,"area":null},{"id":"2207.05437","title":"Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model","created":"2022-07-12","cited_by_count":2,"area":null},{"id":"2111.00735","title":"Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2201.06658","title":"Learning Neural Ranking Models Online from Implicit User Feedback","created":"2022-01-17","cited_by_count":1,"area":null},{"id":"2510.12152","title":"Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality","created":"2025-10-14","cited_by_count":1,"area":null},{"id":"2106.03546","title":"On Learning to Rank Long Sequences with Contextual Bandits","created":"2021-06-07","cited_by_count":0,"area":null},{"id":"2208.01515","title":"UniRank: Unimodal Bandit Algorithm for Online Ranking","created":"2022-08-02","cited_by_count":0,"area":null},{"id":"2305.01202","title":"Exploration of Unranked Items in Safe Online Learning to Re-Rank","created":"2023-05-02","cited_by_count":0,"area":null},{"id":"2406.05017","title":"Adaptively Learning to Select-Rank in Online Platforms","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2511.03074","title":"Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2606.29221","title":"A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming","created":"2026-06-28","cited_by_count":0,"area":null},{"id":"2609.06670","title":"Data Efficient Sample Selection for In-Context Learning","created":"2026-09-06","cited_by_count":0,"area":null}],"next_cursor":null}