{"total":76,"rows":[{"id":"2206.05979","title":"Top Two Algorithms Revisited","created":"2022-06-13","cited_by_count":34,"area":null},{"id":"2106.02847","title":"Navigating to the Best Policy in Markov Decision Processes","created":"2021-06-05","cited_by_count":29,"area":null},{"id":"2407.13977","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","created":"2024-07-19","cited_by_count":29,"area":null},{"id":"2203.05481","title":"Fully Adaptive Composition in Differential Privacy","created":"2022-03-10","cited_by_count":22,"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":"2107.02266","title":"Near-optimal inference in adaptive linear regression","created":"2021-07-05","cited_by_count":21,"area":null},{"id":"2103.09267","title":"Martingale Methods for Sequential Estimation of Convex Functionals and Divergences","created":"2021-03-16","cited_by_count":18,"area":null},{"id":"2206.00121","title":"Near-Optimal Collaborative Learning in Bandits","created":"2022-05-31","cited_by_count":18,"area":null},{"id":"2110.15573","title":"A/B/n Testing with Control in the Presence of Subpopulations","created":"2021-10-29","cited_by_count":17,"area":null},{"id":"2202.04294","title":"Optimal Clustering with Bandit Feedback","created":"2022-02-09","cited_by_count":15,"area":null},{"id":"2307.00424","title":"Adaptive Algorithms for Relaxed Pareto Set Identification","created":"2023-07-01","cited_by_count":15,"area":null},{"id":"2201.07306","title":"Bregman Deviations of Generic Exponential Families","created":"2022-01-18","cited_by_count":13,"area":null},{"id":"2402.16710","title":"Cost Aware Best Arm Identification","created":"2024-02-26","cited_by_count":13,"area":null},{"id":"2309.14298","title":"Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures","created":"2023-09-25","cited_by_count":12,"area":null},{"id":"2312.12137","title":"Best Arm Identification with Fixed Budget: A Large Deviation Perspective","created":"2023-12-19","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":"2601.21471","title":"Best Arm Identification with LLM Judges and Limited Human","created":"2026-01-29","cited_by_count":10,"area":null},{"id":"2402.06122","title":"Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streams","created":"2024-02-09","cited_by_count":9,"area":null},{"id":"2406.03033","title":"Optimal Multi-Fidelity Best-Arm Identification","created":"2024-06-05","cited_by_count":9,"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":"2304.04091","title":"Best Arm Identification with Fairness Constraints on Subpopulations","created":"2023-04-08","cited_by_count":8,"area":null},{"id":"2306.09048","title":"Optimal Best-Arm Identification in Bandits with Access to Offline Data","created":"2023-06-15","cited_by_count":8,"area":null},{"id":"2310.14129","title":"Optimal Batched Best Arm Identification","created":"2023-10-21","cited_by_count":8,"area":null},{"id":"2505.18000","title":"Anytime-valid, Bayes-assisted, Prediction-Powered Inference","created":"2025-05-23","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":"2309.02202","title":"On the Complexity of Differentially Private Best-Arm Identification with Fixed Confidence","created":"2023-09-05","cited_by_count":6,"area":null},{"id":"2311.08168","title":"Time-Uniform Confidence Spheres for Means of Random Vectors","created":"2023-11-14","cited_by_count":6,"area":null},{"id":"2411.01898","title":"Best-Arm Identification in Unimodal Bandits","created":"2024-11-04","cited_by_count":6,"area":null},{"id":"2109.05047","title":"PAC Mode Estimation using PPR Martingale Confidence Sequences","created":"2021-09-10","cited_by_count":5,"area":null},{"id":"2211.15129","title":"On the Sample Complexity of Representation Learning in Multi-task Bandits with Global and Local structure","created":"2022-11-28","cited_by_count":5,"area":null},{"id":"2408.09598","title":"Anytime-Valid Inference for Double/Debiased Machine Learning of Causal Parameters","created":"2024-08-18","cited_by_count":5,"area":null},{"id":"2410.15564","title":"Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits","created":"2024-10-21","cited_by_count":5,"area":null},{"id":"2412.02988","title":"Preference-based Pure Exploration","created":"2024-12-04","cited_by_count":5,"area":null},{"id":"2201.04469","title":"Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap","created":"2022-01-12","cited_by_count":4,"area":null},{"id":"2310.00539","title":"Thompson Exploration with Best Challenger Rule in Best Arm Identification","created":"2023-10-01","cited_by_count":4,"area":null},{"id":"2503.07824","title":"Pure Exploration with Feedback Graphs","created":"2025-03-10","cited_by_count":4,"area":null},{"id":"2508.16487","title":"FraPPE: Fast and Efficient Preference-based Pure Exploration","created":"2025-08-22","cited_by_count":4,"area":null},{"id":"2512.13123","title":"Stopping Rules for Stochastic Gradient Descent via Anytime-Valid Confidence Sequences","created":"2025-12-15","cited_by_count":4,"area":null},{"id":"2206.07234","title":"Brownian Noise Reduction: Maximizing Privacy Subject to Accuracy Constraints","created":"2022-06-15","cited_by_count":3,"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":"2209.07330","title":"Best Arm Identification with Contextual Information under a Small Gap","created":"2022-09-15","cited_by_count":3,"area":null},{"id":"2306.10882","title":"AdaStop: adaptive statistical testing for sound comparisons of Deep RL agents","created":"2023-06-19","cited_by_count":3,"area":null},{"id":"2310.19788","title":"Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budget","created":"2023-10-30","cited_by_count":3,"area":null},{"id":"2408.17313","title":"Fair Best Arm Identification with Fixed Confidence","created":"2024-08-30","cited_by_count":3,"area":null},{"id":"2502.01425","title":"The Batch Complexity of Bandit Pure Exploration","created":"2025-02-03","cited_by_count":3,"area":null},{"id":"2509.21091","title":"Best-of-$\\infty$ -- Asymptotic Performance of Test-Time LLM Ensembling","created":"2025-09-25","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":"2505.17869","title":"Best Group Identification in Multi-Objective Bandits","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2506.08127","title":"Constrained Pareto Set Identification with Bandit Feedback","created":"2025-06-09","cited_by_count":2,"area":null},{"id":"2510.25770","title":"E-Scores for (In)Correctness Assessment of Generative Model Outputs","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2512.12325","title":"Eventually LIL Regret: Almost Sure $\\ln\\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data","created":"2025-12-13","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":"2501.01291","title":"Detection Augmented Bandit Procedures for Piecewise Stationary MABs: A Modular Approach","created":"2025-01-02","cited_by_count":1,"area":null},{"id":"2501.11421","title":"Online Clustering of Data Sequences with Bandit Information","created":"2025-01-20","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":"2507.08994","title":"Fixed-Confidence Multiple Change Point Identification under Bandit Feedback","created":"2025-07-11","cited_by_count":1,"area":null},{"id":"2511.12803","title":"Finite-Horizon Quickest Change Detection Balancing Latency with False Alarm Probability","created":"2025-11-16","cited_by_count":1,"area":null},{"id":"2602.21479","title":"Global Sequential Testing for Multi-Stream Auditing","created":"2026-02-25","cited_by_count":1,"area":null},{"id":"2603.17925","title":"Multi-Armed Sequential Hypothesis Testing by Betting","created":"2026-03-18","cited_by_count":1,"area":null},{"id":"2606.01708","title":"Two-Fidelity Best-Action Identification for Stochastic Minimax Tree","created":"2026-06-01","cited_by_count":1,"area":null},{"id":"2302.02033","title":"An Asymptotically Optimal Algorithm for the Convex Hull Membership Problem","created":"2023-02-03","cited_by_count":0,"area":null},{"id":"2312.09674","title":"Optimal Regret Bounds for Collaborative Learning in Bandits","created":"2023-12-15","cited_by_count":0,"area":null},{"id":"2410.05734","title":"Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits","created":"2024-10-08","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":"2511.06639","title":"Bernstein-von Mises for Adaptively Collected Data","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2601.22600","title":"An Efficient Algorithm for Thresholding Monte Carlo Tree Search","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2602.05690","title":"Almost Asymptotically Optimal Active Clustering Through Pairwise Observations","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2604.20172","title":"Cover meets Robbins while Betting on Bounded Data: $\\ln n$ Regret and Almost Sure $\\ln\\ln n$ Regret","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2605.07964","title":"Asymptotically Log-Optimal Bayes-Assisted Confidence Sequences for Bounded Means","created":"2026-05-08","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":"2608.19903","title":"Where Does the Union Bound Go? Best-Arm Identification and Strong FWER Control","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2609.13703","title":"Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2609.30360","title":"Cost-Aware Best-LLM Identification using Dueling Feedback","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2610.01951","title":"Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\\beta$-EB-TCI for Bernoulli Bandits","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}