Pseudo-Arclength Equilibrium Layer
Implementation & benchmark of arXiv:2607.10436 — Tracking Through Decoupling Singularities: A Singularity-Robust Homotopy-Continuation Extension of Feedback Linearization
Source paper: Tracking Through Decoupling Singularities: A Singularity-Robust Homotopy-Continuation Extension of Feedback Linearization arXiv:2607.10436 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace the direct Newton solve used in an implicit or equilibrium neural layer with a pseudo-arclength homotopy solve that augments the potentially singular layer Jacobian by one continuation direction. The layer can then track a solution branch through generic folds, where ordinary inversion becomes unbounded, while selecting the minimum-norm state and continuation update.
Formulas
Mathematical statement
Let an implicit layer solve $F_\theta(z)=y$ for hidden state $z\in\mathbb{R}^n$, with residual $H(z,\mu,t)=F_\theta(z)-F_\theta(z_0)+(\mu-t+1)[F_\theta(z_0)-y^*(t)]$. Here $\mu$ is a continuation coordinate, $t$ indexes the target-solving path, and $J=\partial H/\partial z=\partial F_\theta/\partial z$ may lose rank. Define the augmented matrix $A=[J\mid b]$, where $b=\partial H/\partial\mu=F_\theta(z_0)-y^*(t)$, and solve the minimum-norm equation $Aq=r$ with $q=[\dot z;\dot\mu]$. If $w^TJ=0$ for a left-null vector $w$ at a rank-one singularity and $w^Tb\neq0$, then $A$ remains full row rank even though $J$ is singular. The minimum-norm solution is $q=A^T(AA^T)^{-1}r$, or a numerically stable QR/SVD equivalent. Use $r=-\partial H/\partial t-kH$ for residual-correcting continuation, with gain $k>0$. Away from singularities the method reduces to ordinary Newton or implicit differentiation; at a fold it remains bounded because the added column supplies the missing left-null direction.
Implementation notes
1. Exact integration point: implement this as the forward solver for a small implicit MLP or equilibrium layer, for example $z=\tanh(Wz+Ux+c)$, whose residual is $F_\theta(z)=z-\tanh(Wz+Ux+c)$. At each continuation step, evaluate the residual $H$, Jacobian-vector products for $J$, and append the continuation vector $b$. The augmented linear solve can also be reused in implicit backward differentiation when the backward Jacobian is nearly singular. 2. Pseudocode: initialize $z=z_0$ and $\mu=0$; repeat: compute $H$, obtain $J$ by autodiff, compute $b=F(z_0)-y^*$, set $A=[J,b]$, form $r=-\partial_tH-kH$, solve $q=\operatorname{lstsq}(A,r)$ using QR or SVD, update $z\leftarrow z+\Delta s q_z$ and $\mu\leftarrow\mu+\Delta s q_\mu$, and stop when $\|H\|<\epsilon$. Reduce $\Delta s$ if the residual increases. 3. Computed quantities: $J$, singular values, the least-norm solve, and $w$ are computed numerically; $w$ is the smallest-left-singular-vector of $J$. The paper supplies the transversality mechanism, while fold locations and conditioning must be estimated for each network. If $|w^Tb|$ is too small, perturb $b$ with a normalized random direction and record the intervention. 4. First cheap experiment: use a two-dimensional equilibrium MLP with the explicit fold residual $F(z)=[z_1^2+z_2-y_1, z_2-y_2]$ and sweep $y_1$ through zero. Compare ordinary damped Newton, direct pseudoinverse Newton, and augmented continuation. Measure $\sigma_{\min}(J)$, $|w^Tb|$, update norm, residual, and branch tracking. The prediction is that direct Newton update norms scale as $1/\sigma_{\min}(J)$ and diverge near the fold, whereas augmented updates remain bounded whenever $|w^Tb|>0$. Deliberately rotate $b$ so $w^Tb\to0$; the augmented method should then show the predicted failure boundary through a sharp condition-number increase.
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 9/10
Built a numerical pseudo-arclength minimum-norm solver for the explicit two-dimensional fold residual and verified the proposed mechanism. Direct updates scale as sigma_min^-1 with observed log-log slope -1.000, augmented updates remain bounded as sigma_min approaches zero with slope -0.0002, and augmented update norms scale as |w^T b|^-1 with observed slopes -1.000 and -1.000. At the exact fold, direct pseudoinverse forcing retained residual 0.707 while the augmented solve achieved residual below 1e-15; this demonstrates the mechanism, but not yet an end-to-end neural-layer performance win.
- Agent confidence
- 9/10
- Baseline
- Direct pseudoinverse: log-log update slope vs singular value = -1.000; near-fold update norm = 25.0; exact-fold forcing residual = 0.7071.
- Idea
- Augmented minimum-norm solve: singular-value slope = -0.0002; maximum branch-sweep update norm = 1.0; exact-fold residual = 0.0, with maximum residual 8.95e-16; inverse-transversality slopes = -1.000 and -1.000.
Limitations: Only the prescribed analytic two-dimensional fold was tested. No tanh equilibrium MLP, iterative predictor-corrector continuation, backward differentiation, wall-clock comparison, GPU experiment, noise sensitivity, or training benchmark was evaluated.
How to run: python3 pseudo_arclength_experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.10436)
Significantly WORSE than the tuned baseline (+359.5%, p=0.0081, wins 0 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- custom_equilibrium
- Paired seeds
- 8
- Baseline mean
- 0.0017
- Idea mean
- 0.0078
- Effect (Δ)
- 0.0061 (+359.5%; negative = idea better)
- Wins
- 0 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±134.5%
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Tested only the built-in dynamics track and a small custom equilibrium predictor rather than the exact bench rnn_small architecture. The implementation used six fixed Newton/correction iterations and did not test continuation across an explicitly generated fold, backward differentiation, adaptive step sizes, larger hidden widths, or longer training budgets.
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 latest Failed ✗
Agent confidence: 9/10
Built a matched equilibrium dynamics predictor using direct Newton corrections as baseline and pseudo-arclength augmented minimum-norm corrections as the sole intervention. On eight paired seeds, the idea had substantially worse test MSE (0.007754 vs 0.001687; delta +0.006066) with permutation p=0.0081, despite confirming the trained-model conditioning signal: mean sigma_min increased from 0.3655 to 0.3961 (ratio 1.084). Therefore the mechanism is present but does not improve the standard benchmark metric.
- Baseline
- dynamics/custom_equilibrium, best lr=0.01 damping=0.65 epochs=10; full 8-seed MSE mean=0.00168750, std=0.00082690.
- Idea
- same architecture and settings with augmented pseudo-arclength solve; best full 8-seed MSE mean=0.00775398, std=0.00285237.
- Mechanism signature
- Trained-model mean sigma_min(J)=0.365549; mean sigma_min([J|b])=0.396092; augmented/direct ratio=1.08355; confirmed=true.
- Paired delta
- idea - baseline = +0.00606648 MSE; 0/8 idea wins; permutation p=0.0081.
Benchmark result
Significantly WORSE than the tuned baseline (+359.5%, p=0.0081, wins 0 / 8 paired seeds).
- Benchmark
- Dynamics forecasting
- Model
- custom_equilibrium
- Paired seeds
- 8
- Baseline mean
- 0.0017
- Idea mean
- 0.0078
- Effect (Δ)
- 0.0061 (+359.5%; negative = idea better)
- Wins
- 0 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±134.5%
- Mechanism
- Confirmed ✓
- Practical effect
- Hurts
- Baseline tuning
- swept over 3 configs
Tested only the built-in dynamics track and a small custom equilibrium predictor rather than the exact bench rnn_small architecture. The implementation used six fixed Newton/correction iterations and did not test continuation across an explicitly generated fold, backward differentiation, adaptive step sizes, larger hidden widths, or longer training budgets.
How to run: python3 run_bench.py
Artifacts
- bench_report.json 3.9 KB View Raw
- pseudo_arclength_experiment.py 5.8 KB View Raw
- report.md 1.5 KB View
- report_bench_2026-08-30T160640.md 6.1 KB View
- results.json 1.3 KB View Raw
- run_bench.py 6.6 KB View Raw