{"total":16,"rows":[{"id":"2502.06363","title":"Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance","created":"2025-02-10","cited_by_count":15,"area":null},{"id":"2506.01393","title":"Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization","created":"2025-06-02","cited_by_count":13,"area":null},{"id":"2502.19006","title":"Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits","created":"2025-02-26","cited_by_count":9,"area":null},{"id":"2401.17037","title":"Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration","created":"2024-01-30","cited_by_count":8,"area":null},{"id":"2403.12732","title":"Tighter Confidence Bounds for Sequential Kernel Regression","created":"2024-03-19","cited_by_count":8,"area":null},{"id":"2410.16052","title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits","created":"2024-10-21","cited_by_count":8,"area":null},{"id":"2402.08406","title":"Transition Constrained Bayesian Optimization via Markov Decision Processes","created":"2024-02-13","cited_by_count":7,"area":null},{"id":"2502.16870","title":"Distributionally Robust Active Learning for Gaussian Process Regression","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2603.12627","title":"Batched Kernelized Bandits: Refinements and Extensions","created":"2026-03-13","cited_by_count":3,"area":null},{"id":"2605.10299","title":"Nearly-Optimal Algorithm for Adversarial Kernelized Bandits","created":"2026-05-11","cited_by_count":1,"area":null},{"id":"2608.16492","title":"Improved Regret Analysis for Parallel Gaussian Process Bandit Optimization","created":"2026-08-17","cited_by_count":1,"area":null},{"id":"2402.13182","title":"Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness","created":"2024-02-20","cited_by_count":0,"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":"2507.13639","title":"Differential Privacy in Kernelized Contextual Bandits via Random Projections","created":"2025-07-18","cited_by_count":0,"area":null},{"id":"2605.05967","title":"Sharper Guarantees for Misspecified Kernelized Bandit Optimization","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2610.16187","title":"Exploration strategies for Gaussian process bandit optimization with inference regret guarantees","created":"2026-10-12","cited_by_count":0,"area":null}],"next_cursor":null}