AI & ML
Kernel-based guarantees for nonlinear parametric models in Bayesian optimization
arXiv stat.ML0 views
arXiv:2605.13160v2 Announce Type: replace Abstract: Modern Bayesian optimization and adaptive sampling methods increasingly rely on nonlinear parametric models, such as neural networks, yet theoretical guarantees for such models under adaptive data collection remain limited. Existing analyses largely focus on Gaussian processes, kernel machines, linear models, or linearized neural approximations, leaving a gap between theory and the nonlinear models used in practice. We develop a kernel-based framework for analyzing regularized parametric models trained on adaptively collected data. Our approach uses kernels over the parameter space to induce reproducing kernel Hilbert space structures over the corresponding model class, yielding confidence bounds for models trained with a broad class of regularized losses. We show how these bounds can establish convergence guarantees for approximate Thompson sampling and provide a foundation for analyzing broader likelihood-free Bayesian optimization methods. These results provide a unified route to analyzing nonlinear models in Bayesian optimization and related adaptive optimization settings.
Source:https://arxiv.org/abs/2605.13160PreviousSharp feature-learning transitions and Bayes-optimal neural scaling laws in extensive-width networksNextBatched Stochastic Linear Bandits with 1-Bit Communication Constraints
Related posts
Sam Altman says his life is so weird that he’s unphased by Andrew Garfield portraying him in upcoming movie
0TechCrunch
Gemini price increases: Carbon and Argon double on 1 December 2026, Flash on 1 January 2027
0dev.to
OpenAI shuts down whisper-1 and its other transcription models on 26 February 2027: a migration checklist
0dev.to
YouTube Partner Program changes on 1 February 2027: the 31 January deadline and the new entry thresholds
0dev.to
The ‘GTA 6’ Work Blackout Is Here
0Wired
Best Buy sells Blu-rays online and in-store again
0Ars Technica