Scale-Aware Learning of Chaotic Dynamics on Unstructured Meshes via Binned Spectral Losses

• URL: http://arxiv.org/abs/2607.19387v1
• Date: Thu, 02 Jul 2026 02:12:13 GMT
• Title: Scale-Aware Learning of Chaotic Dynamics on Unstructured Meshes via Binned Spectral Losses
• Abstract summary: We extend the binned spectral power loss for application to unstructured-mesh surrogate modeling of nonlinear dynamical systems.<n>We provide Chebyshev and multilevel approximations for improving long-horizon rollout fidelity.
• Score: 2.225353152447347
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Surrogate modeling for high-dimensional nonlinear dynamical systems that exhibit chaos requires mechanisms that preserve not only pointwise accuracy but also the scale-dependent structure of physical fields. Bandwise spectral power losses, such as the binned spectral loss function, provide such supervision on structured grids, where Fourier modes define a standard frequency decomposition. On irregular meshes, however, no canonical Fourier basis exists, and spectral representations must be constructed from graph operators induced by mesh connectivity and geometry. In this study, we extend the binned spectral power loss for application to unstructured-mesh surrogate modeling of nonlinear dynamical systems. This is obtained by replacing Fourier bands with graph-Laplacian frequency bands, and we provide scalable Chebyshev and multilevel approximations for improving long-horizon rollout fidelity. In its full-spectrum form, our approach uses graph Laplacian eigenspaces to provide a graph analogue of Fourier band-power matching, but incurs the high cost of spectral decomposition. As a scalable approximation, we replace exact band projectors with sparse Chebyshev polynomial graph filters, avoiding explicit eigendecomposition. When utilizing multilevel graph architectures, we introduce Graph Laplacian Energy Alignment for Meshes (GLEAM), which applies retained-subspace scale-aware supervision across graph hierarchies so that coarse and fine representations are regularized during autoregressive rollout. Our results show that the proposed spectral losses improve long-horizon rollout fidelity and preserve statistical invariants for the forecasting of turbulent flows on unstructured meshes, compared to deterministic baselines.

Related papers

• LiftGCN: Efficient Energy-Preserving Graph Learning via Joukowski Spectral Lifting for Finite Element Stress Prediction [11.989415790249309]
  We propose LiftGCN, an efficient spectrally stable graph network based on Joukowski spectral lifting.<n>We show that the linear Joukowski backbone has unit-modulus characteristic roots and admits an energy-truncation.<n>Experiments on finite element stress prediction demonstrate that LiftGCN achieves competitive overall accuracy.
  arXiv  Detail & Related papers  (2026-09-14T03:31:26Z)
• Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs [1.6822770693792826]
  Hypergraph Adaptive waveLet Operator (HALO) learns in its spectral wavelet domain.<n>HALO avoids explicit hypergraph-Laplacian eigendecomposition through Chebyshev wavelet filters.<n>HALO achieves best or near-best accuracy among frequency-, transformer-, DeepONet-, state-space-, and graph-based baselines.
  arXiv  Detail & Related papers  (2026-08-28T03:43:19Z)
• Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion [82.7007012514703]
  We show that under a denoising objective, linear attention is suboptimal and can only learn an average spectral denoising filter over the training distribution.<n>We introduce Spectral Attention, which directly utilizes the input graph spectrum and provably outperforms linear attention by a margin governed by the spectral diversity of the distribution.<n>For block models, GCA provably matches the idealized Spectral Attention mechanism.
  arXiv  Detail & Related papers  (2026-07-07T17:52:17Z)
• Generalization Bounds for Spectral GNNs via Fourier Domain Analysis [13.038956023769996]
  Spectral graph networks learn graph filters, but their behavior with increasing depth and neural order is not well understood.<n>We analyze these models in the graph domain, where each layer becomes an element-wise frequency update.
  arXiv  Detail & Related papers  (2026-04-01T13:58:50Z)
• Advection-Diffusion on Graphs: A Bakry-Emery Laplacian for Spectral Graph Neural Networks [2.6124895681424323]
  Graph Neural Networks (GNNs) often struggle to propagate information across long distances due to oversmoothing and oversquashing.<n>We introduce a Bakry-Emery graph Laplacian that integrates diffusion and advection through a learnable node-wise potential.<n>We develop mu-ChebNet, a spectral architecture that jointly learns the potential and Chebyshev filters.
  arXiv  Detail & Related papers  (2026-02-20T11:01:12Z)
• Data-Driven Graph Filters via Adaptive Spectral Shaping [10.449640808601199]
  We introduce Adaptive Spectral Shaping, a data-driven framework for graph filtering.<n>The framework provides compact spectral modules that plug into graph signal processing pipelines and graph neural networks.
  arXiv  Detail & Related papers  (2026-02-03T16:20:49Z)
• SIGMA: Scalable Spectral Insights for LLM Collapse [51.863164847253366]
  We introduce SIGMA (Spectral Inequalities for Gram Matrix Analysis), a unified framework for model collapse.<n>By utilizing benchmarks that deriving and deterministic bounds on the matrix's spectrum, SIGMA provides a mathematically grounded metric to track the contraction of the representation space.<n>We demonstrate that SIGMA effectively captures the transition towards states, offering both theoretical insights into the mechanics of collapse.
  arXiv  Detail & Related papers  (2026-01-06T19:47:11Z)
• A Spectral Interpretation of Redundancy in a Graph Reservoir [51.40366905583043]
  This work revisits the definition of the reservoir in the Multiresolution Reservoir Graph Neural Network (MRGNN)<n>It proposes a variant based on a Fairing algorithm originally introduced in the field of surface design in computer graphics.<n>The core contribution of the paper lies in the theoretical analysis of the algorithm from a random walks perspective.
  arXiv  Detail & Related papers  (2025-07-17T10:02:57Z)
• Graph Fourier Transformer with Structure-Frequency Information [2.7852431537059426]
  This paper proposes Grafourierformer, which innovatively combines GT with inductive bias containing Frequency-Structure information.<n>Experiments on various benchmarks show Grafourierformer consistently outperforms GNN and GT-based models in graph classification and node classification tasks.
  arXiv  Detail & Related papers  (2025-04-28T12:38:02Z)
• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts [57.19908334882441]
  Dynamic graph neural networks (DyGNNs) currently struggle with handling distribution shifts that are inherent in dynamic graphs. We propose to study distribution shifts on dynamic graphs in the spectral domain for the first time.
  arXiv  Detail & Related papers  (2024-03-08T04:07:23Z)
• ASWT-SGNN: Adaptive Spectral Wavelet Transform-based Self-Supervised Graph Neural Network [20.924559944655392]
  This paper proposes an Adaptive Spectral Wavelet Transform-based Self-Supervised Graph Neural Network (ASWT-SGNN) ASWT-SGNN accurately approximates the filter function in high-density spectral regions, avoiding costly eigen-decomposition. It achieves comparable performance to state-of-the-art models in node classification tasks.
  arXiv  Detail & Related papers  (2023-12-10T03:07:42Z)
• HoloNets: Spectral Convolutions do extend to Directed Graphs [59.851175771106625]
  Conventional wisdom dictates that spectral convolutional networks may only be deployed on undirected graphs. Here we show this traditional reliance on the graph Fourier transform to be superfluous. We provide a frequency-response interpretation of newly developed filters, investigate the influence of the basis used to express filters and discuss the interplay with characteristic operators on which networks are based.
  arXiv  Detail & Related papers  (2023-10-03T17:42:09Z)

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.