{"slug": "no-regret-bayesian-optimization-with-finite-library-input-warped-kernels", "title": "No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels", "summary": "Researchers introduced Finite-Library Input-Warped Bayesian Optimization (FLIWBO), a method that adapts input geometry in Gaussian-process Bayesian optimization while retaining convergence guarantees, outperforming raw-coordinate GP-UCB on benchmarks including Fashion-MNIST hyperparameter optimization and a 20-dimensional multi-agent system design study. The approach, detailed in arXiv:2609.02993v1, selects warps from a finite library of smooth input maps and incurs an explicit sqrt(N_epsilon) library-size cost, with code available on GitHub.", "body_md": "arXiv:2609.02993v1 Announce Type: new\nAbstract: Gaussian-process Bayesian optimization (GP-BO) excels at black-box optimization of costly functions, e.g., hyperparameter optimization (HPO) and multi-agent system (MAS) design. Convergence-rate guarantees exist for select methods, notably GP upper confidence bound (GP-UCB), but require a fixed kernel. Critically, the kernel encodes how input proximity affects objective value similarity. When raw coordinates poorly match this geometry - as with log-scaled hyperparameters or localized peaks - input warping can greatly improve sample efficiency, yet known GP-UCB proofs require a fixed kernel. We propose Finite-Library Input-Warped Bayesian Optimization (FLIWBO), which selects warps from a finite library of smooth input maps by any history-dependent rule. It adapts the input geometry to accelerate learning while retaining high-probability convergence guarantees under mild hypotheses, with an explicit $\\sqrt(N_\\varepsilon)$ library-size cost. Controlled diagnostics show that finite-library warping repairs planted geometry mismatches and identify FLIWBO failure cases. Across four repeated benchmarks - warped synthetic objectives, a confidence-fence trap, and Fashion-MNIST HPO - FLIWBO-UCB beats raw-coordinate GP-UCB under misspecified geometry, escapes traps that defeat even oracle-warp expected improvement, and recovers much of the gain from manual log scaling, while leading the tested methods that admit a matching regret guarantee. A 20-dimensional MAS design study further shows feasibility under costly noisy evaluations. Code for experiments is available: https://github.com/edvin-ketabati/bogp-paper-experiments.", "url": "https://wpnews.pro/news/no-regret-bayesian-optimization-with-finite-library-input-warped-kernels", "canonical_source": "https://arxiv.org/abs/2609.02993", "published_at": "2026-09-04 04:00:00+00:00", "updated_at": "2026-09-04 04:25:04.035502+00:00", "lang": "en", "topics": ["machine-learning", "artificial-intelligence", "ai-research"], "entities": ["arXiv", "FLIWBO", "GP-UCB", "Fashion-MNIST", "GitHub"], "alternates": {"html": "https://wpnews.pro/news/no-regret-bayesian-optimization-with-finite-library-input-warped-kernels", "markdown": "https://wpnews.pro/news/no-regret-bayesian-optimization-with-finite-library-input-warped-kernels.md", "text": "https://wpnews.pro/news/no-regret-bayesian-optimization-with-finite-library-input-warped-kernels.txt", "jsonld": "https://wpnews.pro/news/no-regret-bayesian-optimization-with-finite-library-input-warped-kernels.jsonld"}}