{"total":42,"rows":[{"id":"2105.13017","title":"Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits","created":"2021-05-27","cited_by_count":32,"area":null},{"id":"2106.04763","title":"Fixed-Budget Best-Arm Identification in Structured Bandits","created":"2021-06-09","cited_by_count":22,"area":null},{"id":"2107.09912","title":"Design of Experiments for Stochastic Contextual Linear Bandits","created":"2021-07-21","cited_by_count":18,"area":null},{"id":"2206.11183","title":"Active Learning with Safety Constraints","created":"2022-06-22","cited_by_count":16,"area":null},{"id":"2202.13234","title":"Safe Exploration for Efficient Policy Evaluation and Comparison","created":"2022-02-26","cited_by_count":15,"area":null},{"id":"2106.11612","title":"Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation","created":"2021-06-22","cited_by_count":14,"area":null},{"id":"2106.12034","title":"Pure Exploration in Kernel and Neural Bandits","created":"2021-06-22","cited_by_count":13,"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":"2111.01479","title":"Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification","created":"2021-11-02","cited_by_count":12,"area":null},{"id":"2103.10070","title":"Top-m identification for linear bandits","created":"2021-03-18","cited_by_count":11,"area":null},{"id":"2405.09312","title":"Agnostic Active Learning of Single Index Models with Linear Sample Complexity","created":"2024-05-15","cited_by_count":11,"area":null},{"id":"2202.12888","title":"Meta-Learning for Simple Regret Minimization","created":"2022-02-25","cited_by_count":10,"area":null},{"id":"2306.07858","title":"Additive Causal Bandits with Unknown Graph","created":"2023-06-13","cited_by_count":10,"area":null},{"id":"2106.14077","title":"The Role of Contextual Information in Best Arm Identification","created":"2021-06-26","cited_by_count":8,"area":null},{"id":"2110.13876","title":"Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs","created":"2021-10-26","cited_by_count":8,"area":null},{"id":"2205.10936","title":"On Elimination Strategies for Bandit Fixed-Confidence Identification","created":"2022-05-22","cited_by_count":8,"area":null},{"id":"2211.12004","title":"Contextual Bandits in a Survey Experiment on Charitable Giving: Within-Experiment Outcomes versus Policy Learning","created":"2022-11-22","cited_by_count":7,"area":null},{"id":"2111.07458","title":"Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination","created":"2021-11-14","cited_by_count":6,"area":null},{"id":"2302.04441","title":"Multi-task Representation Learning for Pure Exploration in Linear Bandits","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2310.11015","title":"Pure Exploration in Asynchronous Federated Bandits","created":"2023-10-17","cited_by_count":6,"area":null},{"id":"2511.02966","title":"Inference-Time Personalized Alignment with a Few User Preference Queries","created":"2025-11-04","cited_by_count":6,"area":null},{"id":"2401.05193","title":"Experiment Planning with Function Approximation","created":"2024-01-10","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":"2309.08709","title":"Price of Safety in Linear Best Arm Identification","created":"2023-09-15","cited_by_count":4,"area":null},{"id":"2207.11158","title":"SPRT-based Efficient Best Arm Identification in Stochastic Bandits","created":"2022-07-22","cited_by_count":3,"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":"2301.03785","title":"Best Arm Identification in Stochastic Bandits: Beyond $\\beta-$optimality","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2307.15154","title":"A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity","created":"2023-07-27","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":"2507.04255","title":"Bandit Pareto Set Identification in a Multi-Output Linear Model","created":"2025-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":"2311.00481","title":"Fixed-Budget Best-Arm Identification in Sparse Linear Bandits","created":"2023-11-01","cited_by_count":1,"area":null},{"id":"2407.02601","title":"Linear Submodular Maximization with Bandit Feedback","created":"2024-07-02","cited_by_count":1,"area":null},{"id":"2506.13390","title":"Experimental Design for Semiparametric Bandits","created":"2025-06-16","cited_by_count":1,"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":"2402.09467","title":"Optimal Thresholding Linear Bandit","created":"2024-02-11","cited_by_count":0,"area":null},{"id":"2506.22480","title":"Service Placement in Small Cell Networks Using Distributed Best Arm Identification in Linear Bandits","created":"2025-06-22","cited_by_count":0,"area":null},{"id":"2510.04559","title":"Challenger-Based Combinatorial Bandits for Subcarrier Selection in OFDM Systems","created":"2025-10-06","cited_by_count":0,"area":null},{"id":"2603.10346","title":"On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits","created":"2026-03-11","cited_by_count":0,"area":null},{"id":"2604.03969","title":"Nearly Optimal Best Arm Identification for Semiparametric Bandits","created":"2026-04-05","cited_by_count":0,"area":null},{"id":"2607.14706","title":"MESHA: Mechanism-Enforced Sequential Halving for Strategic Linear Bandits","created":"2026-07-16","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}