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

Grand Theft Auto VI has arrived
0The Verge

Suno now lets you make AI videos for your AI music
0The Verge
India’s Humyn Labs raises $47M to feed U.S. robotics companies the data they need
0TechCrunch
Felicis leads $7.5M bet on Unsiloed AI to make enterprise documents usable by AI agents
0TechCrunch

GPT-6.2 Astra and Sol: Cheaper, Shorter Answers, and the Fine Print
0dev.to
I had AI read my entire field, Theoretical Astrophysics
0Hacker News