{"total":19,"rows":[{"id":"2207.05836","title":"Contextual Bandits with Large Action Spaces: Made Practical","created":"2022-07-12","cited_by_count":33,"area":null},{"id":"2101.08534","title":"Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback","created":"2021-01-21","cited_by_count":21,"area":null},{"id":"2105.06499","title":"Improved Algorithms for Agnostic Pool-based Active Classification","created":"2021-05-13","cited_by_count":15,"area":null},{"id":"2107.07322","title":"A unified framework for bandit multiple testing","created":"2021-07-15","cited_by_count":8,"area":null},{"id":"2410.08000","title":"AHA: Human-Assisted Out-of-Distribution Generalization and Detection","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2102.12094","title":"Combinatorial Pure Exploration with Bottleneck Reward Function","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2206.09150","title":"Thompson Sampling for (Combinatorial) Pure Exploration","created":"2022-06-18","cited_by_count":4,"area":null},{"id":"2310.06069","title":"Optimal Exploration is no harder than Thompson Sampling","created":"2023-10-09","cited_by_count":3,"area":null},{"id":"2308.10238","title":"Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit","created":"2023-08-20","cited_by_count":2,"area":null},{"id":"2505.17869","title":"Best Group Identification in Multi-Objective Bandits","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2112.04083","title":"Best Arm Identification under Additive Transfer Bandits","created":"2021-12-08","cited_by_count":1,"area":null},{"id":"2310.15681","title":"Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit","created":"2023-10-24","cited_by_count":1,"area":null},{"id":"2511.09808","title":"Constrained Best Arm Identification with Tests for Feasibility","created":"2025-11-12","cited_by_count":1,"area":null},{"id":"2112.04197","title":"A Fast Algorithm for PAC Combinatorial Pure Exploration","created":"2021-12-08","cited_by_count":0,"area":null},{"id":"2212.05190","title":"Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy","created":"2022-12-10","cited_by_count":0,"area":null},{"id":"2306.01995","title":"Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits","created":"2023-06-03","cited_by_count":0,"area":null},{"id":"2503.07877","title":"Cost-Aware Optimal Pairwise Pure Exploration","created":"2025-03-10","cited_by_count":0,"area":null},{"id":"2608.08103","title":"Support Selection Beyond Smooth DAG Exactness: Completion Geometry,Score Margins, and Selective Certificates","created":"2026-08-08","cited_by_count":0,"area":null},{"id":"2610.12960","title":"DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}