Chebyshev-Stabilized SDIRK Neural ODE
Implementation & benchmark of arXiv:2607.07497 — Explicit stabilized implementation of singly diagonally implicit Runge-Kutta methods
Source paper: Explicit stabilized implementation of singly diagonally implicit Runge-Kutta methods arXiv:2607.07497 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace explicit RK integration in a stiff neural ODE or continuous-depth residual network with the paper's stiffly accurate SDIRK4 discretization. Instead of performing a dense Newton solve for each implicit stage, solve the diagonal stage equation using a Chebyshev-accelerated residual iteration whose polynomial damps the negative, high-magnitude Jacobian modes responsible for stiffness.
Formulas
Mathematical statement
The paper's SDIRK4 method has five stages, common diagonal coefficient \(\gamma=1/4\), and stiffly accurate output \(y_{n+1}=Y_5\). For an ODE \(\dot y=F(y)\), each stage has the form \(Y_i=b_i+h\gamma F(Y_i)\), where \(h\) is the outer step size and \(b_i=y_n+h\sum_{j<i}a_{ij}F(Y_j)\) is known when stage \(i\) is solved. The extracted tableau gives \(b_1=y_n\), \(b_2=y_n+hF(Y_1)/2\), \(b_3=y_n+h(17F(Y_1)/50-F(Y_2)/25)\), \(b_4=y_n+h(371F(Y_1)/1360-137F(Y_2)/2720+15F(Y_3)/544)\), and \(b_5=y_n+h(25F(Y_1)/24-49F(Y_2)/48+125F(Y_3)/16-85F(Y_4)/12)\). Define the stage residual \(G_i(z)=z-b_i-h\gamma F(z)\). Its linearization has operator \(A_i=I-h\gamma J_F(z)\), so for dissipative dynamics with Jacobian eigenvalues \(\lambda(J_F)\le 0\), the relevant eigenvalues of \(A_i\) lie in a positive interval \([a,b]\). The adapted inner solver applies Chebyshev semi-iteration to \(A_i\delta=r_i\), with residual \(r_i=-G_i(z_i)\), midpoint \(c=(a+b)/2\), half-width \(d=(b-a)/2\), \(\alpha_0=1/c\), \(\alpha_k=1/(c-d^2\alpha_{k-1}/4)\), and \(\beta_k=d^2\alpha_k/4\). The nonlinear update is \(z_{k+1}=z_k+\alpha_k r_k+\beta_k(z_k-z_{k-1})\), recomputing \(r_k=-G_i(z_k)\) after every update. The Chebyshev polynomial contracts errors over \([a,b]\) more effectively than unaccelerated fixed-point iteration, while requiring only Jacobian-vector products or finite-difference residual evaluations.
Implementation notes
(1) Integrate this at the solver used for a continuous-depth MLP, neural ODE, or state-space model: the tensor being modified is each implicit stage state \(Y_i\), not the neural weights. The neural function \(F_\theta\) is evaluated normally, and the outer training graph can either retain all inner iterations or use a custom backward pass. Start with a detached or recomputed inner solve to control memory. (2) Pseudocode: for each outer state \(y_n\), compute the five explicit offsets \(b_i\) from the displayed SDIRK4 coefficients; initialize \(z_0=b_i\), \(z_{-1}=z_0\), and \(r_0=b_i+h\gamma F_\theta(z_0)-z_0\). Estimate \([a,b]\), construct \(\alpha_k,\beta_k\), then loop for \(k=0,\ldots,K-1\): update \(z_{k+1}=z_k+\alpha_k r_k+\beta_k(z_k-z_{k-1})\), set \(r_{k+1}=b_i+h\gamma F_\theta(z_{k+1})-z_{k+1}\), and stop when \(\|r_{k+1}\|/\|b_i\|<\varepsilon\). Set \(Y_i=z_K\), then continue to the next stage. (3) Estimate the spectral interval empirically: use 3--5 power or Lanczos iterations with Jacobian-vector products to estimate the most negative real Jacobian eigenvalue \(\lambda_{\min}\); set \(a=1\) and \(b=1-h\gamma\lambda_{\min}\), inflated by 10--25% for safety. If eigenvalues are not predominantly real and nonpositive, fall back to damped fixed-point updates or a Newton-Krylov baseline. The mathematical part is the SDIRK4 discretization and Chebyshev polynomial recurrence; the spectral bound and inner iteration count \(K\) are estimated. (4) First experiment: train a small 2--4 layer neural ODE MLP on MNIST or CIFAR-10 with a deliberately stiff residual block, such as \(F_\theta(y)=W_2\tanh(W_1y)\) initialized with a large negative symmetric component. Compare adaptive SDIRK4-Chebyshev, explicit RK4, and standard Newton-solved SDIRK4 at equal function/JVP evaluations. Measure training loss versus wall-clock time, gradient norm variance, failed-step frequency, and final accuracy. Success is a stable outer step size at least 4x larger than RK4, lower loss at equal function evaluations, and agreement with Newton SDIRK4 within the stage residual tolerance.
Verification
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 five-stage SDIRK4 solver with Chebyshev inner iterations, fixed-point control, and explicit RK4 comparison on a 16-dimensional stiff diagonal ODE. The literal recurrence from the idea diverged dramatically, with residual ratio 2.70e17, contradicting the claimed contraction; a dimensionally corrected momentum term reduced the residual by about 1/728 and enabled stable large-step propagation, but that is not the stated algorithm. Therefore the authoritative idea was not validated as written.
- Agent confidence
- 9/10
- Baseline
- At h=0.2, fixed-point stage residual ratio 9.40e33 and propagation error Infinity; RK4 error 9.50e7.
- Idea
- Literal Chebyshev residual ratio 2.70e17 and propagation diverged; corrected recurrence had residual ratio 1.37e-3 and h=0.2 propagation error 0.228.
Limitations: Only a linear diagonal stiff toy system was tested; no neural ODE training, nonlinear Jacobian estimation, GPU execution, Newton baseline, wall-clock/FLOP comparison, or gradient/backward behavior was evaluated.
How to run: python3 experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Artifacts
- experiment.py 3.5 KB View Raw
- report.md 1.3 KB View
- results.json 3.5 KB View Raw