Lattice Monodromy Residual Block
Implementation & benchmark of arXiv:2608.21238 — $G_2$-Manifolds from 4d $\mathcal{N}=1$ Quivers
Source paper: $G_2$-Manifolds from 4d $\mathcal{N}=1$ Quivers arXiv:2608.21238 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Insert a fixed reversible lattice shear into a residual network so successive blocks follow a structured monodromy orbit rather than using unrelated learned transformations. Apply the transformation to a small learned subspace of hidden channels while leaving the remaining channels unchanged. This creates deterministic phase-dependent feature mixing with no additional trainable parameters.
Formulas
Mathematical statement
The paper gives the explicit n=3 monodromy action for geometric flux \(\mathcal{F}_3=4\Sigma-2F-2M_7-2M_8\): for every lattice element \(\Gamma\in I_{1,9}\), \(T_{\mathcal F}(\Gamma)=\Gamma+\frac12(\mathcal{F}_3\cdot\Gamma)E-\frac12(E\cdot\Gamma)\mathcal{F}_3+3(E\cdot\Gamma)E\), where \(E\) is the elliptic-fiber class, \(\mathcal F_3\cdot\Gamma\) and \(E\cdot\Gamma\) are intersection pairings, and \(I_{1,9}\) is the integral curve lattice. In a coordinate basis, let \(B\) be the Gram matrix of the pairing and let \(e,f,\gamma\) be coordinate vectors for \(E,\mathcal F_3,\Gamma\). Then \(E\cdot\Gamma=e^TB\gamma\) and \(\mathcal F_3\cdot\Gamma=f^TB\gamma\), giving the implementable linear map \(T_{f,e}(\gamma)=\gamma+\frac12(f^TB\gamma)e-\frac12(e^TB\gamma)f+3(e^TB\gamma)e\). The paper also states that the generating maps satisfy \(\mu_s^2=\mu_{t,4}^2=1\), enabling periodic reversible compositions.
Implementation notes
Use a compact subset of hidden channels, for example 16 or 32 channels in a Transformer residual stream or the state vector of an SSM. Choose a small integer lattice basis of dimension d and a symmetric Gram matrix B; for an MVP use a diagonal or block-diagonal B with entries in {+1,-1}, then choose integer vectors e and f representing the fiber and flux directions. Precompute the d-by-d matrix T from the formula Tγ=γ+0.5(f^T Bγ)e-0.5(e^T Bγ)f+3(e^T Bγ)e. If half-integer coefficients occur, use a scaled basis or store T in float32 after checking its condition number and inverse. At layer k, take z=h[..., :d], apply z'=T^k z with k modulo a chosen period, write h[..., :d]=z', and then execute the usual normalized residual block. Pseudocode: initialize e,f,B; construct T; set P[0]=I and P[k+1]=T P[k]; for each layer k, z=h[...,0:d]; z=P[k mod p] @ z; h[...,0:d]=z; h=h+MLP(LN(h)). Precompute powers rather than exponentiating per batch. The mathematical object is the fixed monodromy matrix; empirical choices are d, period p, scaling, and insertion point. First test a 6-layer Transformer on CIFAR-10 or a small language-model corpus against the same model with identity and random orthogonal transforms. Measure validation accuracy, gradient-norm variance, activation norms, and loss at equal FLOPs. A positive signal is equal or better accuracy with lower gradient variance and stable norms when the monodromy cycle is repeated at greater depth.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.