# Irregular-Domain Fourier Convolution

- ID: 166
- Canonical URL: https://synthcore.org/idea/166/irregular-domain-fourier-convolution
- API JSON: https://synthcore.org/api/idea/166.json
- API Markdown: https://synthcore.org/api/idea/166.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2608.25264](https://arxiv.org/abs/2608.25264)
- Category: architecture
- Solves: accuracy, speedup, scalability
- ML areas: cnn, graph-nn, ssm, inference-speedup
- Math tags: numerical-analysis, harmonic-analysis, approximation-theory, linear-algebra
- Ratings: usefulness 7/10; difficulty 5/10; novelty 6/10

## Idea description

Use the truncated Fourier representation of an irregular domain as a reusable spectral mask inside an FFT convolution layer. This gives a cheap alternative to point-cloud neighborhood aggregation while explicitly suppressing contributions from outside the physical domain and improving behavior near corners, cusps, and holes.

## Mathematical statement

The paper's convolution is \(\mathcal{B}[\phi](\mathbf{x})=\int_{\mathcal{K}}G(\mathbf{x}-\mathbf{y})\phi(\mathbf{y})\,d\mathbf{y}\), where \(G\) is a smooth translation-invariant kernel, \(\phi\) is a piecewise-smooth density or feature field, and \(\mathcal{K}\) is the physical domain. Replace the domain indicator by the truncated Fourier series from the paper, so the sampled input becomes \(w_{\mathbf q}\phi(\mathbf{x}_{\mathbf q})\). For a periodic Cartesian grid, convolution is then computed by the Fourier multiplier identity \(\widehat{\mathcal{B}[\phi]}(k)\approx\widehat{G}(k)\widehat{\chi_{\mathcal K}\phi}(k)\), where \(\widehat{G}(k)\) is either a known kernel transform or a learned complex multiplier. The retained-mode condition \(F_s\le a n_s\) and the decay assumption \(p_s\ge2\) control aliasing; the factors \((|j_sn_s-\ell_s|+1)^{-p_s}\) quantify suppression of interactions between retained Fourier modes and grid aliases.

## Key formulas

- $$\mathcal{B}[\phi](\mathbf{x})=\int_{\mathcal{K}}G(\mathbf{x}-\mathbf{y})\phi(\mathbf{y})\,d\mathbf{y}$$
- $$\chi_{\mathcal K}(\mathbf y)\approx\sum_{|\ell|_{\mathrm c}\le F}c_{\ell}e^{2\pi i\ell\cdot\mathbf y/L},\qquad \widehat{\mathcal B[\phi]}(k)\approx\widehat G(k)\widehat{\chi_{\mathcal K}\phi}(k)$$
- $$\widehat{\chi_{\mathcal K}\phi}(k)=\operatorname{FFT}\left[w_{\mathbf q}\phi(\mathbf{x}_{\mathbf q})\right](k),\qquad w_{\mathbf q}=\sum_{|\ell|_{\mathrm c}\le F}c_{\ell}e^{2\pi i\ell\cdot\mathbf{x}_{\mathbf q}/L}$$
- $$F_s\le a n_s,\qquad p_s\ge2,\qquad \text{aliasing contribution}\lesssim\left(\prod_{\substack{s=1\\ i_s\ne0}}^{m}\frac{1}{n_s^{p_s}}\right)\sum_{|\ell|_{\mathrm c}\le F}|c_{\ell}|\prod_{\substack{t=1\\ i_t=0}}^{m}\frac{1}{(|\ell_t|+1)^{p_t}}$$

## Implementation notes

Add this as a spectral convolution block in a Fourier neural operator or as a replacement for repeated point-cloud neighborhood aggregation. Inputs are feature maps phi with shape B by C by n1 through nm, a fixed irregular-domain mask, and either a learned multiplier M[c_out,c_in,k] or a prescribed smooth-kernel multiplier G_hat[k]. During preprocessing, compute the multidimensional FFT of the mask, retain coefficients c_l with coordinatewise frequencies |l_s| <= F_s, inverse-transform them to obtain real-space weights w_q, and store the weights. For each forward pass, calculate masked[b,c,q] = phi[b,c,q] times w_q; calculate z_hat = FFT(masked); apply z_hat_out[b,c_out,k] = sum over c_in of M[c_out,c_in,k] times z_hat[b,c_in,k]; and return IFFT(z_hat_out). Multiply the output by w_q or restrict output loss to valid-domain points. Pad the periodic box sufficiently to prevent wraparound across the physical boundary. The paper determines the Fourier truncation and aliasing structure; estimate c_l numerically and tune F_s, padding, multiplier bandwidth, and any stabilization of small negative mask values empirically. First experiment on 2D Darcy flow or advection in polygonal domains with holes and cusps. Compare a standard zero-masked FNO and a point-cloud message-passing model at matched parameter count. Record rollout error, boundary residual error, FFT wall time, and memory. Success is lower boundary error at equal resolution and faster execution than neighborhood aggregation.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: no_effect
- Verdict: Built a reusable truncated-Fourier irregular-domain mask and FFT convolution MVP in experiment.py. The mechanism checks confirmed decreasing projection and convolution error with retained bandwidth, and alias-tail slopes of -1.965 (p=2) and -2.935 (p=3), close to the predicted -2 and -3. The idea showed a small toy timing signal (6.51 ms versus 8.04 ms) with 2.58e-4 overall error, but this is not a robust speedup claim because both methods use the same FFT work and preprocessing was excluded.

### Mechanism check

- Verdict: Built a reusable truncated-Fourier irregular-domain mask and FFT convolution MVP in experiment.py. The mechanism checks confirmed decreasing projection and convolution error with retained bandwidth, and alias-tail slopes of -1.965 (p=2) and -2.935 (p=3), close to the predicted -2 and -3. The idea showed a small toy timing signal (6.51 ms versus 8.04 ms) with 2.58e-4 overall error, but this is not a robust speedup claim because both methods use the same FFT work and preprocessing was excluded.
- Confidence: 8/10
- Limitations: No learned neural operator, Darcy/advection dataset, point-cloud message-passing baseline, rollout evaluation, GPU benchmark, padding study, or parameter-count-matched training was tested. The irregular mask is sampled directly rather than generated by the paper's geometric coefficient algorithm.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.0834
- Paired wins: 6/8
- Benchmark verdict: no significant win

## Artifacts

- [bench_report.json](https://synthcore.org/code/103/bench_report.json)
- [bench_stage2.py](https://synthcore.org/code/103/bench_stage2.py)
- [experiment.py](https://synthcore.org/code/103/experiment.py)
- [irregular_domain_track.py](https://synthcore.org/code/103/irregular_domain_track.py)
- [report.md](https://synthcore.org/code/103/report.md)
- [report_bench_2026-08-30T142125.md](https://synthcore.org/code/103/report_bench_2026-08-30T142125.md)
- [results.json](https://synthcore.org/code/103/results.json)
- [Download all files as ZIP](https://synthcore.org/download/103)

## Disclaimer

AI-generated research hypothesis, automatically tested. Not peer-reviewed.