arXiv:2609.08620v1 Announce Type: cross
Abstract: We address the challenge of scalable uncertainty quantification in large-scale scientific applications, where complex state-of-the-art machine learni...
By Yousra El-Bachir, Frederik Van der Veken, Davide di Croce, Carlo Emilio Montanari, Massimo Giovannozzi, Ekaterina Krymova, Tatiana Pieloni
arXiv:2604.19146v2 Announce Type: replace
Abstract: Particle accelerator beamline optimization is a high-dimensional control problem traditionally requiring significant expert intervention. We presen...
By Anwar Ibrahim, Fedor Ratnikov, Maxim Kaledin, Alexey Petrenko, Denis Derkach
Effective model-based reinforcement learning in stochastic environments requires planning that accounts for predictive uncertainty. Propagating full state distributions analytically offers a principled way to do this, but has traditionally required restrictive policy or reward structures to remain tractable.
The paper introduces PSPO, a method for offline policy optimization that treats the dynamics model as a random variable, enabling controlled exploration of out‑of‑distribution (OOD) regions while maintaining robustness. By alternating updates of the posterior distribution and the policy, PSPO achieves a regularized optimization algorithm with convergence guarantees. Experiments on standard benchmarks show that PSPO outperforms state‑of‑the‑art baselines and retains a pessimism‑free property without sacrificing robustness.
By Hongqiang Lin, Dongxu Zhang, Yiding Sun, Mingzhe Li, Ning Yang, Haijun Zhang
arXiv:2606. 31291v1 Announce Type: new Abstract: Deep reinforcement learning has the potential to solve attitude control problems more adaptively, precisely, and robustly by handling nonlinear dynamics, uncertainties, and failure cases more effectively than traditional attitude control approaches.
By Alexander Fabisch, Melvin Laux, Mariela De Lucas \'Alvarez, Edoardo Caroselli, Julian Theis
The paper introduces BUMEX, a reinforcement learning exploration strategy that leverages a set of prior models containing the true transition kernel and reward function. By optimizing over this model set, the method derives upper and lower bounds on the Q‑function to guide exploration, providing theoretical guarantees of convergence to the optimal policy. When the model set follows a bounded‑parameter MDP structure, the optimization becomes convex, enabling finite‑time convergence under mild assumptions and demonstrating accelerated learning in simulations.
By J. S. van Hulst, W. P. M. H. Heemels, D. J. Antunes