{"total":59,"rows":[{"id":"2111.12151","title":"Best Arm Identification with Safety Constraints","created":"2021-11-23","cited_by_count":25,"area":null},{"id":"2104.14527","title":"Online certification of preference-based fairness for personalized recommender systems","created":"2021-04-29","cited_by_count":22,"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":"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":"2111.01768","title":"Nearly Optimal Algorithms for Level Set Estimation","created":"2021-11-02","cited_by_count":17,"area":null},{"id":"2311.03992","title":"Bandit Pareto Set Identification: the Fixed Budget Setting","created":"2023-11-07","cited_by_count":14,"area":null},{"id":"2111.03290","title":"Maillard Sampling: Boltzmann Exploration Done Optimally","created":"2021-11-05","cited_by_count":13,"area":null},{"id":"2206.05255","title":"Interactively Learning Preference Constraints in Linear Bandits","created":"2022-06-10","cited_by_count":11,"area":null},{"id":"2208.09215","title":"Almost Cost-Free Communication in Federated Best Arm Identification","created":"2022-08-19","cited_by_count":11,"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":"2211.14768","title":"Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget","created":"2022-11-27","cited_by_count":9,"area":null},{"id":"2303.07154","title":"Differential Good Arm Identification","created":"2023-03-13","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":"2406.11485","title":"Active clustering with bandit feedback","created":"2024-06-17","cited_by_count":7,"area":null},{"id":"2310.10359","title":"An Anytime Algorithm for Good Arm Identification","created":"2023-10-16","cited_by_count":6,"area":null},{"id":"2106.10166","title":"Problem Dependent View on Structured Thresholding Bandit Problems","created":"2021-06-18","cited_by_count":5,"area":null},{"id":"2401.15879","title":"lil'HDoC: An Algorithm for Good Arm Identification under Small Threshold Gap","created":"2024-01-29","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":"2102.12094","title":"Combinatorial Pure Exploration with Bottleneck Reward Function","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2110.09133","title":"Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits","created":"2021-10-18","cited_by_count":3,"area":null},{"id":"2406.15648","title":"Testing the Feasibility of Linear Programs with Bandit Feedback","created":"2024-06-21","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":"2102.12090","title":"Continuous Mean-Covariance Bandits","created":"2021-02-24","cited_by_count":2,"area":null},{"id":"2111.14778","title":"Contextual Combinatorial Multi-output GP Bandits with Group Constraints","created":"2021-11-29","cited_by_count":2,"area":null},{"id":"2202.12872","title":"AutoFR: Automated Filter Rule Generation for Adblocking","created":"2022-02-25","cited_by_count":2,"area":null},{"id":"2205.13689","title":"Safety Aware Changepoint Detection for Piecewise i.i.d. Bandits","created":"2022-05-27","cited_by_count":2,"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":"2310.17901","title":"Improving the Knowledge Gradient Algorithm","created":"2023-10-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":"2408.14195","title":"Representative Arm Identification: A fixed confidence approach to identify cluster representatives","created":"2024-08-26","cited_by_count":2,"area":null},{"id":"2410.20640","title":"Near Optimal Pure Exploration in Logistic Bandits","created":"2024-10-28","cited_by_count":2,"area":null},{"id":"2505.15342","title":"Policy Testing in Markov Decision Processes","created":"2025-05-21","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":"2112.04083","title":"Best Arm Identification under Additive Transfer Bandits","created":"2021-12-08","cited_by_count":1,"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":"2211.03985","title":"Adaptive Data Depth via Multi-Armed Bandits","created":"2022-11-08","cited_by_count":1,"area":null},{"id":"2307.01371","title":"Efficient Determination of Safety Requirements for Perception Systems","created":"2023-07-03","cited_by_count":1,"area":null},{"id":"2402.08209","title":"Thresholding Data Shapley for Data Cleansing Using Multi-Armed Bandits","created":"2024-02-13","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":"2503.10386","title":"Multi-thresholding Good Arm Identification with Bandit Feedback","created":"2025-03-13","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":"2603.04007","title":"Fixed-Budget Constrained Best Arm Identification in Grouped Bandits","created":"2026-03-04","cited_by_count":1,"area":null},{"id":"2604.14860","title":"Best of both worlds: Stochastic & adversarial best-arm identification","created":"2026-04-16","cited_by_count":1,"area":null},{"id":"2606.17515","title":"Anytime-valid Optimal Policy Identification","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2607.06879","title":"Best-Arm Identification with Generative Proxy","created":"2026-07-08","cited_by_count":1,"area":null},{"id":"2212.05190","title":"Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy","created":"2022-12-10","cited_by_count":0,"area":null},{"id":"2212.13157","title":"Gaussian Process Classification Bandits","created":"2022-12-26","cited_by_count":0,"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":"2306.16578","title":"Allocating Divisible Resources on Arms with Unknown and Random Rewards","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2402.10429","title":"Fixed Confidence Best Arm Identification in the Bayesian Setting","created":"2024-02-16","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":"2505.10147","title":"Near Optimal Best Arm Identification for Clustered Bandits","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2507.23073","title":"Locally Differentially Private Thresholding Bandits","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2509.02119","title":"Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms","created":"2025-09-02","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":"2603.18514","title":"On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2608.22120","title":"The Price of Decentralization in Top-$K$ Arm Identification","created":"2026-08-22","cited_by_count":0,"area":null}],"next_cursor":null}