{
 "artifacts": null,
 "category": "dynamics",
 "description": "Use the paper's multiplicative spectral law to initialize a recurrent or state-space transition matrix as a deterministic operator multiplied by a unitarily invariant random factor, then choose the factor scale so the predicted complex eigenvalue support lies near a target stability annulus. This directly targets long-horizon gradient preservation instead of relying only on singular-value normalization.",
 "formulas_latex": [
  "$$F_{\\mathbf{A}}(r)=\\rho_{\\mathbf{A}}\\big(\\{z\\in\\mathbb{C}:|z|\\le r\\}\\big)$$",
  "$$S_{\\mathbf{A}\\mathbf{A}^{*}}\\big(F_{\\mathbf{A}}(r)-1\\big)=\\frac{1}{r^{2}}$$",
  "$$S_{(\\mathbf{A}\\mathbf{B})(\\mathbf{A}\\mathbf{B})^{*}}(z)\\approx S_{\\mathbf{A}\\mathbf{A}^{*}}(z)S_{\\mathbf{B}\\mathbf{B}^{*}}(z)$$",
  "$$\\widehat{S}(z)=\\frac{1+z}{z}\\,\\widehat{M}^{-1}(z),\\qquad \\widehat{M}(x)=\\sum_{k=1}^{K}\\widehat{m}_{k}x^{k},\\qquad \\widehat{m}_{k}=\\frac{1}{N}\\operatorname{tr}\\!\\left[(JJ^{*})^{k}\\right]$$"
 ],
 "id": 3141,
 "implementation": "Integrate this at initialization and as an optional diagnostic for the recurrent matrix in an RNN, S4-like state-space model, or linear residual block. Factor the transition as J=A B, where A is the task-specific deterministic matrix or a learned diagonal/low-rank operator and B=U diag(s) V^T with U and V sampled as Haar-orthogonal matrices generated by QR decomposition of Gaussian matrices; include a scalar alpha multiplying B. For a calibration width, use K=6 to 10 and estimate m_k=(1/N)tr[(JJ^T)^k] with Hutchinson probes. For each random Rademacher vector v, set q_0=v and repeatedly apply q_{j+1}=JJ^Tq_j; estimate m_k by the average of v^Tq_k over probes. Fit the truncated moment polynomial M(x), numerically invert M on z in [-1,0], and solve S(F(r)-1)=1/r^2 over a radius grid. Use one-dimensional bisection on alpha so the predicted outer radius r_out is 0.95 to 0.99 for a plain RNN, or 1+epsilon for a residual or discretized state-space transition. Optionally require a predicted inner radius above 0.2 to avoid rapid mode collapse. The paper-derived quantities are the radial law and S-transform relation; moment truncation, Hutchinson estimation, and bisection are engineering approximations. Since finite-width and non-normal effects can invalidate the asymptotic proxy, also estimate the actual spectral radius with Arnoldi and the largest singular value with power iteration; if prediction error exceeds 10%, use empirical rescaling. First test a width-256 tanh RNN on copy-memory and sequential-MNIST, comparing standard orthogonal initialization, scaled Gaussian initialization, and the proposed initialization at equal parameter count. Measure gradient-norm variance versus sequence length, final accuracy, loss descent at equal FLOPs, and the actual eigenvalue cloud. Success is longer copy-memory retention and lower gradient variance without an increased largest Jacobian eigenvalue.",
 "math_summary": "For a bi-invariant matrix A, the paper defines the radial cumulative eigenvalue distribution F_A(r)=rho_A({z in C: |z| \u003c= r}) and states the Haagerup–Larsen relation S_{AA^*}(F_A(r)-1)=1/r^2, where rho_A is the limiting eigenvalue measure and S_{AA^*} is the scalar S-transform of the limiting eigenvalue distribution of the positive matrix AA^*. For free bi-invariant factors, the squared-singular-value S-transform of a product is the product of the factor S-transforms, so S_{(AB)(AB)^*}(z) is approximated by S_{AA^*}(z)S_{BB^*}(z). The adaptation treats a recurrent Jacobian J=AB as a large-width proxy for this law. Estimate squared-singular-value moments m_k=(1/N)tr((JJ^*)^k), form M(x)=sum_{k=1}^K m_k x^k, and define the truncated S-transform by S(z)=(1+z)M^{-1}(z)/z, where M^{-1} is the local functional inverse. Here A is the deterministic transition operator, B is a random rotationally invariant factor, J is their product, r is eigenvalue radius, and F(r) is the fraction of eigenvalues inside radius r. Select a scale alpha for B so the predicted outer radius is close to one and the predicted inner radius is not near zero.",
 "math_tags": [
  "random-matrix",
  "spectral-theory",
  "probability",
  "linear-algebra"
 ],
 "ml_areas": [
  "rnn",
  "ssm",
  "initialization",
  "training-dynamics"
 ],
 "paper": {
  "arxiv_id": "2609.03618",
  "arxiv_url": "https://arxiv.org/abs/2609.03618",
  "summary_what_math_gives_to_ml": "The paper provides asymptotic spectral control for products of a deterministic matrix with a rotationally invariant non-Hermitian random matrix, a setting relevant to recurrent transition maps, state-space models, and deep linear Jacobians. Its transferable asset is a relation between the complex eigenvalue support of a product and the S-transforms of the squared-singular-value distributions of its factors. A practical use is to initialize or rescale recurrent operators so that their predicted eigenvalue cloud lies in a target stability annulus, directly targeting long-horizon dynamics rather than only singular-value normalization. The result is most credible as an initialization and diagnostic proxy when widths are large and one factor is approximately rotationally invariant.",
  "title": "Spectral properties of deterministic matrices multiplied by rotationally invariant random non-Hermitian ensembles",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 6,
  "novelty": 6,
  "usefulness": 6
 },
 "solves": [
  "stability",
  "accuracy",
  "sample-efficiency"
 ],
 "title": "Brown-measure stability initialization",
 "url": "https://synthcore.org/idea/3141/brown-measure-stability-initialization",
 "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
   }
  }
 }
}