Search arXivSearch

arXiv · 2508.13490

DyMixOp: A Neural Operator Designed from a Complex Dynamics Perspective with Local-Global Mixing for Solving PDEs

Abstract

A primary challenge in using neural networks to approximate nonlinear dynamical systems governed by partial differential equations (PDEs) lies in recasting these systems into a tractable representation particularly when the dynamics are inherently non-linearizable or require infinite-dimensional spaces for linearization. To address this challenge, we introduce DyMixOp, a novel neural operator framework for PDEs that integrates theoretical insights from complex dynamical systems. Grounded in dynamics-aware priors and inertial manifold theory, DyMixOp projects the original infinite-dimensional PDE dynamics onto a finite-dimensional latent space. This reduction preserves both essential linear structures and dominant nonlinear interactions, thereby establishing a physically interpretable and computationally structured foundation. Central to this approach is the local-global mixing (LGM) transformation, a key architectural innovation inspired by the convective nonlinearity in turbulent flows. By multiplicatively coupling local fine-scale features with global spectral information, LGM effectively captures high-frequency details and complex nonlinear couplings while mitigating the spectral bias that plagues many existing neural operators. The framework is further enhanced by a dynamics-informed architecture that stacks multiple LGM layers in a hybrid configuration, incorporating timescale-adaptive gating and parallel aggregation of intermediate dynamics. This design enables robust approximation of general evolutionary dynamics across diverse physical regimes. Extensive experiments on seven benchmark PDE systems spanning 1D to 3D, elliptic to hyperbolic types demonstrate that DyMixOp achieves state-of-the-art performance on six of them, significantly reducing prediction errors (by up to 94.3% in chaotic regimes) while maintaining computational efficiency and strong scalability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pengyu Lai, Yixiao Chen, Dewu Yang, Rui Wang, Feng Wang, Hui Xu. 2026-02-09. DyMixOp: A Neural Operator Designed from a Complex Dynamics Perspective with Local-Global Mixing for Solving PDEs. https://arxiv.org/abs/2508.13490

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG