Searcharxiv⌕ Search

arXiv subjects

Changhong Mou

Publications and source records attributed to Changhong Mou.

At least 19 recordsLinked to original sources

RSI-PDEbench: A Benchmark for Self-Improving Agents in PDE Solving

Identifying and solving partial differential equations (PDEs) from sampled solution data often requires substantial expert effort in equation discovery, coefficient estimation, and numerical solver configuration, especially under noise and distribution shifts. Can large language model (LLM) agents automate this workflow accurately and efficiently? To investigate this question, we introduce \bench{}, a benchmark of 1,001 cases spanning 42 equation templates, including both classical and fractional PDEs. It provides three evaluation settings: Full evaluates performance on noise-free solution data; Noisy tests robustness to Gaussian noise with an RMS equal to 50\% of the clean-signal RMS; and Hard-OOD tests challenging out-of-distribution generalization to unseen equation templates and shifted coefficient ranges. We further introduce RSI-PDE, a recursively self-improving agent harness that shortlists candidate equations by residual loss, uses relative $L^2$ feedback to refine coefficients and numerical solvers, and applies a validation gate to policy and memory updates. We compare RSI-PDE with single-run baselines and native agent harnesses (Claude Code or Codex) across four frontier models. Across the three settings, RSI-PDE improves the pass rate averaged across the four models by 106.5--181.9\% relative to single-run baselines and by 3.0--19.6\% relative to native harnesses, while reducing total recorded model calls by 46.9\% across the 12 model--setting pairs. These results highlight the potential of validated recursive self-improvement in LLM agents to advance scientific computing.

cs.AI↗

Learning the solution operator of standing waves with a Fourier neural operator

The standing wave problem concerns the space-time periodic motion at the free surface of a two-dimensional, infinitely deep, irrotational flow of an incompressible inviscid fluid under gravity. Although spectrally accurate computations have revealed a rich array of nonlinear wave phenomena, repeatedly evaluating their evolution over large parameter spaces remains challenging, particularly when resolving fine-scale spatial oscillations. We employ a Fourier neural operator (FNO) architecture to learn the solution operator along a numerically computed one-parameter family of symmetric standing waves. Given a wave profile at an instant of rest and a normalized observation time, the learned operator predicts the fluid surface, the velocity potential and the dipole density at the surface at that time. In-distribution tests yield uniformly small relative errors within the training range. Two out-of-distribution experiments characterize extrapolation toward contrasting physical regimes. Toward the free-fall limit, errors concentrate near the sharpening crest, consistent with the spectral truncation in the FNO architecture. Toward the linear limit, absolute errors remain small whereas relative errors increase as the amplitude vanishes. A residual of the governing equations, evaluated independently of reference solutions, complements these tests and provides a diagnostic for exploratory predictions beyond the available data.

physics.flu-dyn↗

Finance-Informed Operator Learning for Option Pricing with Quantum-Compatible Realizations

Pricing European options under local volatility requires repeatedly solving a PDE whose coefficients change with recalibration, while practitioners need both prices and sensitivities across spot-time surfaces. Neural surrogates can amortize these solves, but near expiry the solution loses regularity, making curvature difficult to learn and allowing violations of no-arbitrage bounds. We propose a finance-informed Deep Operator Network (FI-DeepONet) that decomposes the pricing operator into an input-dependent Black-Scholes carrier and a learned correction. The carrier uses strike-line integrated variance, capturing the leading near-expiry curvature singularity, while a smooth monotone Financial Admissibility Layer enforces pointwise price bounds. We derive a short-maturity estimate and differentiated asymptotics for the exact correction, together with identities linking correction error to price, sensitivity, and PDE-residual errors. On in-distribution tests, FI-DeepONet reduces global relative price error by nearly an order of magnitude versus vanilla and physics-informed DeepONet baselines. On parameter-shift OOD tests within the same local-volatility family, generalization is moderate. On index-option data, the frozen model remains accurate without market-specific retraining, though it does not outperform the same-input analytic formula. We also give a quantum-compatible realization in which selected linear maps are exactly compiled or approximated by a restricted diagonal-orthogonal family before supervised adaptation.

math.NA↗

CONTRAMEM: Learning Self-Evolving Procedural Memory from Contrasting Multi-Model Trajectories

Autonomous computer-use agents are increasingly applied to long-horizon tasks requiring coordinated application calls, persistent state tracking, and verifier-sensitive writes, yet they remain prone to procedural failures: misreading application state, tool semantics, or task progress. Procedural memory promises more consistent decisions and less redundant exploration, but constructing high-quality memory without model training remains challenging. We introduce CONTRAMEM, a source-flexible, training-free framework for self-evolving procedural memory that treats same-task outcome variation as supervision: differences in correctness, efficiency, recovery, and failure modes expose outcome-relevant procedural distinctions, distilled into a compact bank of app-level Function Cards and task-level Skill Cards that evolves through localized curation rather than append-only accumulation or whole-bank rewriting. On held-out GAIA2/ARE computer-use tasks, CONTRAMEM more than doubles the success rate across the three source-model targets (26.2% to 55.3%), with consistent per-model gains (GPT-5.5: 27.5 to 61.0; Claude Sonnet 4.6: 28.0 to 52.5; DeepSeek V4 Pro: 23.0 to 52.5). The same bank transfers unchanged to the unseen Qwen3.7 Plus (18.5 to 35.5), indicating transferable procedural knowledge rather than model-specific behavior. The same construction carries over unchanged to AppWorld, beating both no memory and its own single-source self-memory variant for all three mid-tier agents on both public test splits. Under a matched trajectory budget, heterogeneous multi-model trajectories yield stronger memory than self- or same-model multi-rollout memory: the margin comes from contrastive behavioral diversity, not stronger source agents or more sampling.

cs.AI↗

PACE-FNO: Physics-Aligned Canonical Equivariance for Fourier Neural Operators

Neural operators are often tested on states that differ physically from training data. A distinct failure occurs when the physical dynamics are unchanged but the observed coordinate frame differs from training. PACE-FNO addresses this case by estimating the frame, predicting after pulling the field to a canonical representative, and restoring the requested terminal frame. The default inference path uses one forward prediction; optional test-time adaptation (TTA) updates only the low-dimensional coordinate. On translated and Galilean-shifted Burgers and shallow-water systems, PACE-FNO lowers out-of-distribution (OOD) relative error by up to $12\times$ relative to a data-augmented Fourier Neural Operator (FNO+Aug). A matched-estimator control supports attributing the gain to prediction in the canonical frame rather than added estimator capacity. Our analysis separates the canonical approximation error from the two alignment residuals. We also test regional WeatherBench2 time-series forecasting with the fifth-generation ECMWF reanalysis (ERA5) under natural time OOD, where PACE-FNO and FNO achieve nearly identical performance. Experiments with approximate rotation, other backbones, irregular domains, rollouts, and image data delineate the conditions under which the mechanism is effective.

cs.LG↗

Stochastic Physics-Constrained Operator Inference for Complex Systems

Quadratically nonlinear systems driven by additive noise arise throughout science and engineering, both as stochastic dynamical systems in their own right and as reduced-order models (ROMs) of turbulent flows. We propose stochastic physics-constrained operator inference (SPOpInf), a non-intrusive method that learns a stochastic differential equation, i.e., a quadratic--linear drift and a diffusion amplitude, from data. Unlike operator inference (OpInf), which fits a deterministic drift by least squares, SPOpInf maximizes an Euler--Maruyama increment likelihood in which the residual covariance is itself an unknown, so the deterministic and stochastic components are calibrated jointly; it enforces the energy-preserving quadratic structure exactly, through linear equality constraints imposed inside the optimization; and it works in an upper-triangular parametrization that removes the structural non-identifiability of the full quadratic tensor. The resulting optimization is solved by an expectation--maximization (EM)-based iterative learning algorithm that updates the drift coefficients and the noise levels in turn: each iteration requires only an inexpensive weighted least-squares solve for the drift and a residual-variance update for the noise. With five stochastic benchmark systems that show intermittency and chaos, SPOpInf recovers the deterministic operators more accurately than OpInf, satisfies the imposed constraints to machine precision, accurately estimates the noise amplitudes, and reproduces long-time statistics. Applied to a stochastic Burgers equation and a quasi-geostrophic double-gyre flow, the same estimator yields non-intrusive stochastic ROMs that remain stable over long times where unconstrained alternatives blow up.

physics.comp-ph↗

Geometric Identification in Predict-Then-Optimize Learning

Decision-focused surrogates can recover downstream decisions without identifying the quotient report. We characterize the equality set of the convex Smart Predict-then-Optimize surrogate (SPO+) population risk. Under central symmetry, the centered mean class is the unique Bayes minimizer exactly when every nonzero effective displacement makes the old optimizer leave the shifted optimal face with positive probability. This condition separates face crossing from selected-oracle disagreement and gives quantitative local coercivity. Without symmetry, strict crossing alone need not identify the mean; selection balance with reflected crossing restores quotient-report identification, and conditional versions extend the result to measurable predictors. These are population statements, without finite-sample report-recovery or generic transfer-regret guarantees. Closed-form mechanisms reproduce the analytic identities and rates. Portfolio, complete-matrix KuaiRec, and Energy/Storage studies measure predictive fidelity, shifted regret, and fitted-report geometry. A known data-generating process (DGP) companion retains their application geometries while isolating conditional-mean recovery and crossing, without testing the original observational assumptions.

cs.LG↗

Hybrid SINDy-EnKF in Learning Chikungunya Dynamics from Incomplete, Noisy or Partially Observed Data

Current mechanistic models for the transmission dynamics of the Chikungunya virus (CHIKV) rely on uncertain parameters or partially observed data. This limitation challenges the use of theoretical models for understanding and forecasting disease spread. Here we present a hybrid, data-driven model framework that combines Sparse Identification of Nonlinear Dynamics (SINDy) with the Ensemble Kalman Filter (EnKF) for sequential data assimilation. Our numerical experiments show that this approach improves prediction accuracy and provides a good reconstruction of unobserved trajectories under partial observability, a common constraint in real-world epidemiological surveillance. SINDy can be applied to epidemic trajectories, recovering the underlying equations in noise-free conditions. However, standalone SINDy is highly sensitive to noise, leading to spurious terms and poor performance. Hence, we embed the identification procedure within an EnKF framework, which assimilates noisy observations to correct forecast states from the SINDy-derived model and to infer unobserved state variables.

q-bio.PE↗

ATLAS-NN: Adaptive Transfer Learnable Symplectic-aware Neural Network for Long-Time Hamiltonian Dynamics

Modeling Hamiltonian systems over long temporal intervals remains a significant challenge due to intrinsic multiscale structures and rapid nonlinear transitions. While Hamiltonian Neural Networks (HNNs) incorporate geometric invariants to improve stability, they typically rely on a fixed, externally prescribed temporal structure. This lack of adaptability often leads to accumulated phase errors and degraded accuracy in systems with heterogeneous temporal scales. To address these limitations, we put forward the Adaptive Transfer Learnable Symplectic-aware Neural Network (ATLAS-NN). Our framework augments the HNN architecture with a learnable temporal scaling mechanism that parametrize a nonlinear mapping of time, automatically adapting to the system's intrinsic complexity. We propose a two-stage transfer learning strategy: the model is first trained on a short-time \textit{source} interval to identify the Hamiltonian structure and optimal temporal reparameterization; the learned scaling function is then frozen and transferred to an extended \textit{target} interval for fine-tuning. Numerical experiments on nonlinear oscillators and the chaotic Hénon--Heiles system demonstrate that ATLAS-NN provides a more efficient alternative to standard HNNs and traditional symplectic integrators, yielding nearly an order of magnitude reduction in long-time prediction error.

physics.comp-ph↗

Muon-OGD: Muon-based Spectral Orthogonal Gradient Projection for LLM Continual Learning

A central challenge in continual learning for large language models (LLMs) is catastrophic forgetting, where adapting to new tasks can substantially degrade performance on previously learned ones. Existing projection-based methods mitigate such interference by restricting parameter updates to subspaces that are orthogonal to directions associated with past tasks. However, these methods are typically formulated under Euclidean parameter geometry, with update magnitudes and projections governed by the Frobenius norm. The recent empirical success of the Muon optimizer, which applies orthogonalized matrix updates and admits a spectral-norm interpretation, suggests that Frobenius geometry may not be the most effective choice for matrix-valued LLM parameters. Motivated by this observation, we propose Muon-OGD, a spectral-norm-aware continual learning framework that integrates Muon-style operator-norm geometry with orthogonal projection constraints. Our method formulates each update as a spectral-norm-constrained optimization problem with linear non-interference constraints, and solves it efficiently through dual iterations and Newton--Schulz matrix-sign approximations. By applying orthogonalized momentum updates that avoid protected directions associated with prior tasks, Muon-OGD aims to improve the stability--plasticity trade-off in sequential LLM adaptation. We evaluate the proposed method on standard continual learning benchmarks, TRACE, and domain-specific Coding--Math--Medical curricula using both encoder--decoder and decoder-only architectures. Empirically, Muon-OGD consistently improves over sequential fine-tuning and competitive orthogonal-gradient baselines, while remaining computationally scalable. These results suggest that spectral-norm-aware update geometry provides a practical and effective alternative to Frobenius-norm projection for continual learning in LLMs.

cs.LG↗

AdamFLIP: Adaptive Momentum Feedback Linearization Optimization for Hard Constrained PINN Training

Physics-informed neural networks (PINNs) provide a flexible framework for solving forward and inverse problems governed by partial differential equations (PDEs), but standard PINN training typically relies on soft penalty formulations that combine PDE residuals, data mismatch, and initial/boundary conditions using manually chosen weights. This often leads to ill-conditioning, sensitivity to loss weights, and poor constraint satisfaction. In this work, we reformulate PINN training as an equality-constrained optimization problem and propose a novel Adaptive Momentum Feedback Linearization Optimization for Hard Constrained PINN (AdamFLIP). The key idea is to view the constraint residuals as the output of a controlled dynamical system and to compute the Lagrange multiplier as a feedback input that locally drives these residuals toward stable linear contraction dynamics. AdamFLIP then applies Adam-style first- and second-moment adaptation to the resulting feedback-linearized Lagrangian gradient, combining principled constraint handling with the scalability and robustness of adaptive neural-network optimization. We test AdamFLIP on a range of benchmark forward and inverse PDE problem, and it consistently outperforms both the standard soft-constrained PINN and state-of-the-art constrained optimizers. Specifically, on the Navier--Stokes equations benchmark, AdamFLIP \textbf{reduces relative $L_2$ error by more than two thirds} for the predicted solution compared to the next best method. Our AdamFLIP framework provides an effective and computationally scalable hard constraint optimization method for PINN training.

cs.LG↗

Neural-POD: A Plug-and-Play Neural Operator Framework for Infinite-Dimensional Functional Nonlinear Proper Orthogonal Decomposition

AI for science (AI4Science) models often suffer from discretization: learned representations remain tied to the training grid, limiting transfer across resolutions, solvers and applications. We introduce Neural Proper Orthogonal Decomposition (Neural-POD), a plug-and-play neural operator that learns nonlinear, orthogonal basis functions directly in function space and can be integrated in both projection-based reduced order models and operator-learning frameworks such as DeepONet. Neural-POD replaces SVD-derived, resolution-dependent linear modes with continuous, resolution-invariant bases learned via sequential residual minimization, analogous to Gram-Schmidt orthogonalization. The framework supports training under task-specific norms (e.g., $L^2$, $L^1$), improves out-of-distribution generalization to unseen parameter regimes, and captures nonlinear structure in complex systems. Because the learned bases are interpretable and reusable, Neural-POD serves as a general representation module for AI4Science workflows. We demonstrate Neural-POD on Burgers' and Navier-Stokes equations.

physics.comp-ph↗

Morephy-Net: An Evolutionary Multi-objective Optimization for Replica-Exchange-based Physics-informed Neural Operator Learning Networks

We propose an evolutionary Multi-objective Optimization for Replica-Exchange-based Physics-informed operator-learning Networks (Morephy-Net) to solve parametric partial differential equations (PDEs) in noisy data regimes, for both forward prediction and inverse identification. Existing physics-informed neural networks and operator-learning models (e.g., DeepONets and Fourier neural operators) often face three coupled challenges: (i) balancing data/operator and physics residual losses, (ii) maintaining robustness under noisy or sparse observations, and (iii) providing reliable uncertainty quantification. Morephy-Net addresses these issues by integrating: (i) evolutionary multi-objective optimization that treats data/operator and physics residual terms as separate objectives and searches the Pareto front, thereby avoiding ad hoc loss weighting; (ii) replica-exchange stochastic gradient Langevin dynamics to enhance global exploration and stabilize training in non-convex landscapes; and (iii) Bayesian uncertainty quantification obtained from stochastic sampling. We validate Morephy-Net on representative forward and inverse problems, including the one-dimensional Burgers equation and the time-fractional mixed diffusion--wave equation. The results demonstrate consistent improvements in accuracy, noise robustness, and calibrated uncertainty estimates over standard operator-learning baselines.

cs.LG↗

PIP$^2$ Net: Physics-informed Partition Penalty Deep Operator Network

Operator learning has become a powerful tool for accelerating the solution of parameterized partial differential equations (PDEs), enabling rapid prediction of full spatiotemporal fields for new initial conditions or forcing functions. Existing architectures such as DeepONet and the Fourier Neural Operator (FNO) show strong empirical performance but often require large training datasets, lack explicit physical structure, and may suffer from instability in their trunk-network features, where mode imbalance or collapse can hinder accurate operator approximation. Motivated by the stability and locality of classical partition-of-unity (PoU) methods, we investigate PoU-based regularization techniques for operator learning and develop a revised formulation of the existing POU--PI--DeepONet framework. The resulting \emph{P}hysics-\emph{i}nformed \emph{P}artition \emph{P}enalty Deep Operator Network (PIP$^{2}$ Net) introduces a simplified and more principled partition penalty that improved the coordinated trunk outputs that leads to more expressiveness without sacrificing the flexibility of DeepONet. We evaluate PIP$^{2}$ Net on three nonlinear PDEs: the viscous Burgers equation, the Allen--Cahn equation, and a diffusion--reaction system. The results show that it consistently outperforms DeepONet, PI-DeepONet, and POU-DeepONet in prediction accuracy and robustness.

cs.LG↗

iPINNER: An Iterative Physics-Informed Neural Network with Ensemble Kalman Filter

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving forward and inverse problems involving partial differential equations (PDEs) by incorporating physical laws into the training process. However, the performance of PINNs is often hindered in real-world scenarios involving noisy observational data and missing physics, particularly in inverse problems. In this work, we propose an iterative multi-objective PINN ensemble Kalman filter (iPINNER) framework that improves the robustness and accuracy of PINNs in both forward and inverse problems by using the \textit{ensemble Kalman filter} and the \textit{non-dominated sorting genetic algorithm} III (NSGA-III). Specifically, NSGA-III is used as a multi-objective optimizer that can generate various ensemble members of PINNs along the optimal Pareto front, while accounting the model uncertainty in the solution space. These ensemble members are then utilized within the EnKF to assimilate noisy observational data. The EnKF's analysis is subsequently used to refine the data loss component for retraining the PINNs, thereby iteratively updating their parameters. The iterative procedure generates improved solutions to the PDEs. The proposed method is tested on two benchmark problems: the one-dimensional viscous Burgers equation and the time-fractional mixed diffusion-wave equation (TFMDWE). The numerical results show it outperforms standard PINNs in handling noisy data and missing physics.

cs.LG↗

PAS-Net: Physics-informed Adaptive Scale Deep Operator Network

Nonlinear physical phenomena often show complex multiscale interactions; motivated by the principles of multiscale modeling in scientific computing, we propose PAS-Net, a physics-informed Adaptive-Scale Deep Operator Network for learning solution operators of nonlinear and singularly perturbed evolution PDEs with small parameters and localized features. Specifically, PAS-Net augments the trunk input in the physics informed Deep Operator Network (PI-DeepONet) with a prescribed (or learnable) locally rescaled coordinate transformation centered at reference points. This addition introduces a multiscale feature embedding that acts as an architecture-independent preconditioner which improves the representation of localized, stiff, and multiscale dynamics. From an optimization perspective, the adaptive-scale embedding in PAS-Net modifies the geometry of the Neural Tangent Kernel (NTK) associated with the neural network by increasing its smallest eigenvalue, which in turn improves spectral conditioning and accelerates gradient-based convergence. We further show that this adaptive-scale mechanism explicitly accelerates neural network training in approximating functions with steep transitions and strong asymptotic behavior, and we provide a rigorous proof of this function-approximation result within the finite-dimensional NTK matrix framework. We test the proposed PAS-Net on three different problems: (i) the one-dimensional viscous Burgers equation, (ii) a nonlinear diffusion-reaction system with sharp spatial gradients, and (iii) a two-dimensional eikonal equation. The numerical results show that PAS-Net consistently achieves higher accuracy and faster convergence than the standard DeepONet and PI-DeepONet models under a similar training cost.

physics.comp-ph↗

Energy-Dissipative Evolutionary Kolmogorov-Arnold Networks for Complex PDE Systems

We introduce evolutionary Kolmogorov-Arnold Networks (EvoKAN), a novel framework for solving complex partial differential equations (PDEs). EvoKAN builds on Kolmogorov-Arnold Networks (KANs), where activation functions are spline based and trainable on each edge, offering localized flexibility across multiple scales. Rather than retraining the network repeatedly, EvoKAN encodes only the PDE's initial state during an initial learning phase. The network parameters then evolve numerically, governed by the same PDE, without any additional optimization. By treating these parameters as continuous functions in the relevant coordinates and updating them through time steps, EvoKAN can predict system trajectories over arbitrarily long horizons, a notable challenge for many conventional neural-network based methods. In addition, EvoKAN integrates the scalar auxiliary variable (SAV) method to guarantee unconditional energy stability and computational efficiency. At individual time step, SAV only needs to solve decoupled linear systems with constant coefficients, the implementation is significantly simplified. We test the proposed framework in several complex PDEs, including one dimensional and two dimensional Allen-Cahn equations and two dimensional Navier-Stokes equations. Numerical results show that EvoKAN solutions closely match analytical references and established numerical benchmarks, effectively capturing both phase-field phenomena (Allen-Cahn) and turbulent flows (Navier-Stokes).

math.NA↗

Simulation and Data Assimilation in an Idealized Coupled Atmosphere-Ocean-Sea Ice Floe Model with Cloud Effects

Sea ice plays a crucial role in the climate system, particularly in the Marginal Ice Zone (MIZ), a transitional area consisting of fragmented ice between the open ocean and consolidated pack ice. As the MIZ expands, understanding its dynamics becomes essential for predicting climate change impacts. However, the role of clouds in these processes has been largely overlooked. This paper addresses that gap by developing an idealized coupled atmosphere-ocean-ice model incorporating cloud and precipitation effects, tackling both forward (simulation) and inverse (data assimilation) problems. Sea ice dynamics are modeled using the discrete element method, which simulates floes driven by atmospheric and oceanic forces. The ocean is represented by a two-layer quasi-geostrophic (QG) model, capturing mesoscale eddies and ice-ocean drag. The atmosphere is modeled using a two-layer saturated precipitating QG system, accounting for variable evaporation over sea surfaces and ice. Cloud cover affects radiation, influencing ice melting. The idealized coupled modeling framework allows us to study the interactions between atmosphere, ocean, and sea ice floes. Specifically, it focuses on how clouds and precipitation affect energy balance, melting, and freezing processes. It also serves as a testbed for data assimilation, which allows the recovery of unobserved floe trajectories and ocean fields in cloud-induced uncertainties. Numerical results show that appropriate reduced-order models help improve data assimilation efficiency with partial observations, allowing the skillful inference of missing floe trajectories and lower atmospheric winds. These results imply the potential of integrating idealized models with data assimilation to improve our understanding of Arctic dynamics and predictions.

physics.geo-ph↗