- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes a framework for learning finite-dimensional Koopman operators for mesh-based physical systems. The core contribution is a theoretical reduction of the hypothesis class of linear latent generators by enforcing four physical principles: (L) locality, (P) local-law consistency under mesh isomorphisms, (O) orientation covariance, and (E) storage non-increase. The authors instantiate this theory as Koopman-MeshFT, adding a "growth-controlled latent envelope" to suppress the amplification of closure errors over time. The approach is empirically evaluated on four public PDEBench datasets (Advection, Burgers, CNS1D, CNS2D), where it outperforms evaluated Koopman-based baselines (KNO, cKAE) in rollout accuracy and physical fidelity metrics.
Critical strengths
The approach is shown to empirically outperform models like FNO and KNO.
The experimental section is rigorous.
Critical weaknesses
This is a very poorly written paper, with heavy use of jargons, many of which, I am unable to find in reference literature. Terms are introduced before defining them. Key terms have no definitions. The abstract is very hard to make sense of, due to too many jargons. The paper relies on specific terminology that often lacks formal definitions or external grounding.
The authors repeatedly discuss "exact finite-dimensional closure" and "finite-dimensional Koopman closure" without providing a formal mathematical definition or a direct citation establishing the threshold for this closure within their specific mesh-based framework.
The concept of a "growth-controlled subfamily" is used to regulate the amplification of closure errors, yet it is presented without a direct citation to prior literature utilizing this exact control mechanism in Koopman latent spaces.
the paper utilizes a "substepped Taylor action". The authors use this phrase as a given without citing a standard numerical methods text for this specific nomenclature.
The optimization procedure includes a "manifold-cycle residual" alongside data-closure and rollout losses. While structurally clear in the text, the specific term lacks references linking it to similar cycle-consistency mechanisms in broader autoencoder literature.
Questions for authors
"orientation-graded relation operators with uniquely determined coefficients" -- please clarify these phrases. This is a jargon-heavy sentence and I could not find any reference to "orientation-graded relation"
"not every finite-dimensional linear dynamics is physically equally plausible" - Either provide citations or provide examples "Instantaneous interactions are typically local" -- what is an instantaneous interaction?
"the physical law should not depend on arbitrary relabeling of mesh entities, oriented quantities should transform consistently with orientation conventions, and distinguished physical storage quantities may be conserved or dissipated." -- what physical law? What's relabeling? What's an oriented quantity? What's a distinguished physical storage?
In Section 3.1, What is F(x)? Apart from mentioning it's Locally lipschitz, there's no description of what it actually maps.