{"total":34,"rows":[{"id":"2210.16913","title":"Revisiting Simple Regret: Fast Rates for Returning a Good Arm","created":"2022-10-30","cited_by_count":25,"area":null},{"id":"2303.09468","title":"On the Existence of a Complexity in Fixed Budget Bandit Identification","created":"2023-03-16","cited_by_count":20,"area":null},{"id":"2103.12452","title":"Bandits with many optimal arms","created":"2021-03-23","cited_by_count":17,"area":null},{"id":"2106.12034","title":"Pure Exploration in Kernel and Neural Bandits","created":"2021-06-22","cited_by_count":13,"area":null},{"id":"2102.05793","title":"Lenient Regret and Good-Action Identification in Gaussian Process Bandits","created":"2021-02-11","cited_by_count":12,"area":null},{"id":"2111.01479","title":"Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification","created":"2021-11-02","cited_by_count":12,"area":null},{"id":"2311.04402","title":"Likelihood Ratio Confidence Sets for Sequential Decision Making","created":"2023-11-08","cited_by_count":10,"area":null},{"id":"2111.08862","title":"Max-Min Grouped Bandits","created":"2021-11-17","cited_by_count":7,"area":null},{"id":"2306.02628","title":"Active Ranking of Experts Based on their Performances in Many Tasks","created":"2023-06-05","cited_by_count":6,"area":null},{"id":"2310.10359","title":"An Anytime Algorithm for Good Arm Identification","created":"2023-10-16","cited_by_count":6,"area":null},{"id":"2204.05245","title":"Approximate Top-$m$ Arm Identification with Heterogeneous Reward Variances","created":"2022-04-11","cited_by_count":5,"area":null},{"id":"2109.05131","title":"Near Instance Optimal Model Selection for Pure Exploration Linear Bandits","created":"2021-09-10","cited_by_count":4,"area":null},{"id":"2208.05844","title":"Adaptive Identification of Populations with Treatment Benefit in Clinical Trials: Machine Learning Challenges and Solutions","created":"2022-08-11","cited_by_count":2,"area":null},{"id":"2401.17205","title":"Adaptive Experiment Design with Synthetic Controls","created":"2024-01-30","cited_by_count":2,"area":null},{"id":"2503.00273","title":"Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits","created":"2025-03-01","cited_by_count":2,"area":null},{"id":"2503.11209","title":"Clustering Items through Bandit Feedback: Finding the Right Feature out of Many","created":"2025-03-14","cited_by_count":2,"area":null},{"id":"2601.05597","title":"Good Allocations from Bad Estimates","created":"2026-01-09","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":"2210.01295","title":"Max-Quantile Grouped Infinite-Arm Bandits","created":"2022-10-04","cited_by_count":1,"area":null},{"id":"2211.03985","title":"Adaptive Data Depth via Multi-Armed Bandits","created":"2022-11-08","cited_by_count":1,"area":null},{"id":"2506.03062","title":"Multi-Metric Adaptive Experimental Design Under a Fixed Budget with Validation","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2506.06978","title":"Near Optimal Non-asymptotic Sample Complexity of 1-Identification","created":"2025-06-08","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":"2602.03972","title":"Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors","created":"2026-02-03","cited_by_count":1,"area":null},{"id":"2602.24263","title":"Active Bipartite Ranking with Smooth Posterior Distributions","created":"2026-02-27","cited_by_count":1,"area":null},{"id":"2111.04915","title":"Practical, Provably-Correct Interactive Learning in the Realizable Setting: The Power of True Believers","created":"2021-11-09","cited_by_count":0,"area":null},{"id":"2302.09451","title":"Estimating Optimal Policy Value in General Linear Contextual Bandits","created":"2023-02-19","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":"2306.04498","title":"Near-Optimal Privacy-Preserving Learning for Max-Min Fair Multi-Agent Bandits","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2504.11866","title":"On the Problem of Best Arm Retention","created":"2025-04-16","cited_by_count":0,"area":null},{"id":"2602.18186","title":"Box Thirding: Anytime Best Arm Identification under Insufficient Sampling","created":"2026-02-20","cited_by_count":0,"area":null},{"id":"2605.11324","title":"$\\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2608.01378","title":"When May a Model Replace the Experiment? Audits, Licenses, and the Price of Trust in Surrogate-Driven Design","created":"2026-08-02","cited_by_count":0,"area":null},{"id":"2609.38659","title":"Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}