Topology-Preserving Neural Operator Learning via Hodge Decomposition

• URL: http://arxiv.org/abs/2605.13834v1
• Date: Wed, 13 May 2026 17:56:23 GMT
• Title: Topology-Preserving Neural Operator Learning via Hodge Decomposition
• Abstract summary: We study solution operators of physical field equations on geometric meshes from a function-space perspective.<n>Building on Hodge theory and operator splitting, we derive a principled operator-level decomposition.<n>Our method achieves superior accuracy and efficiency on geometric graphs with enhanced fidelity to physical invariants.
• Score: 4.3337853955861805
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we study solution operators of physical field equations on geometric meshes from a function-space perspective. We reveal that Hodge orthogonality fundamentally resolves spectral interference by isolating unlearnable topological degrees of freedom from learnable geometric dynamics, enabling an additive approximation confined to structure-preserving subspaces. Building on Hodge theory and operator splitting, we derive a principled operator-level decomposition. The result is a Hybrid Eulerian-Lagrangian architecture with an algebraic-level inductive bias we call Hodge Spectral Duality (HSD). In our framework, we use discrete differential forms to capture topology-dominated components and an orthogonal auxiliary ambient space to represent complex local dynamics. Our method achieves superior accuracy and efficiency on geometric graphs with enhanced fidelity to physical invariants. Our code is available at https://github.com/ContinuumCoder/Hodge-Spectral-Duality

Related papers

• Hodge Spectral Surrogates for Topology-Constrained Optimization [0.0]
  We propose a differentiable framework for optimization based on Hodge-spectral relaxations of homological constraints and low-pass spectral filters.<n>From soft graphs and soft clique complexes, we construct Hodge-Laplacian-type spectral relaxations that unify graph clique complexes and Vietoris--Ripss of point clouds.
  arXiv  Detail & Related papers  (2026-06-23T21:38:32Z)
• Constructing VAE Latent Spaces with Prescribed Topology [5.207307163958805]
  Variational autoencoders learn low-dimensional latent representations of high-dimensional data.<n>Topology-aware models outperform the Gaussian baseline at all practically relevant regularization strengths.
  arXiv  Detail & Related papers  (2026-06-05T08:59:55Z)
• Learning Orthonormal Bases for Function Spaces [10.818158219098562]
  We use neural networks to define finite-rank generators of ordinary differential equations (ODEs) governed by skew-adjoint integral operators.<n>We prove a universality result: even with a rank-2 generator, the integrated solutions of the ODE are dense in the group under the appropriate operator topology.
  arXiv  Detail & Related papers  (2026-05-19T15:12:05Z)
• Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
  We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
  arXiv  Detail & Related papers  (2026-05-15T10:20:05Z)
• Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves [68.683840670745]
  We introduce a novel convolutional learning framework for possibly infinite-dimensional signals supported on a manifold.<n>We make HilbNets and, more generally, the convolution operation, implementable via a two-stage sampling procedure.<n>Our results broaden the scope of geometric learning as a whole by lifting classical Laplacian-based frameworks to settings where the signal at each point lives in its own Hilbert space.
  arXiv  Detail & Related papers  (2026-05-07T15:08:58Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Topological resolution of conical intersection seams and the coupled cluster bifurcation via mixed Hodge modules [0.0]
  Conical Intersections (CIs) is the central challenge of non-adiabatic quantum chemistry.<n>Standard Coupled Cluster (CC) theory suffers from root bifurcations near Ground State CIs.<n>We present textbfMorpheus, an open-source computational package that resolves these singularities.
  arXiv  Detail & Related papers  (2025-12-23T14:58:23Z)
• Geometric Laplace Neural Operator [12.869633759181417]
  We propose a generalized operator learning framework based on a pole-residue decomposition enriched with exponential basis functions.<n>We introduce the Geometric Laplace Neural Operator (GLNO), which embeds the Laplace spectral representation into the eigen-basis of the Laplace-Beltrami operator.<n>We further design a grid-invariant network architecture (GLNONet) that realizes GLNO in practice.
  arXiv  Detail & Related papers  (2025-12-18T11:07:41Z)
• Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study [1.1745324895296467]
  We develop a unified theoretical framework for neural architectures with internal representations evolving as stationary states of dissipative Schr"odinger-type dynamics on learned latent graphs.<n>We prove existence, uniqueness, and smooth dependence of equilibria, and show that the dynamics are equivalent under the Bloch map to norm-preserving Landau--Lifshitz flows.<n>The resulting model class provides a compact, geometrically interpretable, and analytically tractable foundation for learning latent graph geometry via fixed-point Schr"odinger-type activations.
  arXiv  Detail & Related papers  (2025-07-27T00:35:15Z)
• Hybrid Functional Maps for Crease-Aware Non-Isometric Shape Matching [42.0728900164228]
  We propose a novel approach of combining the non-orthogonal extrinsic basis of eigenfunctions of the elastic thin-shell hessian with the intrinsic ones of the Laplace-Beltrami operator (LBO) eigenmodes. We show extensive evaluations across various supervised and unsupervised settings and demonstrate significant improvements.
  arXiv  Detail & Related papers  (2023-12-06T18:41:01Z)
• Physics-informed Spectral Learning: the Discrete Helmholtz--Hodge Decomposition [0.0]
  We further develop the Physics-informed Spectral Learning (PiSL) by Espath et al. Within this physics-informed statistical learning framework, we adaptively build a sparse set of Fourier basis functions with corresponding coefficients. Our PiSL computational framework enjoys spectral (exponential) convergence. We assess the capabilities of our method in various numerical examples including the Storm of the Century' with satellite data from 1993.
  arXiv  Detail & Related papers  (2023-02-21T23:33:29Z)
• Solving High-Dimensional PDEs with Latent Spectral Models [74.1011309005488]
  We present Latent Spectral Models (LSM) toward an efficient and precise solver for high-dimensional PDEs. Inspired by classical spectral methods in numerical analysis, we design a neural spectral block to solve PDEs in the latent space. LSM achieves consistent state-of-the-art and yields a relative gain of 11.5% averaged on seven benchmarks.
  arXiv  Detail & Related papers  (2023-01-30T04:58:40Z)
• Convex Analysis of the Mean Field Langevin Dynamics [49.66486092259375]
  convergence rate analysis of the mean field Langevin dynamics is presented. $p_q$ associated with the dynamics allows us to develop a convergence theory parallel to classical results in convex optimization.
  arXiv  Detail & Related papers  (2022-01-25T17:13:56Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.