atlas

Research map / Probabilistic and scientific modeling / Differential equations and PDEs

Symmetric Basis Convolutions for Learning Lagrangian Fluid Mechanics

ICLR 2024 · Probabilistic and scientific modeling › Differential equations and PDEs · approach: Physics-informed operator learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes SFBC, a continuous convolution using separable symmetric Fourier basis functions (no window function) for learning Lagrangian fluid simulations, evaluated on 1D compressible, 2D weakly compressible, and 2D incompressible SPH test cases.

Problem

Learning Lagrangian (particle-based) fluid simulations with continuous convolutions requires inductive biases such as smoothness, symmetry, and window functions, and existing basis choices (linear interpolation, splines, DMCF antisymmetric bases) lack symmetry or smoothness guarantees.

Approach

A general formulation of continuous convolutions as separable basis-function expansions that subsumes existing methods; using a smooth Fourier series with both even and odd terms as the basis enables symmetric, smooth filters so that window functions are no longer needed.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a symmetric, smooth Fourier basis instead of LinCConv1D toy kernel interpolation · 1D toy kernel interpolationL2 error: 5217Helped
Use an odd-symmetry Fourier series for the kernel gradient1D toy kernel gradient · 1D toy kernel gradientL2 error: a factor of 7.6 relative to DMCF and 853 relative to LinCConvHelped
Use SFBC instead of LinCConv3D toy symmetric task · 3D toy symmetric taskL2 error: by a factor of two on averageHelped
Use an antisymmetric odd Fourier basis instead of SFBC3D toy symmetric task · 3D toy symmetric taskL2 error: three times worse than SFBCHurt
Increase features per layer from 4 to 32 (ablation)Compressible 1D SPH network with 3 message-passing steps · Compressible 1D SPHtest error: by an order of magnitudeHelped
Increase message-passing steps from 3 to 6 (ablation)Compressible 1D SPH network · Compressible 1D SPHnetwork performance: ±10%No clear effect
Use SFBC instead of LinCConvWeakly-compressible 2D SPH · Weakly-compressible 2D SPH, 64-step inferencedivergence error: by a factor of 2.6Helped
Increase random seeds from 4 to 32 (ablation)SFBC · Weakly-compressible 2D SPH, 64-step inferencedivergence error: 1.29 to 1.30No clear effect
Add a Müller window to the Fourier basis (ablation)Fourier basis on weakly-compressible 2D SPH · Weakly-compressible 2D SPHdivergence error: a 2 times increaseHurt
Change the LinCConv window function (ablation)LinCConv · Weakly-compressible 2D SPHdensity error: by 2.1 timesHelped
Use volume-preserving or polar coordinate mapping instead of identity mapping (ablation)SFBC · Weakly-compressible 2D SPHdivergence error: increased by up to 15%Hurt
Replace the first harmonic cosine term with a second harmonic sine term (ablation)Fourier basis without a window · Weakly-compressible 2D SPHdivergence error: by a factor of 1.4Helped

Surprising findings

Limitations

Experimental setup

Datasets: custom SPH simulation datasets (1D compressible, 2D weakly compressible, 2D incompressible)

Benchmarks: toy kernel function and kernel gradient learning 1D compressible SPH 2D weakly compressible SPH 2D incompressible SPH

Metrics: L2 error divergence error density error velocity error power spectral density error point-wise particle distance

Baselines: LinCConv DMCF SplineConv GNS MP-PDE MLSConv PointNet Chebyshev basis

Builds on: LinCConv DMCF SplineConv PointNet MP-PDE

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy