✗ Mechanism failed 2026

Resolvent Fractional-Power Layer

Implementation & benchmark of arXiv:2607.09152 — Functions and Means of Accretive Operators

Usefulness6/10
Difficulty6/10
Novelty7/10

Source paper: Functions and Means of Accretive Operators arXiv:2607.09152 ⓘ · analyzed Aug 30, 2026

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

Idea description

Parameterize a learned feature-space operator as accretive but not necessarily symmetric, then apply its fractional power through a finite positive mixture of shifted resolvents. This provides a matrix-function layer that can represent directional and rotational interactions while avoiding unstable eigendecomposition of nonnormal matrices.

Formulas

$$f(A)=f(0)I+bA+\int_{0}^{\infty}\left(\frac{1}{\lambda}I-(\lambda I+A)^{-1}\right)d\mu(\lambda).$$
$$A^{r}=\frac{\sin(\pi r)}{\pi}\int_{0}^{\infty}\left(\frac{1}{\lambda}I-(\lambda I+A)^{-1}\right)\lambda^{r}\,d\lambda,\qquad 0<r<1.$$
$$A^{r}\approx \frac{\sin(\pi r)}{\pi}\sum_{j=1}^{m}w_j\lambda_j^{r-1}(\lambda_j I+A_\varepsilon)^{-1}A_\varepsilon,\qquad A_\varepsilon=A+\varepsilon I.$$
$$A=S+K,\qquad S=\frac{A+A^{*}}{2}=LL^{*}+\delta I\succ0,\qquad K=\frac{A-A^{*}}{2},\quad K^{*}=-K.$$

Mathematical statement

The paper represents an operator-monotone function f on (0,∞), with finite f(0), as f(A)=f(0)I+bA+∫_0^∞(1/λ I−(λI+A)^{-1})dμ(λ), where A is a bounded accretive operator, b≥0, and μ is a positive measure satisfying the integrability condition from the paper. For 0<r<1, the fractional power is A^r=(sin(πr)/π)∫_0^∞(1/λ I−(λI+A)^{-1})λ^r dλ. Accretivity means Re(A)=(A+A*)/2 is positive semidefinite; with εI added it is strictly accretive, so λI+A+εI is invertible for every λ>0. Using 1/λ I−(λI+A)^{-1}=λ^{-1}(λI+A)^{-1}A, the fractional power can be evaluated using shifted linear solves rather than eigenvectors. The transferable property is that the function is a positive resolvent mixture, which remains well behaved for nonnormal operators and can be approximated by a small rational sum.

Implementation notes

Integrate this at a feature transformation or residual block, not at the scalar activation: given token or sample features X∈R^{B×d}, use a shared d×d operator A and return Y=X(A^r)^T, optionally followed by a learned projection and residual addition. Parameterize A in real arithmetic as A=S+K, with L∈R^{d×q}, S=LL^T+δI, and K=(U−U^T)/2; this guarantees the symmetric part S is positive definite while allowing nonnormal dynamics. Choose ε≥0 and m=4–12 logarithmically spaced shifts λ_j between λ_min and λ_max. Precompute quadrature nodes and weights for the scalar integral on [λ_min,λ_max], or fit them by minimizing the scalar approximation error |t^r−(sin(πr)/π)Σ_j w_j λ_j^{r−1}t/(λ_j+t)| over t∈[δ,Λ]. For each forward pass, solve (λ_jI+A_ε)Z_j=A_εX^T using a batched direct solve for d≤128 or a fixed number of preconditioned GMRES iterations for larger d, then return (sin(πr)/π)Σ_j w_jλ_j^{r−1}Z_j. Estimate δ and Λ from the eigenvalues or singular values of a detached copy of S every few hundred steps; do not differentiate through this estimation initially. The paper supplies the resolvent-mixture formula and accretive construction; quadrature truncation, node placement, and solve tolerances are empirical engineering choices. First test on CIFAR-10 with a 6-layer MLP or small Mixer at width d=64. Compare ordinary linear residual blocks, symmetric PSD fractional-power blocks using eigh, and this accretive resolvent block at matched parameter count and FLOPs. Measure training loss at equal updates, validation accuracy, gradient-norm variance, and failure rate from exploding or NaN solves. A useful positive signal is lower gradient variance or faster loss descent at equal width, with approximation error below 1e-3 on held-out scalar spectral points and no increase in forward instability. For a larger test, replace the channel-mixing matrix in a small Transformer with this layer and check perplexity versus wall-clock time and solver iterations.

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 7/10

Built a nonnormal accretive resolvent fractional-power layer using positive log-grid quadrature and shifted linear solves, with a principal-matrix-power and stability verification. The resolvent approximation stayed finite as skew increased, but the truncated quadrature produced 19.3% scalar error and 4.6–6.0% matrix error. On one tiny classification task it achieved 1.000 versus 0.989 validation accuracy and lower loss at step 60, but was 2.8x slower, had higher gradient-norm variance, and was not parameter- or FLOP-matched, so no demonstrated win was established.

Agent confidence
7/10
Baseline
final train loss 0.000683; step-60 loss 0.00553; validation accuracy 0.9889; gradient-norm variance 0.01619; runtime 1.91 s; no NaN/Inf
Idea
final train loss 0.001224; step-60 loss 0.00454; validation accuracy 1.0000; gradient-norm variance 0.02102; runtime 5.35 s; no NaN/Inf; scalar max relative approximation error 0.1926; matrix relative error 0.0472 at skew 1.8

Limitations: Only one small synthetic dataset and one seed were tested; the comparison was not parameter- or FLOP-matched, no CIFAR-10 or Transformer experiment was run, quadrature nodes were not optimized, and no large-width scalability or GMRES study was performed.

How to run: python3 run_experiment.py

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

Artifacts

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