Spectral-submanifold latent dynamics
Implementation & benchmark of arXiv:2607.10675 — Spectral submanifold reduction for PDEs describing nonlinear continuum vibrations
Source paper: Spectral submanifold reduction for PDEs describing nonlinear continuum vibrations arXiv:2607.10675 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace an unconstrained high-dimensional recurrent hidden state with a low-dimensional nonlinear invariant manifold attached to a selected spectral subspace of the hidden-state linearization. Learn both the manifold graph and its reduced nonlinear dynamics, then roll out the reduced coordinates for long horizons while reconstructing the full hidden state only when needed.
Formulas
Mathematical statement
The source studies the forced-damped second-order evolution equation $\ddot u+B\dot u+Au=f(u,\dot u)+\varepsilon h(t)$, where $u$ is the PDE state, $A$ is the elastic operator, $B$ is the damping operator, $f$ is a nonlinear term, $h$ is external forcing, and $\varepsilon$ is forcing amplitude. Convert a neural hidden-state system to first order, $\dot x=F(x,t)$, and let $E$ be the span of selected eigenvectors of the Jacobian $J=D_xF(0)$ with eigenvalues $\lambda_1,\ldots,\lambda_d$. An SSM is represented by a nonlinear graph $x=W(z)=Vz+H(z)$, where $z\in\mathbb R^d$, $V$ contains the selected eigenvectors, and $H(z)=O(\|z\|^2)$ lies transverse to $E$. Its defining property is the invariance equation $D_zW(z)R(z)=F(W(z),t)$, where $R$ is the reduced latent vector field. Enforce this residual during training. For a two-dimensional oscillatory mode with complex coordinate $z$, use the normal form $\dot z=(\lambda+i\omega)z+c z|z|^2+\varepsilon q(t)$, with damping rate $\lambda<0$, linear frequency $\omega$, cubic coefficient $c=c_r+ic_i$, and forcing projection $q$. The predicted amplitude decay and backbone frequency are $\dot r=\lambda r+c_r r^3$ and $\Omega(r)=\omega+c_i r^2$, respectively, for amplitude $r=|z|$.
Implementation notes
1. Integration point: use a GRU, continuous-time RNN, or latent neural ODE with hidden state $x\in\mathbb R^n$. Add an encoder into $d=2$ or $4$ modal coordinates, a decoder $W_\theta(z)=V_\theta z+H_\theta(z)$, and a reduced vector field $R_\phi(z)$. Use $z$, rather than $x$, for long-horizon rollout. Estimate the hidden Jacobian $J$ at a reference state with automatic differentiation and initialize $V_\theta$ from eigenvectors associated with slow stable complex-conjugate eigenvalues. 2. Pseudocode: encode $z=E_\theta(x)$; reconstruct $\hat x=W_\theta(z)$; evaluate $\hat F=F_\theta(\hat x,t)$ and $\hat R=R_\phi(z,t)$; calculate $e_{\mathrm{inv}}=D_zW_\theta(z)\hat R-\hat F$; optimize $L=L_{\mathrm{prediction}}+\alpha\|e_{\mathrm{inv}}\|^2+\beta\|E_\theta(W_\theta(z))-z\|^2$. At inference, integrate $\dot z=R_\phi(z,t)$ and decode at output times. 3. Computed from the paper's mechanism: the graph invariance equation, spectral-subspace initialization, and reduced amplitude/frequency structure. Estimated empirically: $J$, $\lambda$, $\omega$, $c_r$, and $c_i$; fit these coefficients by least squares from latent trajectories after training. 4. First cheap experiment: train on a damped Duffing oscillator or a two-mode nonlinear beam surrogate, comparing a linear projection, a standard autoencoder latent ODE, and the SSM model at equal latent dimension. Sweep initial amplitude and measure frequency from zero crossings, amplitude decay, invariance residual, and 50- to 200-step rollout error. The quantitative prediction is that $\Omega(r)$ is approximately affine in $r^2$ with slope $c_i$, while amplitude follows the cubic-corrected decay equation. Rollout error should rise sharply as an omitted eigenvalue approaches the selected spectral band, when the spectral-gap ratio $\min_{j\notin E}|\operatorname{Re}\lambda_j|/\max_{i\in E}|\operatorname{Re}\lambda_i|$ approaches one.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Confirmed ✓
Stage 2 · Practical benchmark result: Significantly worse ✗
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 8/10
Built a reproducible nonlinear SSM toy with a quadratic graph, cubic reduced dynamics, coefficient fitting, invariance checking, spectral-gap sweep, and rollout comparison. The backbone prediction Ω(r)=ω+c_i r² was observed as intercept 2.000000 and slope 0.350000 versus predicted 2.0 and 0.35; the radial law recovered λ=-0.080000 and c_r=-0.120000 versus the exact values. Transverse decay matched every swept γ from 0.04 to 0.64 within about 1e-9, and cubic SSM rollout RMSE was lower than the linear baseline at horizons 5/10/18 (0.0699/0.0890/0.0966 vs 0.3397/0.3833/0.3652).
- Agent confidence
- 8/10
- Baseline
- Linear reduced rollout RMSE: horizon 5 = 0.3397, 10 = 0.3833, 18 = 0.3652.
- Idea
- Cubic SSM reduced rollout RMSE: horizon 5 = 0.0699, 10 = 0.0890, 18 = 0.0966; frequency fit intercept/slope = 2.000000/0.350000 vs predicted 2.0/0.35; radial fit λ/c_r = -0.080000/-0.120000 vs predicted -0.08/-0.12; graph RMSE and invariance residual = 1.11e-16 and 0.
Limitations: This is an analytically constructed two-dimensional normal-form system with an exactly known invariant graph, so the math predictions are strongly verified but neural encoder/decoder training, noisy data, forcing, higher-dimensional hidden states, model-selection of eigenvectors, GPU performance, and comparison against a trained GRU or neural ODE were not tested.
How to run: python3 ssm_experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.10675)
Significantly WORSE than the tuned baseline (+447.2%, p=0.0313, wins 2 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0002
- Idea mean
- 0.0009
- Effect (Δ)
- 0.0008 (+447.2%; negative = idea better)
- Wins
- 2 / 8 paired seeds
- p-value
- 0.0313 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±463.3%
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Only the built-in registered dynamics track was tested. Explicit continuous-time invariance residuals, spectral-eigenvector initialization, neural ODEs, custom PDE data, and longer-horizon latent rollouts were not evaluated.
How to run: python3 bench_stage2.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Failed ✗
Agent confidence: 9/10
The registered dynamics benchmark completed with 8 paired seeds and an equal learning-rate sweep. The learned 2-D graph showed small trained-model reconstruction and cycle errors, but the idea was significantly worse on independent pendulum test MSE, so it did not win.
- Baseline
- mean MSE 0.00017096688088713563, std 0.00010126879946081006, best cfg lr=0.01 weight_decay=0.0
- Idea
- mean MSE 0.0009354783833259717, std 0.0008458565266022649, best cfg lr=0.01 weight_decay=0.0, paired delta +0.000764511502438836, p=0.0313
Benchmark result
Significantly WORSE than the tuned baseline (+447.2%, p=0.0313, wins 2 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0002
- Idea mean
- 0.0009
- Effect (Δ)
- 0.0008 (+447.2%; negative = idea better)
- Wins
- 2 / 8 paired seeds
- p-value
- 0.0313 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±463.3%
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Only the built-in registered dynamics track was tested. Explicit continuous-time invariance residuals, spectral-eigenvector initialization, neural ODEs, custom PDE data, and longer-horizon latent rollouts were not evaluated.
How to run: python3 bench_stage2.py
Artifacts
- bench_report.json 2.9 KB View Raw
- bench_stage2.py 6.7 KB View Raw
- report.md 1.6 KB View
- report_bench_2026-08-30T155841.md 4.2 KB View
- results/metrics.json 1.9 KB View Raw
- ssm_experiment.py 6.5 KB View Raw