Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs

• URL: http://arxiv.org/abs/2608.27883v1
• Date: Fri, 28 Aug 2026 03:43:19 GMT
• Title: Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs
• Abstract summary: 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.
• Score: 1.6822770693792826
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Physical systems are often modeled by solution operators that map input fields, parameters, geometries, or past states to steady or future physical states. Learning these maps is difficult, especially for time-dependent systems that must assimilate history and remain stable under autoregressive rollout. Many neural operators work best on regular, structured grids, while realistic simulations often require unstructured meshes or point clouds to resolve complex geometries; in such settings, grid-centric representations can lose accuracy. Graph neural operators handle these domains through message passing or spectral graph filtering, but pairwise edges do not directly capture group-wise couplings among mesh cells, local neighborhoods, or conservation volumes. We introduce the Hypergraph Adaptive waveLet Operator (HALO), which lifts the domain to a hypergraph and learns in its spectral wavelet domain. HALO avoids explicit hypergraph-Laplacian eigendecomposition through Chebyshev polynomial wavelet filters, giving localized spectral kernels at linear sparse-matrix cost. Its trainable dyadic wavelet scales are regularized toward tight-frame coverage, allowing the frequency response to adapt to each PDE while encouraging stable multi-scale spectral coverage. Across 2D and 3D benchmarks on structured and unstructured discretizations, HALO achieves best or near-best accuracy among frequency-, transformer-, DeepONet-, state-space-, and graph-based baselines and sustains stable multi-step rollouts. The same model scales to industrial aerodynamic geometries: on meshes of a few hundred thousand points it is on par with, or better than, the strongest fixed-discretization transformers, while remaining resolution-equivariant.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Scale-Aware Learning of Chaotic Dynamics on Unstructured Meshes via Binned Spectral Losses [2.225353152447347]
  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.
  arXiv  Detail & Related papers  (2026-07-02T02:12:13Z)
• Mesh Based Simulations with Spatial and Temporal awareness [2.867517731896504]
  We propose a unified framework to bridge the gap between geometric deep learning and rigorous numerical analysis.<n>We introduce three key innovations: (1) Multi Node Prediction, a stencil-level objective that predicts field values for a node's full local topology, enforcing spatial derivative consistency; (2) Temporal Correction, replacing unstable explicit schemes with a predictor-corrector via temporal Cross-Attention; and (3) Geometric Inductive Biases, leveraging 3D Rotary Positional Embeddings (RoPE) to robustly capture rotational symmetries in unstructured meshes.
  arXiv  Detail & Related papers  (2026-05-02T17:09:31Z)
• Forecasting as Rendering: A 2D Gaussian Splatting Framework for Time Series Forecasting [79.37674445572462]
  Time series forecasting (TSF) remains a challenging problem due to the intricate entanglement of intraperiod-fluctuations and interperiod-trends.<n>Treating reshaped tensors as static images results in a topological mismatch.<n> relying on uniform fixed-size representations allocates modeling capacity inefficiently.<n>TimeGS is a novel framework that fundamentally shifts the forecasting paradigm from regression to 2D generative rendering.
  arXiv  Detail & Related papers  (2026-02-10T14:13:36Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Spectral Embedding via Chebyshev Bases for Robust DeepONet Approximation [0.6752538702870791]
  SpectralEmbedded DeepONet (SEDNet) is a new variant in which the trunk is driven by a fixed Chebyshev spectral dictionary rather than coordinate inputs.<n>SEDNet consistently achieves the lowest relative L2 errors among DeepONet, FEDONet, and SEDONet with average improvements of about 30-40% over the baseline DeepONet.
  arXiv  Detail & Related papers  (2025-12-09T22:26:29Z)
• Long-Range Graph Wavelet Networks [48.591533900586626]
  Long-range interactions are a central challenge in graph machine learning.<n>Existing wavelet-based graph neural networks rely on finite-order approximations.<n>We propose Long-Range Graphlet Networks (LR-GWN), which decompose wavelet into complementary local and global components.
  arXiv  Detail & Related papers  (2025-09-08T14:35:30Z)
• 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)
• 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)
• Implicit Neural Representation For Accurate CFD Flow Field Prediction [0.0]
  We present a deep learning framework for 3D flow field prediction applied to blades of aircraft engine turbines and compressors. We view any 3D field as a function from coordinates modeled by a neural network we call the backbone-net. It can accurately render important flow characteristics such as boundary layers, wakes and shock waves.
  arXiv  Detail & Related papers  (2024-08-12T20:41:07Z)
• A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition [41.41593198072709]
  We present a novel wavelet-based graph convolution network, namely WaveGC, which integrates multi-resolution spectral bases and a matrix-valued filter kernel.<n>Theoretically, we establish that WaveGC can effectively capture and decouple short-range and long-range information, providing superior filtering flexibility.<n>Our numerical experiments showcase the consistent improvements in both short-range and long-range tasks.
  arXiv  Detail & Related papers  (2024-05-22T16:32:27Z)
• Spatio-Temporal Graph Scattering Transform [54.52797775999124]
  Graph neural networks may be impractical in some real-world scenarios due to a lack of sufficient high-quality training data. We put forth a novel mathematically designed framework to analyze-temporal data.
  arXiv  Detail & Related papers  (2020-12-06T19:49:55Z)

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.