✗ Mechanism failed 2026

Cohomological Quotient RNN

Implementation & benchmark of arXiv:2608.21352 — Cohomological Reduction for Fiber-Contracting Extensions:From Subcohomology to Thermodynamic Formalism

Usefulness7/10
Difficulty5/10
Novelty8/10

Source paper: Cohomological Reduction for Fiber-Contracting Extensions:From Subcohomology to Thermodynamic Formalism arXiv:2608.21352 ⓘ · analyzed Sep 1, 2026

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

Idea description

Build a recurrent or state-space model with a base state carrying task-relevant dynamics and an explicitly contracting auxiliary state. If the training loss or energy depends on the auxiliary state, replace it by a quotient loss plus an analytically known telescoping correction; long-run optimization and invariant averages are then unchanged, while transient fiber effects decay geometrically.

Formulas

$$F(x,y)=(f(x),ay+\rho(x)),\qquad |a|<1,$$
$$h(f(x))=ah(x)+\rho(x),\qquad \psi(x)=g(x)+\frac{b}{1-a}\rho(x),$$
$$\varphi(x,y)=\psi(x)+u(x,y)-u(F(x,y)),\qquad u(x,y)=\frac{b}{1-a}\bigl(y-h(x)\bigr),$$
$$\frac{1}{T}\sum_{t=0}^{T-1}\varphi(F^t z)-\frac{1}{T}\sum_{t=0}^{T-1}\psi(f^t x)=\frac{u(z)-u(F^Tz)}{T},\qquad |y_T-h(x_T)|=|a|^T|y_0-h(x_0)|.$$

Mathematical statement

Let \(F(x,y)=(f(x),ay+\rho(x))\) with \(|a|<1\), where \(x\) is the quotient/base state, \(y\) is the contracting fiber state, and \(\rho\) is a learned or fixed forcing map. The invariant graph \(h\) satisfies \(h(f(x))=ah(x)+\rho(x)\). For the fiber-dependent potential \(\varphi(x,y)=g(x)+by\), define \(\psi(x)=g(x)+b\rho(x)/(1-a)\) on the invariant graph and \(u(x,y)=b(y-h(x))/(1-a)\). Then \(\varphi=\psi\circ\pi+u-u\circ F\), with \(\pi(x,y)=x\). Consequently, for every trajectory, \(\sum_{t=0}^{T-1}\varphi(F^t z)=\sum_{t=0}^{T-1}\psi(f^t x)+u(z)-u(F^Tz)\). Fiber differences obey \(|y_t-h(x_t)|=|a|^t|y_0-h(x_0)|\), and the time-average discrepancy is bounded by \(2\|u\|_\infty/T\) when \(u\) is bounded.

Implementation notes

1. Integration point: implement a two-state recurrent cell. The base state is \(x_{t+1}=f_\theta(x_t,\xi_t)\), while the auxiliary state is \(y_{t+1}=a y_t+\rho_\theta(x_t,\xi_t)\). Parameterize \(a=\tanh(\alpha)\) or use \(a=\sigma(\alpha)\) for one-sided contraction, and optionally clip \(|a|\leq a_{\max}<1\). Use a per-step objective \(\varphi_t=g_\theta(x_t,\xi_t)+b y_t\). 2. Pseudocode: first estimate or compute the invariant graph by running a detached burn-in trajectory, h_x = fixed_point_or_long_burnin(f, rho, x); then compute psi_t = g(x_t) + b*rho(x_t)/(1-a) and train with loss = mean(psi_t) rather than mean(phi_t). For exact finite-horizon equivalence, add the boundary correction +(u(x_0,y_0)-u(x_T,y_T))/T, where u=b*(y-h_x)/(1-a). Backpropagate through the quotient loss, and use the full loss only for validation. 3. Computed versus estimated: \(a\), \(b\), and \(\rho\) are model quantities; \(h\) can be estimated by burn-in because contraction gives geometric convergence, or represented by a small auxiliary network trained to satisfy \(h(f(x))\approx ah(x)+\rho(x)\). Estimate the empirical contraction rate from \(\|y_{t+k}-\tilde y_{t+k}\|/\|y_t-\tilde y_t\|\), and estimate the coboundary residual from phi - psi - u + u_next. 4. First cheap experiment: compare a standard GRU or linear SSM against this split cell on sequential MNIST or Copy Memory with identical parameter counts and a synthetic objective containing \(b y_t\). Sweep \(a\in\{0.2,0.5,0.8,0.95,0.99\}\) and horizons \(T\in\{32,128,512\}\). The falsifiable signatures are: paired fiber trajectories must contract with slope \(\log|a|\) on a log-distance plot; the cumulative full-minus-quotient objective must remain bounded while its time-average decays as \(1/T\); and the residual of the cohomological identity should decrease with burn-in as \(|a|^t\). At \(a\to1\), convergence and boundary-error constants should deteriorate sharply, providing a measurable stability boundary rather than a benchmark-only comparison.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built a readable scalar quotient-RNN verification with contraction, invariant-graph, finite-horizon, and formula sweeps. The predicted fiber ratios and log-slopes match a exactly for a in {0.2,0.5,0.8,0.95,0.99}, and the corrected telescoping discrepancy scales exactly as 1/T (T times discrepancy approaches 30.855). However, the authoritative psi=g+b*rho/(1-a) formula fails for general quotient dynamics: residuals range from 3.43 to 46.98, whereas replacing it with psi=g+b*h gives residuals below 1.4e-13. Thus the underlying contraction mechanism manifests, but the proposed method is not valid as stated.

Agent confidence
9/10
Baseline
No meaningful standard RNN benchmark; the scalar full fiber-dependent objective was included as a reference, reaching final toy loss 0.00537 in verify.py.
Contraction
Observed ratios exactly matched predicted |a|, with maximum numerical relative error below 3e-6 in the burn-in sweep.
Idea
Corrected h-based quotient objective reached 0.000877 in the toy optimization; the stated rho/(1-a) quotient has identity residual up to 46.98 on the sweep, so its promised equivalence is not demonstrated.
Telescoping
For T=16..2048, T*average discrepancy converged to 30.855 and matched the analytic boundary prediction to floating-point precision.

Limitations: No sequential-MNIST/Copy-Memory or GRU comparison was run, no learned invariant-graph estimator was tested, and the toy system is one-dimensional and linear. The corrected h-based formulation was verified, but it requires access to the invariant graph and is not the formula supplied in the idea.

How to run: python3 experiment.py && /home/maxwelhelp/main/bin/python3 verify.py

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

Artifacts

Implementation overview ⬇ Download all as ZIP 5 files · code, reports and structured results