{
 "artifacts": null,
 "category": "architecture",
 "description": "Replace an unconstrained recurrent or residual transition with a block-structured contractive realization whose input-dependent multiplier is a direct sum of bounded branches. The resulting layer has a built-in non-expansive energy bound on the chosen normalized input domain, while still allowing different branches to respond to different coordinates or feature groups.",
 "formulas_latex": [
  "$$X(z)=\\begin{bmatrix}\\rho_{1}(E(z))\u00260\u00260\\\\0\u0026\\rho_{2}(e(z))\u00260\\\\0\u00260\u0026z^{(3)}I_{\\mathcal H_{3}}\\end{bmatrix}.$$",
  "$$\\left\\langle\\begin{bmatrix}1\\\\X(z)\\begin{bmatrix}L_{1}(z)1\\\\L_{2}(z)1\\\\g(z)\\end{bmatrix}\\end{bmatrix},\\begin{bmatrix}1\\\\X(w)\\begin{bmatrix}L_{1}(w)1\\\\L_{2}(w)1\\\\g(w)\\end{bmatrix}\\end{bmatrix}\\right\\rangle=f(z)\\overline{f(w)}+\\left\\langle\\begin{bmatrix}L_{1}(z)1\\\\L_{2}(z)1\\\\g(z)\\end{bmatrix},\\begin{bmatrix}L_{1}(w)1\\\\L_{2}(w)1\\\\g(w)\\end{bmatrix}\\right\\rangle.$$",
  "$$V\\begin{bmatrix}1\\\\X(z)\\begin{bmatrix}L_{1}(z)1\\\\L_{2}(z)1\\\\g(z)\\end{bmatrix}\\end{bmatrix}=\\begin{bmatrix}f(z)\\\\\\begin{bmatrix}L_{1}(z)1\\\\L_{2}(z)1\\\\g(z)\\end{bmatrix}\\end{bmatrix}.$$",
  "$$\\widetilde f(x)=A+B X(x)(I-DX(x))^{-1}C,\\qquad X(x)=\\operatorname{diag}(\\alpha_1(x)I_{d_1},\\alpha_2(x)I_{d_2},\\alpha_3(x)I_{d_3}),\\quad |\\alpha_j(x)|\\le r\u003c1.$$"
 ],
 "id": 1646,
 "implementation": "Integrate this at the transition map of a small GRU-like sequence model or at the residual branch of a Transformer. First normalize each input feature group x^(j) to [-1,1], compute three bounded scalar gates alpha_j(x)=tanh(w_j^T x+b_j), and form the block-diagonal X(x)=diag(alpha_1 I, alpha_2 I, alpha_3 I). Parameterize the colligation U=[[A,B],[C,D]] as a spectral-normalized matrix with ||U||_2\u003c=1; enforce this by dividing U by max(1,sigma_max(U)) after every optimizer step, or by using two power iterations to estimate sigma_max. Evaluate y=Aq+Bp, where p=X(x)h and q=(I-DX(x))^{-1}Ch. Compute the inverse with 3-8 fixed-point iterations q_{k+1}=Ch+DX(x)q_k, which is stable when ||DX(x)||\u003c1; alternatively solve directly for small hidden dimension. Use the layer as h_{t+1}=h_t+gamma y with gamma in [0,1], or replace the usual recurrent transition entirely. The paper's mathematics supplies the block contraction and Gram-kernel identity; the feature maps, dimensions, and colligation are learned. During training, sample pairs x_i,x_j and optionally add L_kernel=|\u003c [1;X_i v_i],[1;X_j v_j]\u003e-f_i\\overline{f_j}-\u003cv_i,v_j\u003e|^2, with v_i learned intermediate features, but begin without this auxiliary loss. The first experiment should compare a 2-layer 128-unit vanilla RNN, spectrally normalized RNN, and this realization layer on sequential MNIST or copy-memory at equal parameter count. Measure exploding-gradient frequency, maximum hidden-state norm, validation accuracy, and loss under long sequences and distribution-shifted input scales. Success is lower gradient variance and no hidden-state blow-up at comparable accuracy, or longer stable sequence lengths at equal FLOPs.",
 "math_summary": "The paper uses an auxiliary feature vector v(z) and a block-diagonal operator X(z)=diag(\\rho_1(E(z)),\\rho_2(e(z)),z^{(3)}I_{\\mathcal H_3}), where E(z) and e(z) are structured coordinate maps, \\rho_1 and \\rho_2 are operator representations, and I_{\\mathcal H_3} is the identity on the third Hilbert-space block. Its realization proof is based on the kernel identity \\langle [1;X(z)v(z)],[1;X(w)v(w)]\\rangle=f(z)\\overline{f(w)}+\\langle v(z),v(w)\\rangle. Equality of these Gram matrices makes the map V well-defined and isometric on the span of the vectors [1;X(z)v(z)], sending each to [f(z);v(z)]. For a neural adaptation, use a finite-dimensional contraction X(x), an isometric or contractive colligation U=[[A,B],[C,D]], and the adapted transfer map f(x)=A+B X(x)(I-DX(x))^{-1}C. If ||X(x)||_2\u003c=r\u003c1 and ||U||_2\u003c=1, the inverse exists through the Neumann series and the transfer is bounded; the explicit kernel identity is used as a training diagnostic or regularizer.",
 "math_tags": [
  "functional-analysis",
  "linear-algebra",
  "geometry"
 ],
 "ml_areas": [
  "rnn",
  "ssm",
  "training-dynamics"
 ],
 "paper": {
  "arxiv_id": "2608.00819",
  "arxiv_url": "https://arxiv.org/abs/2608.00819",
  "summary_what_math_gives_to_ml": "The paper develops a Schur-Agler realization for the hexablock: bounded holomorphic functions are represented through a block-diagonal contractive multiplier and an auxiliary Hilbert-space feature map. The key transferable asset is the positive-kernel identity together with the resulting lurking-isometry construction, which gives a principled way to make a multivariate neural module contractive on a prescribed structured domain. A practical adaptation is a gated recurrent or feed-forward layer whose input-dependent operator is block diagonal and whose output is generated by a contractive colligation, rather than by unconstrained dense weights. This is most promising for stable sequence models and bounded-control policies, where preventing amplification matters more than maximizing raw expressivity.",
  "title": "Function theory of the hexablock and applications to the tetrablock and Euclidean biball",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 5,
  "usefulness": 6
 },
 "solves": [
  "stability",
  "generalization"
 ],
 "title": "Schur-Agler contractive gated layer",
 "url": "https://synthcore.org/idea/1646/schur-agler-contractive-gated-layer",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}