Positive-real rational resolvent mixer
Implementation & benchmark of arXiv:2609.03054 — The classes of bivariate Schur and Herglotz matrix-valued rational functions: realizations, symmetrizations, and related determinantal representations
Source paper: The classes of bivariate Schur and Herglotz matrix-valued rational functions: realizations, symmetrizations, and related determinantal representations arXiv:2609.03054 ⓘ · analyzed Sep 4, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace an unconstrained token mixer or feed-forward residual map with a feature-conditioned rational operator whose transfer matrix is positive real on the positive orthant. Apply it through a resolvent, rather than an additive residual, so that the accretivity certificate yields a nonexpansive implicit update and suppresses activation explosions.
Formulas
Mathematical statement
The paper realizes a matrix-valued Herglotz function as $H(\zeta)=D+C(P(\zeta)+A)^{-1}B$, where $\zeta=(\zeta_1,\zeta_2)\in\mathbb{C}_+^2$, $P(\zeta)=\zeta_1P_1+\zeta_2P_2$, $A\in\mathbb{C}^{r\times r}$ is the state matrix, $B\in\mathbb{C}^{r\times d}$, $C\in\mathbb{C}^{d\times r}$, $D\in\mathbb{C}^{d\times d}$, and $P_1,P_2\in\mathbb{C}^{r\times r}$ are orthogonal projections satisfying $P_j=P_j^*$, $P_j^2=P_j$, and $P_1+P_2=I_r$. The paper's KYP condition is $\begin{bmatrix}A+A^*&C^*-B\\C-B^*&D+D^*\end{bmatrix}\geq0$, where $X^*$ denotes conjugate transpose and $X\geq0$ means positive semidefinite. Under this condition, $H$ has nonnegative Hermitian part on the bihalfplane: $\operatorname{Re}H(\zeta):=(H(\zeta)+H(\zeta)^*)/2\geq0$. For real neural tensors use real matrices and evaluate only $\zeta_j\geq\epsilon>0$. The adapted layer is $y=(I_d+\eta H(\zeta(x)))^{-1}x$ with $\eta>0$; accretivity implies the resolvent bound $\|(I_d+\eta H(\zeta))^{-1}\|_2\leq1$, giving a direct stability target.
Implementation notes
Integrate this at the token-mixing or FFN-residual point of a small Transformer or sequence model. Let $x\in\mathbb{R}^d$ be one token vector, let $q(x)$ be either $x$ or a cheap pooled context vector, and compute two strictly positive scalar coordinates $z_j=\epsilon+\operatorname{softplus}(w_j^\top q)$. Use a shared state size $r\ll d$ across all tokens. Initialize $P_1$ as a diagonal projection onto the first $r/2$ state coordinates and set $P_2=I_r-P_1$; optionally replace these by $P_1=Q\operatorname{diag}(1_{r/2},0)Q^\top$ and $P_2=I-P_1$, with $Q$ parameterized by a Cayley transform. For each token, form $M=A+z_1P_1+z_2P_2$, solve $MU=B x$, and compute $h(x)=D x+C U$. Then solve $(I_d+\eta H)x'=x$ for the output $x'$, using a Cholesky solve when the symmetric part is explicitly symmetrized, or a stable LU solve otherwise; add a standard gated projection around this block if dimensionality changes. During training enforce the paper's KYP certificate by forming $K=\begin{bmatrix}A+A^\top&C^\top-B\\C-B^\top&D+D^\top\end{bmatrix}$ and adding $\lambda\sum_i\operatorname{softplus}(\delta-\lambda_i(K))^2$ to the loss, where $\lambda_i(K)$ are eigenvalues and $\delta>0$ is a desired margin. A stronger variant projects $K$ onto the PSD cone after every optimizer step and reconstructs the block variables. The paper's mathematical computation is the rational realization and KYP constraint; $z_j$, the KYP margin, and $\eta$ are learned or tuned. First test on CIFAR-10 with a 6-layer width-128 Transformer and on the Adding or Copying synthetic long-range sequence task, comparing against a standard FFN/token mixer with equal parameter count. Measure loss versus optimizer steps, maximum activation norm, gradient norm, failed linear solves, and validation accuracy. Success is a substantially lower tail of activation and gradient norms with no loss of accuracy, or faster loss descent at equal FLOPs; also report the overhead from the $r\times r$ solve and test whether $r=16$ matches a much larger unconstrained mixer.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.