arXiv Machine Learning

Information-theoretic receding-horizon active learning of nonlinear dynamical systems

arXiv Statistics ML
Sep 11

Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs

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 Machine Learning
Jul 27

On the Identifiability of Controlled World Models

arXiv:2607. 22430v1 Announce Type: new Abstract: Learning world models that infer environment dynamics from high-dimensional observations and predict outcomes under candidate actions is central to planning and control.

By Xiangteng Zhang, Yang Guan, Bo Zhang, Ya-Qin Zhang, Shengbo Eben Li
arXiv Machine Learning
Jun 25

Efficient Adaptive Data Acquisition via Pretrained Belief Representations

arXiv:2606. 25197v1 Announce Type: new Abstract: Learning effective policies for adaptive data acquisition remains challenging: posterior-based methods rely on surrogate models and posterior approximations that can be misspecified or biased, while direct policy-learning methods map from historical observations and fail to exploit available model representations, making learning harder.

By Daolang Huang, Zhuoyue Huang, Conor Hassan, Luigi Acerbi, Samuel Kaski, Tom Rainforth
arXiv Machine Learning
Sep 22

In-context learning from self-generated trajectories for adaptive model reduction

The paper introduces an in‑span adaptation technique for reduced‑order models, where the reduced subspace is continually updated using the model’s own predictions via an incremental singular‑value decomposition with a forgetting factor. This creates a trajectory‑informed spectral preconditioner that reweights and realigns the basis without changing the subspace, enabling the model to better absorb future out‑of‑span corrections. The authors demonstrate the method on a 3‑D spiral example and nonlinear PDEs such as viscous Burgers and Fisher–KPP, and relate the approach to in‑context learning in dynamical systems.

By Amirpasha Hedayat, Laura Balzano, Karthik Duraisamy