# Interval-Certified Equilibrium Layer

- ID: 1923
- Canonical URL: https://synthcore.org/idea/1923/interval-certified-equilibrium-layer
- API JSON: https://synthcore.org/api/idea/1923.json
- API Markdown: https://synthcore.org/api/idea/1923.md
- Verification status: failed_benchmark
- Source: [arXiv:2608.07071](https://arxiv.org/abs/2608.07071)
- Category: dynamics
- Solves: stability, accuracy, generalization
- ML areas: rnn, ssm, training-dynamics, inference-speedup
- Math tags: dynamical-systems, control-theory, linear-algebra, numerical-analysis
- Ratings: usefulness 8/10; difficulty 7/10; novelty 7/10

## Idea description

Replace an unverified fixed-point solve in a deep equilibrium or recurrent layer by an interval branch-and-bound procedure that certifies whether the equilibrium is absent, unique, or potentially multiple over a box of states and uncertain parameters. During inference, return the certified equilibrium when uniqueness is proved and reject, subdivide, or invoke a fallback solver when the certificate fails.

## Mathematical statement

Write the neural equilibrium equation as $F(z,p)=g_{\theta}(z,u,p)-z=0$, where $z\in\mathbb{R}^{d}$ is the hidden equilibrium, $u$ is the input, $p\in P$ is an uncertainty box, and $g_{\theta}$ is the recurrent update. For a state box $X$ and parameter box $P$, evaluate an interval extension $F(X,P)$ and an interval Jacobian $[J](X,P)$ enclosing $\partial F/\partial z$. For a point $z_{0}\in X$, let $C$ approximate $[J](z_{0},P)^{-1}$ and define the interval Krawczyk set $K(z_{0},X,P)=z_{0}-C F(z_{0},P)+(I-C[J](X,P))(X-z_{0})$. If $K\subset\operatorname{int}(X)$, the contraction certificate proves a unique zero in $X$ for every admissible parameter realization under the interval inclusion; if $K\cap X=\varnothing$, $X$ contains no zero. Otherwise subdivide $X$ or $P$. The computable margin $q=\|I-C[J](X,P)\|$ predicts certification difficulty: values below one indicate a contractive regime, while values near or above one indicate possible multiplicity or insufficiently tight bounds.

## Key formulas

- $$F(z,p)=g_{\theta}(z,u,p)-z=0,\qquad [J](X,P)\supseteq \frac{\partial F}{\partial z}(X,P).$$
- $$K(z_{0},X,P)=z_{0}-C F(z_{0},P)+\bigl(I-C[J](X,P)\bigr)(X-z_{0}).$$
- $$K\subset\operatorname{int}(X)\Rightarrow \text{unique equilibrium in }X,\qquad K\cap X=\varnothing\Rightarrow \text{no equilibrium in }X.$$$
- $$q(X,P)=\left\|I-C[J](X,P)\right\|<1\quad\text{predicts contractive certification and geometric enclosure shrinkage }\operatorname{diam}(X_k)\lesssim q^k\operatorname{diam}(X_0).$$

## Implementation notes

1. Integration point: implement this as an optional solver and safety wrapper around a DEQ, implicit MLP, or recurrent state-space layer. Define the residual as `F(z)=cell(z,u,theta,p)-z`; represent `z` and uncertain quantities such as bounded parameter perturbations or input ranges as interval boxes. Use outward-rounded interval arithmetic on CPU for certification, while retaining ordinary autodiff for training. 2. Pseudocode: initialize a queue with `(X0,P0)`; for each box choose its midpoint `z0`, compute the residual, interval residual, interval Jacobian, and preconditioner `C=inv(midpoint(J))`; form `K=z0-C*F(z0,P)+(I-C*Jinterval)*(X-z0)`. If `K` is strictly inside `X`, store the unique certificate; if disjoint, discard; otherwise bisect the widest state or parameter interval and continue until a box budget is reached. At inference return the midpoint of a certified box, and use a conventional fixed-point solver only for uncertified boxes. 3. Computed versus estimated: interval residuals and Jacobian bounds are computed with directed rounding; the preconditioner is a floating-point estimate and should be conservatively inflated. The contraction margin `q` is measured from the interval matrix. 4. First cheap experiment: use a 2D or 4D tanh DEQ on MNIST or a synthetic two-class dataset and compare Anderson iteration against certification over parameter intervals `P=[p0-r,p0+r]`. Sweep recurrent gain and uncertainty radius. The predicted signature is a sharp certification boundary near `q=1`: boxes with measured `q<0.8` should be certified after few subdivisions, while certification effort and failures increase rapidly as `q` approaches one. Under box refinement, the certified equilibrium count should be stable, whereas random parameter sampling should miss branches near the transition.

## Verification

- Status: failed_benchmark
- Mechanism evidence: yes
- Mechanism confirmed: no
- Practical verdict: no_effect
- Verdict: Built an interval Krawczyk branch-and-bound MVP for a separable tanh equilibrium, with conservative Jacobian bounds and explicit global statuses that do not confuse a local certificate with global uniqueness. The math check passed on 20,000 random state/parameter samples, and q approached the predicted boundary near gain 1.0. Multi-equilibrium domains produced certified branches but correctly remained inconclusive when unresolved regions persisted; this demonstrates a safety/certification signal, not an inference-speed win.

### Mechanism check

- Verdict: Built an interval Krawczyk branch-and-bound MVP for a separable tanh equilibrium, with conservative Jacobian bounds and explicit global statuses that do not confuse a local certificate with global uniqueness. The math check passed on 20,000 random state/parameter samples, and q approached the predicted boundary near gain 1.0. Multi-equilibrium domains produced certified branches but correctly remained inconclusive when unresolved regions persisted; this demonstrates a safety/certification signal, not an inference-speed win.
- Confidence: 8/10
- Limitations: Only a small synthetic 2D separable tanh system was tested; no trained DEQ, MNIST/task accuracy, Anderson comparison, GPU implementation, directed-rounding interval library, wall-clock speedup, or high-dimensional coupled Jacobian case was evaluated.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 1
- Paired wins: 0/8
- Benchmark verdict: no measurable effect

## Artifacts

- [bench_report.json](https://synthcore.org/code/710/bench_report.json)
- [interval_equilibrium.py](https://synthcore.org/code/710/interval_equilibrium.py)
- [mvp_experiment.py](https://synthcore.org/code/710/mvp_experiment.py)
- [mvp_results.json](https://synthcore.org/code/710/mvp_results.json)
- [report.md](https://synthcore.org/code/710/report.md)
- [report_bench_2026-09-02T161537.md](https://synthcore.org/code/710/report_bench_2026-09-02T161537.md)
- [results.json](https://synthcore.org/code/710/results.json)
- [run_experiment.py](https://synthcore.org/code/710/run_experiment.py)
- [stage2_bench.py](https://synthcore.org/code/710/stage2_bench.py)
- [verification.json](https://synthcore.org/code/710/verification.json)
- [verify_math.py](https://synthcore.org/code/710/verify_math.py)
- [Download all files as ZIP](https://synthcore.org/download/710)

## Disclaimer

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