The paper introduces a learning-based surrogate approach for stochastic optimization problems where uncertainty depends on the decision, modeled via a nonparametric regression. It constructs a surrogate that embeds iteratively updated Jacobian estimates, using an adaptive random design that focuses sampling near the current iterate to achieve dimension‑independent convergence of the Jacobian estimates. The resulting learning‑based stochastic prox‑linear (L‑SPL) algorithm demonstrates nonasymptotic convergence rates and outperforms existing methods in sample efficiency and objective value in numerical experiments.
By Boyang Shen, Junyi Liu
arXiv:2609.36712v1 Announce Type: cross
Abstract: Accurately learning nonlinear dynamics from a finite-duration experiment requires the efficient collection of informative data. We address this chall...
By Juncal Arbelaiz, Anushri Arora, Jonathan W. Pillow
arXiv:2606. 15359v1 Announce Type: new Abstract: Diffusion models have emerged as powerful tools for planning and control by learning multimodal distributions over actions and trajectories.
By Paolo Giaretta, Zeyang Li, Navid Azizan
SABLE is a Bayesian optimisation method designed for high‑dimensional latent spaces where the latent dimension far exceeds the evaluation budget. It uses a Bayesian affine surrogate that decomposes each query into an in‑span component optimized by expected improvement and an off‑span component governed by a scalar norm, with a finite‑horizon schedule to avoid under‑exploration. A recompression scheme reduces the number of pseudo‑observations to ≠O(M), keeping refitting costs manageable while achieving high sample efficiency and rapid decision times on synthetic and latent‑space optimisation tasks.
By Erik Bodin, Lisa Maria Kreusser, Donney Fan, Henry Moss, Geoff Pleiss, Nicolas Durrande
The paper explores how to use gradients of simulator outputs with respect to input parameters to improve Bayesian inference for expensive simulators. By incorporating gradient information into Gaussian process surrogate models, the authors show that Bayesian optimization can converge faster under a limited simulation budget. They find that reverse‑mode differentiation yields efficiency gains, while forward‑mode does not offset its computational cost, especially when the number of parameters exceeds the output dimensionality.
By \v{S}imon Sold\'at, V\'aclav \v{S}m\'idl
arXiv:2502.00550v2 Announce Type: replace
Abstract: Surrogate models of parametric dynamical systems are essential for many-query and real-time predictions in engineering applications such as design...
By Bongseok Kim, Haoyang Zheng, Michael Penwarden, Guang Lin
arXiv:2606. 09949v1 Announce Type: cross Abstract: Data-driven PDE surrogates are trained with data produced by numerical PDE solvers.
By Pierre Cesar (DATAMOVE), Sofya Dymchenko (DATAMOVE), Abhishek Purandare (DATAMOVE), Bruno Raffin (DATAMOVE)
arXiv:2603. 17057v2 Announce Type: replace-cross Abstract: Active multi-fidelity surrogate modeling is developed for multi-condition airfoil shape optimization to reduce high-fidelity CFD cost while retaining RANS-consistent aerodynamic metrics.
By Isaac Robledo, Alberto Vilari\~no, Arnau Mir\'o, Oriol Lehmkuhl, Carlos Sanmiguel Vila, Rodrigo Castellanos
HyperMC is a multi‑fidelity hyperparameter tuning framework for stochastic gradient Markov chain Monte Carlo (SGMCMC) that combines Hyperband-style resource allocation with kernel Stein discrepancy (KSD) evaluation. It uses successive‑halving brackets to explore a continuous hyperparameter space while progressively refining promising configurations within a fixed computational budget. Robust HyperMC further introduces global grid initialization and elite‑guided local refinement to reduce sensitivity to random candidate generation and noisy evaluations, and theoretical analysis shows that the successive‑halving component selects a near‑optimal configuration with high probability under suitable conditions.
By Ming Tan, Xiyun Jiao
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.
By Trevor Campbell, Jonathan H. Huggins, Kyurae Kim, Charles C. Margossian
arXiv:2406.04261v2 Announce Type: replace
Abstract: Simulators are vital in science and engineering, as they faithfully model the influence of design parameters on real-world observations. Optimizing...
By Tim Bakker, Fabio Valerio Massoli, Thomas Hehn, Tribhuvanesh Orekondy, Arash Behboodi
Accurately learning nonlinear dynamics from a finite-duration experiment requires the efficient collection of informative data. We address this challenge for stochastic controlled nonlinear dynamical...