{"total":19,"rows":[{"id":"2102.05295","title":"An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints","created":"2021-02-10","cited_by_count":29,"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":"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":"2206.00121","title":"Near-Optimal Collaborative Learning in Bandits","created":"2022-05-31","cited_by_count":18,"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":"2210.05431","title":"Non-Asymptotic Analysis of a UCB-based Top Two Algorithm","created":"2022-10-11","cited_by_count":11,"area":null},{"id":"2406.03033","title":"Optimal Multi-Fidelity Best-Arm Identification","created":"2024-06-05","cited_by_count":9,"area":null},{"id":"2206.02326","title":"Asymptotic Instance-Optimal Algorithms for Interactive Decision Making","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2411.01898","title":"Best-Arm Identification in Unimodal Bandits","created":"2024-11-04","cited_by_count":6,"area":null},{"id":"2112.01452","title":"Indexed Minimum Empirical Divergence for Unimodal Bandits","created":"2021-12-02","cited_by_count":4,"area":null},{"id":"2212.09429","title":"On the Complexity of Representation Learning in Contextual Linear Bandits","created":"2022-12-19","cited_by_count":2,"area":null},{"id":"2403.10379","title":"Regret Minimization via Saddle Point Optimization","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2503.04010","title":"Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure","created":"2025-03-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":"2509.19901","title":"Pure Exploration via Frank-Wolfe Self-Play","created":"2025-09-24","cited_by_count":1,"area":null},{"id":"2510.07424","title":"Best-of-Both Worlds for linear contextual bandits with paid observations","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2606.01655","title":"MINTS: Minimalist Thompson Sampling","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}