arXiv (All)
open access
Convergence Rates of Gaussian Process Thompson Sampling for Efficient Global Optimization
Efficient global optimization aims to identify a global optimum of an expensive black-box function within a limited evaluation budget $N$. We investigate the convergence rates of Gaussian process Thompson sampling (GP-TS) under noiseless observations, assuming a fixed objective function in a reprodu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs#1062806
- Locally adaptive step sizes for Hamiltonian Monte Carlo methods#1328096
- SULA: Robust Langevin Sampling via Drift-Diffusion Saturation#1354359
- Stability and Generalization of Stochastic Nonconvex Optimization under Heavy-Tailed Noise: From Gradient Norm to Goldstein Stationarity#1198861
- Data availability for "ChemFit: a framework for automated high-dimensional model parameter optimization"#206215
Record · ID 1354607
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive