← Back to all news
arXiv AI By Trishit Mondal, Irina Tezaur, Anthony Gruber

Adaptive hybrid coupling with operator inference, the overlapping Schwarz alternating method and reinforcement learning

Read the original on arXiv AI →

The paper presents a reinforcement‑learning framework that dynamically selects between full‑order models (FOMs) and reduced‑order models (ROMs) in hybrid domain decomposition simulations using the overlapping Schwarz alternating method (O‑SAM). Offline‑trained Deep Q‑networks choose subdomain‑local FOMs or pre‑trained Operator Inference ROMs based on a reward that balances accuracy, computational cost, and model‑switching frequency, and the learned policies are deployed on unseen problem instances without needing a reference FOM solution. Experiments on a 1D advection‑diffusion problem and a 3D elastic wave propagation benchmark show that the RL‑guided policies adaptively allocate high‑fidelity resolution as features propagate, outperforming static FOM/ROM assignments and demonstrating the feasibility of predictive online fidelity adaptation in Schwarz‑based hybrid simulations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv Machine Learning
Sep 17

Hybrid coupling with numerics-informed neural networks and the overlapping Schwarz alternating method

The paper introduces a hybrid modeling framework that couples numerics-informed neural networks (NINNs) with classical full order models (FOMs) via the overlapping Schwarz alternating method. It demonstrates that a monolithic NINN can be accurately trained on a two-dimensional advection-diffusion problem in a high Peclet-number regime without domain decomposition, and then uses overlapping multiplicative Schwarz to couple a pre-trained, subdomain-local NINN with a neighboring FOM while keeping the NINN weights fixed during iteration. Two training strategies—top-down, using full-domain FOM-FOM Schwarz data, and bottom-up, generating synthetic boundary traces—both yield hybrid NINN-FOM solutions that closely match the corresponding FOM-FOM Schwarz results.

By George Chumbipuma, Irina Tezaur, Alejandro Diaz, Beatrice Riviere
diffusion
More like this →
arXiv Machine Learning
Jun 19

DADP: Domain Adaptive Diffusion Policy

arXiv:2602. 04037v3 Announce Type: replace Abstract: Learning domain adaptive policies that can generalize to unseen transition dynamics, remains a fundamental challenge in learning-based control.

By Pengcheng Wang, Qinghang Liu, Haotian Lin, Yiheng Li, Guojian Zhan, Masayoshi Tomizuka, Yixiao Wang
diffusionroboticsbenchmarks
More like this →
arXiv AI
Jul 14

Reinforcement Learning with Verifiable Physics: Post-training LLMs with Continuous Rewards

arXiv:2607. 10474v1 Announce Type: cross Abstract: Partial differential equations (PDEs) are foundational to modeling in science and engineering, but constructing reliable numerical solvers remains labor-intensive, demanding expert knowledge of discretization schemes, stability conditions, and boundary treatments.

By Pengfei Cai, Utkarsh Utkarsh, Alan Edelman, Christopher Vincent Rackauckas, Rafael Gomez-Bombarelli
llmsreinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
Sep 15

Single-condition neural solvers encode transferable response spaces for parametric differential equations

The paper demonstrates that a neural solver trained on a single condition can generate a reusable response space via its output Jacobian, enabling efficient cross‑condition solution transfer. By introducing Linearized Subspace Transfer (LST) and Active Transfer Modeling (ATM), the authors recover target solutions through residual minimization and selectively acquire additional response spaces based on coverage indicators. Experiments on six PDE systems show that this approach reduces error and offline construction cost compared to physics‑informed baselines, achieving significant accuracy gains and rapid target adaptation.

By Wenbo Cao, Weiwei Zhang
More like this →