{"total":28,"rows":[{"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":"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":"2206.05255","title":"Interactively Learning Preference Constraints in Linear Bandits","created":"2022-06-10","cited_by_count":11,"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":"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":"2310.10359","title":"An Anytime Algorithm for Good Arm Identification","created":"2023-10-16","cited_by_count":6,"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":"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":"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":"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":"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":"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":"2402.09467","title":"Optimal Thresholding Linear Bandit","created":"2024-02-11","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":"2406.19738","title":"Batch Entanglement Detection in Parameterized Qubit States using Classical Bandit Algorithms","created":"2024-06-28","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":"2609.38659","title":"Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.12960","title":"DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}