Unverified
2026
Insert a piecewise Möbius transformation as a deterministic latent mixing layer, using the paper's exact branch structure rather than a generic unconstrained MLP. The transformation repeatedly moves points between branches while preserving a known reference density, creating a cheap chaotic mixer with analytically computable Jacobian factors. Use a truncated, normalized version in practice so that the sigma-finite invariant measure becomes a valid finite training distribution.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Split the trainable state into an explicit scalar scale coordinate and a residual perturbation, then update them with separate time scales. Penalize residuals according to their distance from the scale-dependent core, so the optimizer cannot obtain apparent progress by destabilizing the scale mode. The method is a neural optimization analogue of the paper's modulation argument, not a direct consequence of the geometric singularity theorem.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a two-mode residual mixer whose mode is selected by a delayed sign variable rather than an instantaneous sign or sigmoid. The delayed mode creates a hysteresis-like effect that prevents high-frequency switching when the latent state is close to the decision surface, while the paper's reduced equations provide a constraint for choosing the delay and mixing strength so the latent energy contracts.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's topology-dependent Laplacian spectral bound to set the diffusion horizon of a graph neural network instead of using a fixed number of message-passing steps for every graph. For genus-g graphs, choose the horizon from the conservative slow-mode timescale n/(Delta g), while separately capping the step size to keep high-frequency modes stable.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Estimate how strongly each neural block contracts distinguishability and use the paper's weighted composition inequality to allocate depth, residual strength, or precision where information is actually preserved. Blocks that strongly contract information beyond the reference path receive a smaller residual gate, higher numerical precision, or are replaced by a cheaper identity-like operation.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's skew product as a parameter-free recurrent state: one phase rotates by an irrational increment and a second state accumulates a lacunary Fourier readout of that phase. This supplies deterministic long-range memory with only scalar updates, avoiding a learned recurrent transition matrix and its potentially unstable spectrum.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Treat repeated residual blocks as an infinite directed transition system, damp transitions according to their depth, and regularize a finite part of the resulting Fredholm log-determinant. Subtracting a dilogarithmic counterterm prevents the regularizer from being dominated by infinitely repeated short cycles, while retaining information about global recurrent amplification.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Represent a population of N circular latent states using a three-parameter Möbius transformation applied to fixed uniform reference phases, rather than learning N unrelated angles. The resulting states remain on the circle by construction and can model concentrated or nearly uniform phase populations through a single concentration parameter.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a spectral regularizer to a linear state-space or recurrent layer that controls the overlap between its controllable and observable state directions. The regularizer uses the paper's identity to monitor eigenvalues of (I+PQ)^{-1}, equivalently the squared canonical correlations between reachable and observable subspaces, and penalizes degenerate or overly concentrated spectra.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a generic MoE router entropy bonus with a branching-pressure objective that values routes according to both their stochastic entropy and their number of valid fine-grained continuations. The module can be implemented as a hierarchical router: a coarse state chooses a base transition, while a validity mask determines how many valid expert or latent branches lift that transition.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize learned low-dimensional embeddings or MoE prototypes with an aggregation-diffusion energy. The attractive term encourages compact, semantically coherent groups, while porous-medium diffusion creates density-dependent pressure that prevents points from collapsing into singular clusters.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independently sampled random-walk paths used for GNN neighbor or subgraph sampling by persistent rotor walks on the training graph. Each node stores a pointer into a fixed cyclic ordering of its outgoing neighbors; every visit advances the pointer and selects the next neighbor, producing deterministic coverage with no repeated random choices. Use several short rotor trajectories per seed and periodically reinitialize only the rotors in an encountered subgraph.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add a mean-field stochastic binary recurrent layer with an explicit susceptibility controller. The layer estimates the response statistic \(\chi=\beta^2N^{-1}\sum_i\operatorname{sech}^4(u_i)\) and either penalizes or clips it below \(1-\delta\), preventing the high-gain regime in which replicas with identical weights develop strongly divergent states. The expected benefit is more stable long-horizon recurrence and lower variance across stochastic forward passes.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the hysteresis threshold as a regularizer for attractor diversity. Estimate how many initial states converge to each fixed point and select thresholds that maximize basin entropy or penalize domination by one attractor, reducing attractor collapse in discrete recurrent classifiers and memory modules.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Split a recurrent state into two blocks and initialize their variances and cross-correlation according to the stationary projective energy distribution induced by the transition. This places the initial hidden state near the typical invariant direction of the dynamics instead of forcing a long transient from zero or isotropic noise.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the complex-conjugate palindromic coefficient that cancels the leading temporal phase defect of oscillatory modes. Implement complex arithmetic directly or use an exactly equivalent doubled-real state, then project the final state to its real component for real-valued prediction tasks.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the graph Laplacian spectrum to set the mixing and correction coefficients of a two-state graph-propagation block. Balancing the contraction of low-frequency consensus modes against high-frequency disagreement modes may reduce oversmoothing and make deep graph-neural networks less sensitive to manually selected residual coefficients.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace an unconstrained linear residual adapter by an operator \(T\) satisfying a polynomial relation in the commutator operator \(\Delta_A(X)=AX-XA\). Choose the polynomial roots in a stable half-plane so that repeated commutators become nilpotent, making repeated adapter application terminate algebraically and permitting a finite-polynomial inverse of \(I+T\).
Useful4/10
Difficulty6/10
Novelty9/10
Unverified
2026
Add a fixed or weakly learned interface-localized branch to a sequence model. Set the critical mass term to zero and make the transport coefficient change sign across a learnable interface, producing a localized mode that pools information near a detected transition rather than averaging uniformly over the sequence.
Useful4/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent selected hidden features as z = sqrt(N) exp(i theta), with a persistent phase and an explicitly stochastic amplitude. Regularize the ratio between coherent power |E[z]|^2 and total power E[|z|^2] toward the condensate prediction pi/4, while optionally matching higher amplitude moments.
Useful4/10
Difficulty5/10
Novelty8/10
Unverified
2026
Augment spatial training examples by replacing a compact active region with several separated components while preserving its exact value histogram, total active area, and amplitude. The augmentation probes the nonlinear interaction between diffusion-like receptive fields and threshold activations, which the paper shows can make fragmented and compact inputs evolve in opposite directions despite identical distributions.
Useful4/10
Difficulty4/10
Novelty7/10
Unverified
2026
Represent the active experts or channels of a sparse layer by a presence set and impose a reaction-style dependency graph on possible support changes. During a growth phase, activate only the least support set closed under enabled dependencies; during later pruning, allow trajectory-dependent removals but never add structurally unreachable experts. This should reduce routing churn and dead experts while preserving adaptive sparsity.
Useful4/10
Difficulty5/10
Novelty7/10