✓✓ Beats tuned baseline 2026

Triangular Hierarchical Neural State-Space Layer

Implementation & benchmark of arXiv:2607.08827 — Exact Lindbladian Dynamics from Conformal Embeddings and Topological Defects in Conformal Field Theory

Usefulness7/10

Difficulty5/10

Novelty6/10

Dynamics Stability Speedup Scalability Ssm Rnn Training dynamics Dynamical systems Control theory Linear algebra Spectral theory

Source paper: Exact Lindbladian Dynamics from Conformal Embeddings and Topological Defects in Conformal Field Theory arXiv:2607.08827 ⓘ · analyzed Aug 30, 2026

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

Idea description

Replace an unconstrained recurrent transition with a hierarchy of features whose generator is triangular: degree-ell features depend only on degree-ell and lower-degree features. This transfers the paper's closure mechanism for even-Majorana monomials into a neural state-space model, preserving nonlinear feature interactions while making the spectrum and long-time transients directly controllable.

Formulas

$$\frac{d}{dt}O=\mathcal{L}^{\dagger}[O]=\mathrm{i}[H,O]+\mathcal{D}^{\dagger}[O].$$

$$\dot z=Az,\qquad A=\begin{pmatrix}A_{11}&0&0\\A_{21}&A_{22}&0\\A_{31}&A_{32}&A_{33}\end{pmatrix},$$

$$\alpha(A)=\max_k\alpha(A_{kk})<0\quad\Longrightarrow\quad z(t)=e^{At}z(0)\text{ decays asymptotically},$$

$$\|e^{At}\|\le C(1+t^{r-1})e^{-\alpha t},\qquad \alpha>0.$$

Mathematical statement

The paper defines Heisenberg evolution by $\frac{d}{dt}O=\mathcal{L}^{\dagger}[O]=\mathrm{i}[H,O]+\mathcal{D}^{\dagger}[O]$, where $O$ is an observable, $H$ is the Hamiltonian, and $\mathcal{D}^{\dagger}$ is the adjoint dissipator. For linear Majorana jumps, reduced even-Majorana monomials form a closed triangular hierarchy: ordering features by monomial degree gives $\dot z=Az$, with $A_{ij}=0$ whenever feature $i$ depends on a higher-level feature $j$. Adapt this as a neural feature hierarchy $z=(z_1,\ldots,z_K)$, where $z_k$ contains interactions of order or scale $k$, and parameterize $A$ as block lower triangular with diagonal blocks $A_{kk}$. The exact spectral stability condition is $\max_k\alpha(A_{kk})<0$, where $\alpha(B)=\max\{\operatorname{Re}\lambda:\lambda\in\operatorname{spec}(B)\}$. If the largest Jordan block associated with eigenvalue real part $-\alpha<0$ has size $r$, then perturbations satisfy a transient bound of the form $\|e^{At}\|\le C(1+t^{r-1})e^{-\alpha t}$; hierarchy depth controls the polynomial transient and diagonal damping controls asymptotic decay.

Implementation notes

1. Integration point: implement this as the recurrent transition in a small state-space model, neural ODE, or residual RNN. Split the hidden state into K groups, such as local features, pairwise features, and higher-order features. Use an unconstrained encoder to produce input-dependent forcing, but constrain the hidden-to-hidden matrix to block lower-triangular form. Parameterize each diagonal block as $A_{kk}=S_k-\operatorname{softplus}(d_k)I$, where $S_k$ is skew-symmetric and $d_k>0$, guaranteeing negative diagonal-block spectral abscissa. 2. Pseudocode: compute $u=\operatorname{Encoder}(x_t)$; set $z'_1=A_{11}z_1+B_1u$; for $k=2,\ldots,K$, set $z'_k=A_{kk}z_k+\sum_{j<k}A_{kj}z_j+B_ku$; integrate with a matrix exponential for fixed A or RK4 for input-dependent A; predict from $[z_1;\ldots;z_K]$. During training add a penalty on estimated positive-real-part eigenvalues if the diagonal blocks are not analytically constrained. 3. Computed from the paper: the closure and triangular topology. Estimated empirically: block eigenvalues, the constant C, and effective transient degree r. 4. First cheap experiment: compare this layer with a GRU and a diagonal SSM on Adding, Copying, and sequential-MNIST tasks using identical parameter counts. Sweep the largest diagonal decay parameter and integration step. The falsifiable prediction is that perturbations follow an initial polynomial-times-exponential envelope $t^{r-1}e^{-\alpha t}$, while long-run dynamics remain stable whenever $\max_k\alpha(A_{kk})<0$. Gradually change one diagonal block from decay $-\alpha$ to growth $+\alpha$; the observed stability transition should occur within 20% of zero spectral abscissa. Increasing hierarchy depth from K=2 to K=4 should increase transient amplification approximately polynomially without changing the asymptotic exponential decay rate.

Verification

Beats tuned baseline

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Confirmed ✓

Stage 2 · Practical benchmark result: Significant win ✓

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a triangular hierarchical state-space layer with analytically damped diagonal blocks, skew-symmetric within-block dynamics, and lower-triangular cross-level couplings. Mechanism checks confirmed the predicted stability transition at growth rate 0, exact polynomial-times-exponential Jordan responses, peak-time errors below 0.0004, corrected decay slope -0.7, and Lambda^(K-1) peak scaling with observed/predicted ratios of 0.999999995. The triangular model slightly beat the small Adding-task baselines, but that comparison was not parameter-matched; the strongest result is confirmation of the stability and transient mechanism.

Agent confidence: 9/10

Baseline: Adding test MSE: diagonal 0.14930 with 61 parameters; GRU 0.14817 with 589 parameters.
Idea: Adding test MSE: triangular 0.14775 with 253 parameters; stability boundary observed 0.0 versus predicted 0.0; Jordan peak-time error <=0.0004; corrected exponential slope -0.700 versus predicted -0.700; Lambda scaling ratio 0.999999995.

Limitations: The task comparison used unequal parameter counts and one short Adding-task setup. Copying, sequential-MNIST, FLOP or speed measurements, multiple random seeds, and learned matrix-exponential integration were not tested. The neural implementation uses explicit Euler integration, and the CUDA attempt fell back to CPU after a cuDNN host-allocation error.

How to run: python3 verify_mechanism.py && /home/maxwelhelp/main/bin/python3 run_experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.08827) Sep 2, 2026

Beats the tuned baseline by 90.0% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).

Benchmark: Dynamics forecasting
Model: rnn_small
Paired seeds: 8
Baseline mean: 0.0008
Idea mean: 0.0001
Effect (Δ): -0.0007 (−90.0%; negative = idea better)
Wins: 8 / 8 paired seeds
p-value: 0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect: ±16.2%
Mechanism: Confirmed ✓
Practical effect: Helps
Baseline tuning: swept over 3 configs

Limitations:

Only the registered built-in dynamics track was tested. No speed/FLOP, longer-horizon, or exact parameter-count-matched comparison was run; the signature tested decay stability but not every polynomial transient scaling claim.

How to run: python3 run_bench.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Stage 2 — Benchmark Aug 31, 2026 latest Worked ✓

Agent confidence: 8/10

The triangular hierarchical recurrent system significantly outperformed the registered rnn_small GRU on the structurally matched actuated-pendulum dynamics track. Mean test MSE was 0.0000777861 versus 0.0007801908, all 8 paired seeds favored the idea, and the permutation p-value was 0.0081. The trained-model signature confirmed negative diagonal-block spectral abscissae and negative empirical decay; exact parameter-count matching and longer-horizon testing were not performed.

Baseline: rnn_small GRU, tuned lr=0.006, mean test MSE 0.0007801908141 over 8 seeds
Delta mean: -0.0007024047408776823
Idea: TriangularRNN, 4 groups x 16 width, tuned lr=0.006, mean test MSE 0.0000777860732 over 8 seeds
Idea wins: 8
P value: 0.0081

Benchmark result