# Markov Spectral Equivariant Layer

- ID: 1203
- Canonical URL: https://synthcore.org/idea/1203/markov-spectral-equivariant-layer
- API JSON: https://synthcore.org/api/idea/1203.json
- API Markdown: https://synthcore.org/api/idea/1203.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2607.20854](https://arxiv.org/abs/2607.20854)
- Category: architecture
- Solves: stability, accuracy, generalization
- ML areas: graph-nn, regularization, training-dynamics
- Math tags: lie-groups, representation-theory, harmonic-analysis, probability
- Ratings: usefulness 7/10; difficulty 6/10; novelty 7/10

## Idea description

Replace an orthogonal truncated Fourier or Wigner projection in a compact-Lie-group equivariant layer by a finite-rank Fejér-Markov filter. The filter acts as a normalized positive group convolution, preventing sup-norm amplification and suppressing high-frequency artifacts while retaining exact equivariance.

## Mathematical statement

The paper constructs a finite-rank spectral filter F_N that is positivity preserving and non-expansive in the supremum norm. Let G be a compact Lie group with normalized Haar measure dg, let K_N:G    o\mathbb{R} be the filter kernel, and define (F_Nf)(g)=\int_GK_N(h^{-1}g)f(h)dh. The required Markov properties are K_N(g)\geq0 and \int_GK_N(g)dg=1; they imply f\leq q\Rightarrow F_Nf\leq F_Nq and \|F_Nf-F_Nq\|_\infty\leq\|f-q\|_\infty. Finite rank is imposed in the Peter-Weyl domain: if \widehat G is the set of irreducible unitary representations, \widehat f(\pi)=\int_Gf(g)\pi(g)^*dg, and a_N(\pi) is a smooth spectral window, then F_Nf(g)=\sum_{\mathrm{freq}(\pi)\leq N}a_N(\pi)\widehat f(\pi)\pi(g). The window must be chosen so that its inverse transform K_N is nonnegative; arbitrary spectral tapering does not guarantee this. The paper's dynamic-programming error rate is O(\sqrt{\delta}+\sqrt{\varepsilon+(\delta N^2)^{-1}}), where \delta is the time step, N is spectral resolution, and \varepsilon is artificial viscosity. The neural analogue is a non-expansive spectral mixing operator, while the rate motivates coupling a residual or recurrent step size to resolution through \delta=N^{-1}.

## Key formulas

- $$K_N(g)\geq 0,\qquad \int_G K_N(g)\,dg=1,\qquad (F_N f)(g)=\int_G K_N(h^{-1}g)f(h)\,dh,$$
- $$f\leq q\Longrightarrow F_Nf\leq F_Nq,\qquad \|F_Nf-F_Nq\|_\infty\leq \|f-q\|_\infty,$$
- $$F_Nf(g)=\sum_{\substack{\pi\in\widehat G\\\mathrm{freq}(\pi)\leq N}}a_N(\pi)\,\widehat f(\pi)\,\pi(g),\qquad \widehat f(\pi)=\int_G f(g)\pi(g)^*\,dg,$$
- $$\mathrm{error}=O\!\left(\sqrt{\delta}+\sqrt{\varepsilon+(\delta N^2)^{-1}}\right),\qquad \delta=N^{-1}\ \Rightarrow\ \mathrm{error}=O(N^{-1/2})\ \text{when }\varepsilon=0.$$$

## Implementation notes

1. Integration point: use the operator immediately after the inverse Wigner transform in an SO(3)-equivariant network, or as the spatial/motion-mixing operation in a recurrent group-valued block. Let x[b,c,g] be feature values on a discretized group grid. Apply the positive filter independently to channels before the nonlinearity or residual addition; do not use a raw signed spectral truncation. 2. Pseudocode: compute W=group_fft_or_wigner(x); for every irreducible block pi, set W_pi=a_N(pi)*W_pi if freq(pi)<=N and W_pi=0 otherwise; compute y_raw=group_ifft(W); alternatively convolve x with a precomputed kernel K_N; normalize K_N by K_N/=sum_grid(K_N); return y=gamma*y_raw+(1-gamma)*x with gamma in [0,1]. For vector-valued representation blocks, apply the scalar filter within each block so that equivariance is preserved. 3. Compute from the mathematics: the finite spectral support, kernel nonnegativity, unit kernel mass, and the predicted non-expansive property. Estimate empirically the kernel's minimum, mass error, operator norm ratio, and spectral attenuation. Search over smooth cosine or B-spline windows and retain only windows whose inverse transform is nonnegative on a sufficiently fine group grid. Couple the residual time step to resolution using delta=N^{-1}. 4. First experiment: train a small SO(3)-equivariant classifier or pose-regression model on rotated ModelNet40 or synthetic band-limited functions. Compare raw Wigner truncation, heat-kernel smoothing, and the positive Fejer-Markov layer at equal retained coefficients and FLOPs. Measure unseen-rotation accuracy, activation sup-norm amplification across 20 stacked layers, gradient norm variance, loss stability at larger learning rates, and high-frequency aliasing. Success means lower amplification and fewer divergences with equal or better accuracy and at most 10% extra compute.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: inconclusive
- Verdict: Built and verified a finite-rank Fejer-Markov convolution layer on the cyclic compact-group analogue Z_256, with exact shift equivariance. Across L=[2,4,8,16,32,64], kernels were nonnegative and unit-mass, order preservation and sup-norm non-expansion held, and Fejer eigenvalues matched the predicted triangular attenuation to 7e-16. Matched-rank signed truncation had induced sup norms from 1.44 to 2.80, while the positive filter remained at 1.0; after 20 layers at L=64, the signed filter reached 1.393 times the initial sup norm versus 0.146 for Fejer.

### Mechanism check

- Verdict: Built and verified a finite-rank Fejer-Markov convolution layer on the cyclic compact-group analogue Z_256, with exact shift equivariance. Across L=[2,4,8,16,32,64], kernels were nonnegative and unit-mass, order preservation and sup-norm non-expansion held, and Fejer eigenvalues matched the predicted triangular attenuation to 7e-16. Matched-rank signed truncation had induced sup norms from 1.44 to 2.80, while the positive filter remained at 1.0; after 20 layers at L=64, the signed filter reached 1.393 times the initial sup norm versus 0.146 for Fejer.
- Confidence: 9/10
- Limitations: This is a Z_256/SO(2)-style toy verification rather than an SO(3) Wigner implementation or a trained neural classifier. It does not test accuracy, FLOPs, learning dynamics, unseen-rotation generalization, or the paper's dynamic-programming error rate; the practical comparison is limited to signed versus positive convolution stability.

### Practical benchmark

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

## Artifacts

- [bench_markov.py](https://synthcore.org/code/486/bench_markov.py)
- [bench_report.json](https://synthcore.org/code/486/bench_report.json)
- [markov_filter_experiment.py](https://synthcore.org/code/486/markov_filter_experiment.py)
- [report.md](https://synthcore.org/code/486/report.md)
- [report_bench_2026-08-31T153159.md](https://synthcore.org/code/486/report_bench_2026-08-31T153159.md)
- [results.json](https://synthcore.org/code/486/results.json)
- [Download all files as ZIP](https://synthcore.org/download/486)

## Disclaimer

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