{
 "artifacts": null,
 "category": "dynamics",
 "description": "Replace an unconstrained recurrent or state-space transition with a complex-orthogonal flow generated by a skew-transpose matrix. The transition preserves a bilinear quadratic quantity exactly, preventing repeated application across long sequences from causing norm explosion or decay in the linear dynamics.",
 "formulas_latex": [
  "$$W_z=e^{zK},\\qquad z\\in\\mathbb{C}.$$",
  "$$W_z^T W_z=I_d,\\qquad K^T=-K.$$",
  "$$u(z)^T u(z)=u(0)^T u(0),\\qquad u(z)=W_z u(0).$$",
  "$$K=A B^T-B A^T,\\qquad C_\\tau(K)=\\left(I_d-\\frac{\\tau}{2}K\\right)^{-1}\\left(I_d+\\frac{\\tau}{2}K\\right).$$"
 ],
 "id": 1664,
 "implementation": "Integrate the construction at the hidden-state transition of an RNN or state-space model. Maintain trainable complex matrices A and B with shapes d by r, construct K=A transpose(B)-B transpose(A), and apply either an exact exponential for small hidden size or a Cayley step for larger models. Pseudocode is: K = A @ transpose(B) - B @ transpose(A); M_left = I - tau*K/2; M_right = I + tau*K/2; h_linear = solve(M_left, M_right @ h); h_next = h_linear + alpha*tanh(V @ h_linear + c). Initialize alpha near zero so training starts from the stable linear flow. In ordinary real-valued PyTorch or JAX, store real and imaginary parts separately. Convert K=K_r+iK_i into the real block matrix [[K_r,-K_i],[K_i,K_r]], concatenate the real and imaginary parts of h, and use a batched linear solve. The skew condition is guaranteed algebraically by the parameterization; numerical preservation should be measured by the relative drift in h^T h after one step and after a long rollout. Also estimate the largest singular value of the implemented transition empirically. First run a cheap comparison on sequential MNIST and permuted sequential MNIST using equal hidden width: vanilla RNN, GRU, unconstrained linear state-space transition, and the proposed Cayley flow. Track validation accuracy, loss at equal FLOPs, hidden-state norm over 1,000 steps, gradient norms, and wall-clock time. Success is stable long-horizon gradients with no systematic hidden-state growth or decay, plus accuracy matching or exceeding the vanilla RNN; a secondary success criterion is lower memory than an ODE solver while retaining comparable sequence accuracy.",
 "math_summary": "The paper defines the entire one-parameter group W_z=e^{zK}, where z is complex time and K is a complex d by d generator. Complex orthogonality means W_z^T W_z=I_d, where T is transpose without complex conjugation. Differentiating this identity at z=0 gives K^T=-K. Therefore, for u(z)=W_z u(0), the bilinear energy u(z)^T u(z) equals u(0)^T u(0). A trainable low-rank skew generator can be parameterized as K=A B^T-B A^T, with A and B in C^{d by r}. For cheaper discretization, use the Cayley transform C_tau(K)=(I_d-tau K/2)^{-1}(I_d+tau K/2). If K^T=-K and the inverse exists, then C_tau(K)^T C_tau(K)=I_d, so each discrete transition preserves the same bilinear form. A real implementation represents a complex vector u=a+i b by the real vector [a;b] and represents K=K_r+iK_i by the real block matrix [[K_r,-K_i],[K_i,K_r]].",
 "math_tags": [
  "linear-algebra",
  "dynamical-systems",
  "geometry",
  "complex-analysis"
 ],
 "ml_areas": [
  "rnn",
  "ssm",
  "training-dynamics"
 ],
 "paper": {
  "arxiv_id": "2608.01253",
  "arxiv_url": "https://arxiv.org/abs/2608.01253",
  "summary_what_math_gives_to_ml": "The paper constructs an entire complex-time flow W_z=e^{zK} whose generator preserves a bilinear form, with complex orthogonality replacing ordinary unitary evolution. This structure transfers to recurrent and state-space neural networks as an exactly norm-preserving transition, preventing hidden-state explosion or decay across long sequences. The most practical implementation is a low-rank skew-transpose generator combined with a Cayley step, which avoids computing a matrix exponential while retaining the preservation guarantee. The supplied mathematics does not include enough detail to transfer the Markov-chain parity decoding, so the orthogonal-flow construction is the strongest concrete idea.",
  "title": "The pseudo-quantum representation of finite reversible Markov chains",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 5,
  "usefulness": 5
 },
 "solves": [
  "stability",
  "memory",
  "generalization"
 ],
 "title": "Entire Bilinear-Orthogonal Neural Flow",
 "url": "https://synthcore.org/idea/1664/entire-bilinear-orthogonal-neural-flow",
 "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
   }
  }
 }
}