{"total":35,"rows":[{"id":"2108.09262","title":"Optimal Order Simple Regret for Gaussian Process Bandits","created":"2021-08-20","cited_by_count":54,"area":null},{"id":"2210.16913","title":"Revisiting Simple Regret: Fast Rates for Returning a Good Arm","created":"2022-10-30","cited_by_count":25,"area":null},{"id":"2402.15025","title":"Practice Makes Perfect: Planning to Learn Skill Parameter Policies","created":"2024-02-22","cited_by_count":23,"area":null},{"id":"2103.12452","title":"Bandits with many optimal arms","created":"2021-03-23","cited_by_count":17,"area":null},{"id":"2504.19139","title":"Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environments","created":"2025-04-27","cited_by_count":12,"area":null},{"id":"2302.01539","title":"A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization","created":"2023-02-03","cited_by_count":9,"area":null},{"id":"2105.10721","title":"From Finite to Countable-Armed Bandits","created":"2021-05-22","cited_by_count":8,"area":null},{"id":"2202.13001","title":"Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms","created":"2022-02-25","cited_by_count":8,"area":null},{"id":"2101.01086","title":"Be Greedy in Multi-Armed Bandits","created":"2021-01-04","cited_by_count":7,"area":null},{"id":"2211.01498","title":"On the Safety of Interpretable Machine Learning: A Maximum Deviation Approach","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2505.21372","title":"Improving LLM-based Global Optimization with Search Space Partitioning","created":"2025-05-27","cited_by_count":6,"area":null},{"id":"2110.12160","title":"Multi-armed Bandit Algorithm against Strategic Replication","created":"2021-10-23","cited_by_count":5,"area":null},{"id":"2201.12975","title":"Rotting Infinitely Many-armed Bandits","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2210.00340","title":"Speed Up the Cold-Start Learning in Two-Sided Bandits with Many Arms","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2211.01743","title":"Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits","created":"2022-11-01","cited_by_count":3,"area":null},{"id":"2505.18871","title":"Non-Stationary Lipschitz Bandits","created":"2025-05-24","cited_by_count":3,"area":null},{"id":"2402.05144","title":"A Bandit Approach with Evolutionary Operators for Model Selection","created":"2024-02-07","cited_by_count":2,"area":null},{"id":"2404.14202","title":"An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints","created":"2024-04-22","cited_by_count":2,"area":null},{"id":"2105.14422","title":"Periodic-GP: Learning Periodic World with Gaussian Process Bandits","created":"2021-05-30","cited_by_count":1,"area":null},{"id":"2110.12118","title":"Bandits with Dynamic Arm-acquisition Costs","created":"2021-10-23","cited_by_count":1,"area":null},{"id":"2207.08130","title":"Discover Life Skills for Planning with Bandits via Observing and Learning How the World Works","created":"2022-07-17","cited_by_count":1,"area":null},{"id":"2210.01295","title":"Max-Quantile Grouped Infinite-Arm Bandits","created":"2022-10-04","cited_by_count":1,"area":null},{"id":"2501.01057","title":"HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach","created":"2025-01-02","cited_by_count":1,"area":null},{"id":"2502.00108","title":"Tracking Most Significant Shifts in Infinite-Armed Bandits","created":"2025-01-31","cited_by_count":1,"area":null},{"id":"2101.01502","title":"Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs","created":"2021-01-05","cited_by_count":0,"area":null},{"id":"2102.05164","title":"Nonstochastic Bandits with Infinitely Many Experts","created":"2021-02-09","cited_by_count":0,"area":null},{"id":"2205.06297","title":"Improving Sequential Query Recommendation with Immediate User Feedback","created":"2022-05-12","cited_by_count":0,"area":null},{"id":"2301.07243","title":"Complexity Analysis of a Countable-armed Bandit Problem","created":"2023-01-18","cited_by_count":0,"area":null},{"id":"2407.12178","title":"Exploration Unbound","created":"2024-07-16","cited_by_count":0,"area":null},{"id":"2507.20446","title":"BOASF: A Unified Framework for Speeding up Automatic Machine Learning via Adaptive Successive Filtering","created":"2025-07-28","cited_by_count":0,"area":null},{"id":"2601.16083","title":"Probably Approximately Correct Maximum A Posteriori Inference","created":"2026-01-22","cited_by_count":0,"area":null},{"id":"2605.03493","title":"Bandits on graphs and structures","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2605.31034","title":"Annealed Softmax Greedy in Many-Armed Bayesian Bandits","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2606.08369","title":"An Information-Theoretic Definition for Open-Ended Learning","created":"2026-06-06","cited_by_count":0,"area":null},{"id":"2609.01335","title":"Bandits in Prod: Hyperparameter Optimization at Inference Time","created":"2026-09-01","cited_by_count":0,"area":null}],"next_cursor":null}