---
title: "Meshless Latent Dynamics Models for Model Order Reduction of time-dependent Partial Differential Equations"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2610.41043v1"
permalink: "https://feed.astralor.com/items/itm_eb5b6cd905c78f3cfa34de09"
published: "2026-10-29T22:32:37.000Z"
score: 58
channel: "tech"
tags: ["推理效率","RAG","Meshless Latent Dynamics","Models","Model Order Reduction","Partial Differential Equations","Latent","MOR"]
---

# Meshless Latent Dynamics Models for Model Order Reduction of time-dependent Partial Differential Equations

## At a glance

Latent dynamics learning has emerged as a prominent approach for Model Order Reduction (MOR) of time-dependent, parameterized Partial Differential Equations (PDEs). Traditional autoencoder-based approaches are intrinsic…

## Key points

- Latent dynamics learning has emerged as a prominent approach for Model Order Reduction (MOR) of time-dependent, parameterized Partial Differential Equations (PDEs).
- Traditional autoencoder-based approaches are intrinsically tied to fixed spatial discretizations during both training and inference, motivating the development of meshless methodologies.
- In this context, conditioning provides a natural mechanism for representing temporal evolution through spatially continuous functions, enabling mesh-agnostic Latent Dynamics Models (LDMs).

## Full text

Latent dynamics learning has emerged as a prominent approach for Model Order Reduction (MOR) of time-dependent, parameterized Partial Differential Equations (PDEs). Traditional autoencoder-based approaches are intrinsically tied to fixed spatial discretizations during both training and inference, motivating the development of meshless methodologies. In this context, conditioning provides a natural mechanism for representing temporal evolution through spatially continuous functions, enabling mesh-agnostic Latent Dynamics Models (LDMs). In this work, we introduce a unified mathematical framework for mesh-agnostic LDMs based on conditioning in Neural Fields (NeFs). Leveraging a taxonomy of conditioning mechanisms (weak, strong, and pure), we formulate meshless LDMs as NeFs conditioned on a latent state. We establish a Universal Approximation Theorem (UAT) for this class of models and analyze their stability by deriving Lipschitz bounds for different conditioning mechanisms. Our analysis reveals an expressivity--stability trade-off, providing insight into why more expressive conditioning, despite its higher representational capacity, can potentially degrade performance during temporal extrapolation. Finally, we provide a comprehensive comparison of meshless and mesh-based architectures in the continuous limit of the spatial discretization, showing that meshless models guarantee grid-independent Lipschitz bounds, unlike mesh-based counterparts. Our experiments across Burgers' equation, Navier--Stokes flow past a cylinder, and linear advection show that meshless LDMs can achieve predictive accuracy comparable to or better than their mesh-based counterparts while using only 2% of the trainable parameters and exhibiting nearly constant error across spatial discretizations.

---

Verify against the original before citing; curated by Astral Feed: https://feed.astralor.com/items/itm_eb5b6cd905c78f3cfa34de09