{"total":21,"rows":[{"id":"2206.05979","title":"Top Two Algorithms Revisited","created":"2022-06-13","cited_by_count":34,"area":null},{"id":"2206.14332","title":"Active Exploration via Experiment Design in Markov Chains","created":"2022-06-29","cited_by_count":19,"area":null},{"id":"2107.07322","title":"A unified framework for bandit multiple testing","created":"2021-07-15","cited_by_count":8,"area":null},{"id":"2402.01400","title":"Query-Efficient Correlation Clustering with Noisy Oracle","created":"2024-02-02","cited_by_count":7,"area":null},{"id":"2202.06280","title":"On the complexity of All $\\varepsilon$-Best Arms Identification","created":"2022-02-13","cited_by_count":6,"area":null},{"id":"2212.00333","title":"AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration","created":"2022-12-01","cited_by_count":6,"area":null},{"id":"2302.04376","title":"Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning","created":"2023-02-08","cited_by_count":6,"area":null},{"id":"2202.04487","title":"Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget","created":"2022-02-09","cited_by_count":5,"area":null},{"id":"2206.09150","title":"Thompson Sampling for (Combinatorial) Pure Exploration","created":"2022-06-18","cited_by_count":4,"area":null},{"id":"2501.00924","title":"On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit","created":"2025-01-01","cited_by_count":3,"area":null},{"id":"2607.04824","title":"Probably Correct Optimal Stable Matching under Two-Sided Uncertainty","created":"2026-07-06","cited_by_count":2,"area":null},{"id":"2206.04456","title":"Choosing Answers in $\\varepsilon$-Best-Answer Identification for Linear Bandits","created":"2022-06-09","cited_by_count":1,"area":null},{"id":"2505.22473","title":"Pure Exploration with Infinite Answers","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2505.22475","title":"Non-Asymptotic Analysis of (Sticky) Track-and-Stop","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2607.13686","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","created":"2026-07-15","cited_by_count":1,"area":null},{"id":"2210.05977","title":"BORA: Bayesian Optimization for Resource Allocation","created":"2022-10-12","cited_by_count":0,"area":null},{"id":"2410.18844","title":"Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints","created":"2024-10-24","cited_by_count":0,"area":null},{"id":"2502.01429","title":"An Algorithm for Fixed Budget Best Arm Identification with Combinatorial Exploration","created":"2025-02-03","cited_by_count":0,"area":null},{"id":"2601.17430","title":"Active Hypothesis Testing for Correlated Combinatorial Anomaly Detection","created":"2026-01-24","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},{"id":"2610.16840","title":"Few-for-Many Best-Arm Identification in Multi-Objective Bandits","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}