{"total":16,"rows":[{"id":"2410.16052","title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits","created":"2024-10-21","cited_by_count":8,"area":null},{"id":"2410.10384","title":"Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal","created":"2024-10-14","cited_by_count":7,"area":null},{"id":"2410.10452","title":"Principled Bayesian Optimisation in Collaboration with Human Experts","created":"2024-10-14","cited_by_count":5,"area":null},{"id":"2410.16692","title":"Lower Bounds for Time-Varying Kernelized Bandits","created":"2024-10-22","cited_by_count":5,"area":null},{"id":"2409.18000","title":"Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel","created":"2024-09-26","cited_by_count":4,"area":null},{"id":"2505.18871","title":"Non-Stationary Lipschitz Bandits","created":"2025-05-24","cited_by_count":3,"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":"2509.15073","title":"Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits","created":"2025-09-18","cited_by_count":1,"area":null},{"id":"2602.07418","title":"Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses","created":"2026-02-07","cited_by_count":1,"area":null},{"id":"2605.10299","title":"Nearly-Optimal Algorithm for Adversarial Kernelized Bandits","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2501.19401","title":"DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Bandits","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2505.13012","title":"Asymptotic Performance of Time-Varying Bayesian Optimization","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2605.25590","title":"Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2605.26585","title":"Near-Optimal Regret in Adversarial Kernel Bandits","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2605.29748","title":"Instance-dependent Stochastic Lipschitz bandit","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2608.18863","title":"Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration","created":"2026-08-19","cited_by_count":0,"area":null}],"next_cursor":null}