arXiv Machine Learning By Zeyuan Song, Zheyu Jiang

Adaptive Mamba Neural Operators

Read the original on arXiv Machine Learning →

arXiv:2607. 18043v1 Announce Type: new Abstract: Accurately solving partial differential equations (PDEs) on arbitrary geometries and a variety of meshes is an important task in science and engineering applications.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jul 20

Adaptive Mamba Neural Operators

Accurately solving partial differential equations (PDEs) on arbitrary geometries and a variety of meshes is an important task in science and engineering applications. In this paper, we propose Adaptive Mamba Neural Operators (AMO), which integrates reproducing kernels for state-space models (SSMs) rather than the kernel integral formulation of SSMs.

arXiv Machine Learning
3d ago

Learning Spectrally Optimised Mesh-Free Discretisations

The paper introduces Spectrally Optimised Neural Discretisations (SpeND), a mesh‑free framework that learns discretisation weights from local stencil geometry on unstructured point clouds. By embedding discrete moment conditions into the network architecture, SpeND guarantees polynomial consistency and allows the weights to be optimised for spectral accuracy over a chosen wavenumber band, using an unsupervised Fourier‑mode loss. The resulting operators are PDE‑agnostic, perform well on Poisson, Burgers, and Navier–Stokes equations, and can reduce wall‑clock time by 3–20× compared to existing mesh‑free methods at the same accuracy.

By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
arXiv Machine Learning
Aug 28

Enforcing Dirichlet Boundary Conditions in Operator Learning

The paper introduces a neural operator architecture that inherently satisfies homogeneous Dirichlet boundary conditions by constraining each layer’s output to lie within the span of selected Dirichlet eigenfunctions of the Laplacian. This design works for any bounded domain with a Lipschitz boundary and any discretization, avoiding the restrictions of previous methods. The authors prove universal approximation for their architecture and demonstrate its effectiveness on Darcy flow and Helmholtz equation problems.

By Andrew M. Stuart, Margaret Trautner