Skip to content

Learning PDE Dynamics between Submanifolds Using Green's Observation Operators

Oct 2026 · 0 citations · 77 references
Computer Science

TL;DR

Green's Observation Operator (GObO) is introduced, which maps the ambient medium once to the Green's kernel of a linear PDE restricted to the source and observation submanifolds, and yields an exact finite streaming state with horizon-independent memory.

Abstract

Many physical systems are driven and observed only on lower-dimensional submanifolds of a larger spatial domain, while their dynamics are governed by the ambient medium occupying that domain. Examples include laser-heated parts imaged by an infrared camera, and ground-level emissions measured on a sensor plane. Full-domain solvers, however, compute the entire volume for every new source although only the observation submanifold is needed, and black-box surrogates do not exploit that the ambient medium remains fixed. We introduce the \emph{Green's Observation Operator (GObO)}, which maps the ambient medium once to the Green's kernel of a linear PDE restricted to the source and observation submanifolds. New sources then cost one lower-dimensional integral and no network evaluation. Exponential rates in the kernel yield an exact finite streaming state with horizon-independent memory; we prove its stability and an approximation rate for the restricted heat kernel. On three-dimensional heat conduction and advection--diffusion with collocated and distinct source and observation geometries, GObO trained on static sources predicts responses to moving sources zero-shot with 4--8$\times$ lower error than black-box surrogates, at 1.4\,ms per query after a single conditioning pass. The same kernel transfers across resolutions and admits corrections for mild nonlinearities, including radiative losses and temperature-dependent conductivity, without retraining, at the cost of lower in-distribution accuracy.

View source

Similar papers

#machine learning Preprint Oct 2026

Energy-Guided Learning for Heat Equation with Noisy Source: Optimal Estimation and Generalization Bounds

Data and the governing partial differential equations (PDEs) of continuous-time dynamical systems provide rich structure for statistical learning. A central challenge is how to integrate data with PDE constraints in a principled way to improve generalization. In this paper, we characterize the statistical estimation an...

Zi-Xian Zhou, Xiao-Hui Chen, Shang-Hua Teng · 0 citations
#machine learning Preprint Sep 2026

Learning in the Transverse Subspace: A Minimal Representation for Divergence-Free Operator Learning

This work introduces a minimal representation that encodes a real divergence-free vector field on a \(D\)-dimensional domain as a real \((D-1)\)-component field on the same domain, and uses a Householder orthogonal transformation to construct the reduced coordinates directly.

Yi-Fei Sun · 0 citations
#artificial intelligence Preprint Sep 2026

Dynamic Kuramoto-Hodge Operators for PDEs on Complex Geometries and Topologies

This work introduces the Dynamic Kuramoto--Hodge Operator (DKHO), which combines topology-constrained interactions with learned coordination and suggests that coupling topological structure with adaptive dynamics provides an effective inductive bias for accurate and parameter-efficient PDE operator learning on complex...

Xiang Li, Yue Song · 0 citations
Preprint Sep 2026

Learning Operators of Geometry with an Interface Autoencoder

Geometry-dependent PDEs define operators whose inputs and outputs may each consist of an oriented interface and a function on that interface, whereas most existing neural operators are formulated on fixed domains. In this paper, we first establish an approximation theorem for continuous operators between general state...

Ai-Qing Zhu, Peng-Zhan Jin · 0 citations
#machine learning Preprint Sep 2026

Bi-HYCO: Bi-Objective Cooperative Learning for PDE Parameter Identification under Fragmented Observations

This work proposes Bi-Objective HYCO (Bi-HYCO), a cooperative framework that retains both representations and their local observational objectives while coupling their predicted states at unlabeled interaction points, and shows that removing state interaction while retaining aggregation deteriorates parameter recovery...

Umberto Biccari, Jun Chen, Roberto Morales et al. · 0 citations
Preprint Sep 2026

TASE-Stabilized Time-Evolving Natural Gradient Methods for Diffusion-Dominated PDEs

The Time-Evolving Natural Gradient (TENG) method evolves neural approximations of time-dependent partial differential equations by projecting time-discrete target states onto the neural-network manifold through local natural-gradient iterations. For stiff diffusion-dominated problems, however, explicit Runge--Kutta met...

Zi-Hao Shi, Dong-Ling Wang · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.