{"total":38,"rows":[{"id":"2302.00615","title":"GFlowNets for AI-Driven Scientific Discovery","created":"2023-02-01","cited_by_count":63,"area":null},{"id":"2108.09262","title":"Optimal Order Simple Regret for Gaussian Process Bandits","created":"2021-08-20","cited_by_count":54,"area":null},{"id":"2102.03324","title":"GIBBON: General-purpose Information-Based Bayesian OptimisatioN","created":"2021-02-05","cited_by_count":47,"area":null},{"id":"2212.04450","title":"GAUCHE: A Library for Gaussian Processes in Chemistry","created":"2022-12-06","cited_by_count":41,"area":null},{"id":"2301.10123","title":"Inducing Point Allocation for Sparse Gaussian Processes in High-Throughput Bayesian Optimisation","created":"2023-01-24","cited_by_count":32,"area":null},{"id":"2205.14090","title":"Surrogate modeling for Bayesian optimization beyond a single Gaussian process","created":"2022-05-27","cited_by_count":22,"area":null},{"id":"2202.04005","title":"Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning","created":"2022-02-08","cited_by_count":18,"area":null},{"id":"2507.03910","title":"Return of the Latent Space COWBOYS: Re-thinking the use of VAEs for Bayesian Optimisation of Structured Spaces","created":"2025-07-05","cited_by_count":14,"area":null},{"id":"2110.15458","title":"Open Problem: Tight Online Confidence Intervals for RKHS Elements","created":"2021-10-28","cited_by_count":13,"area":null},{"id":"2512.00170","title":"We Still Don't Understand High-Dimensional Bayesian Optimization","created":"2025-11-28","cited_by_count":12,"area":null},{"id":"2302.08436","title":"Trieste: Efficiently Exploring The Depths of Black-box Functions with TensorFlow","created":"2023-02-16","cited_by_count":11,"area":null},{"id":"2302.00392","title":"Delayed Feedback in Kernel Bandits","created":"2023-02-01","cited_by_count":10,"area":null},{"id":"2406.04308","title":"Approximation-Aware Bayesian Optimization","created":"2024-06-06","cited_by_count":8,"area":null},{"id":"2412.20375","title":"Scalable Bayesian Optimization via Focalized Sparse Gaussian Processes","created":"2024-12-29","cited_by_count":8,"area":null},{"id":"2211.01053","title":"Fantasizing with Dual GPs in Bayesian Optimization and Active Learning","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2302.11533","title":"MONGOOSE: Path-wise Smooth Bayesian Optimisation via Meta-learning","created":"2023-02-22","cited_by_count":6,"area":null},{"id":"2204.05411","title":"$\\{\\text{PF}\\}^2$ES: Parallel Feasible Pareto Frontier Entropy Search for Multi-Objective Bayesian Optimization","created":"2022-04-11","cited_by_count":5,"area":null},{"id":"2206.02437","title":"Information-theoretic Inducing Point Placement for High-throughput Bayesian Optimisation","created":"2022-06-06","cited_by_count":5,"area":null},{"id":"2206.13326","title":"A penalisation method for batch multi-objective Bayesian optimisation with application in heat exchanger design","created":"2022-06-27","cited_by_count":5,"area":null},{"id":"2505.07594","title":"Finite-Sample-Based Reachability for Safe Control with Gaussian Process Dynamics","created":"2025-05-12","cited_by_count":5,"area":null},{"id":"2506.11831","title":"Bayesian Optimization with Inexact Acquisition: Is Random Grid Search Sufficient?","created":"2025-06-13","cited_by_count":5,"area":null},{"id":"2305.00322","title":"Toward $L_\\infty$-recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields","created":"2023-04-29","cited_by_count":4,"area":null},{"id":"2603.09276","title":"On Regret Bounds of Thompson Sampling for Bayesian Optimization","created":"2026-03-10","cited_by_count":3,"area":null},{"id":"2406.03616","title":"BEACON: A Bayesian Optimization Inspired Strategy for Efficient Novelty Search","created":"2024-06-05","cited_by_count":2,"area":null},{"id":"2508.10970","title":"Multi-fidelity batch Bayesian optimization for bioprocess development across scales","created":"2025-08-14","cited_by_count":2,"area":null},{"id":"2603.01470","title":"Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds","created":"2026-03-02","cited_by_count":2,"area":null},{"id":"2306.01095","title":"Large-Batch, Iteration-Efficient Neural Bayesian Design Optimization","created":"2023-06-01","cited_by_count":1,"area":null},{"id":"2412.18789","title":"On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise","created":"2024-12-25","cited_by_count":1,"area":null},{"id":"2505.21133","title":"Robust and Computation-Aware Gaussian Processes","created":"2025-05-27","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":"2303.14291","title":"Applications of Gaussian Processes at Extreme Lengthscales: From Molecules to Black Holes","created":"2023-03-24","cited_by_count":0,"area":null},{"id":"2506.22186","title":"Thompson Sampling-Based Learning and Control for Unknown Dynamic Systems","created":"2025-06-27","cited_by_count":0,"area":null},{"id":"2510.11792","title":"On Thompson Sampling and Bilateral Uncertainty in Additive Bayesian Optimization","created":"2025-10-13","cited_by_count":0,"area":null},{"id":"2604.25025","title":"A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.10654","title":"Active Learning for Gaussian Process Regression Under Self-Induced Boltzmann Weights","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2606.00956","title":"Towards Regret Guarantees for One-Step Lookahead Bayesian Optimization","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2606.30228","title":"B3O: Scalable Boltzmann Batch Bayesian Optimization","created":"2026-06-29","cited_by_count":0,"area":null},{"id":"2606.31284","title":"Sequential sparse Gaussian process quantile regression","created":"2026-06-30","cited_by_count":0,"area":null}],"next_cursor":null}