✗ Mechanism failed
2026
Cluster recurrent modules or MoE experts by the geometry of their observed finite-horizon input-output behaviors rather than by parameter distance. Train one shared optimizer/controller or low-rank adapter per cluster while retaining module-specific parameters and routing. This should reduce control and optimizer overhead without merging modules whose temporal responses are dynamically incompatible.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a fixed first-order parameter update by a finite-horizon controlled local model for each important curvature mode of the network. The optimizer computes the Hamiltonian flow and its Riccati feedback gain; if the chosen horizon approaches a conjugate point, it shortens the horizon or increases control cost before the gain becomes singular. This converts the paper's finite-time transition into a measurable trust-region and scheduling mechanism for neural training.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Treat local neural-network training as a driven linear system and periodically modulate the learning rate by a small sinusoid. Estimate the transfer function from this modulation to loss or gradient observables, fit its relaxation poles, and set the learning rate below the measured instability boundary.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Approximate the minibatch loss Hessian by a positive-semidefinite bulk curvature plus a small signed transverse correction, and treat only the correction with explicit negative-curvature steps. This imports the paper's observation that all unstable directions can be confined to a low-dimensional subspace, producing a curvature-aware optimizer whose step-size boundary is governed by a small matrix rather than the full Hessian.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Use the behavior-subspace gap as a trust-region constraint when applying a shared update to multiple recurrent modules or experts. A proposed common update is accepted only when post-update behavior subspaces remain close to their leader and their graph subspaces remain sufficiently transverse, preventing one shared optimizer step from destabilizing dynamically different members.
Useful7/10
Difficulty6/10
Novelty9/10
✗ Mechanism failed
2026
Replace Euclidean or unprojected covariance averaging with a projected Bures-Wasserstein barycenter layer. Each unit-step barycenter update is followed by eigenvalue clipping into \([\alpha,\beta]\), preserving positive definiteness and preventing ill-conditioning without an additional eigendecomposition.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a dense random projection used before retrieval, classification, or expert routing with a publicly reproducible matrix generated by a Pisot beta-transformation orbit. Search over a small public seed and sampling gap to select one matrix that preserves the calibration set's pairwise distances, then freeze it for training and inference. The projection removes random-matrix storage and makes the same embedding transform exactly reproducible across servers or proof systems.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a small encoder and latent Koopman predictor to forecast whether a neural sequence model will enter a high-error or high-instability region, then execute an expensive refinement block only when the forecasted risk exceeds a threshold. The base model remains active at every step, so the learned preview model controls computation rather than directly replacing the main predictor. Add a bounded-rate interpolation when the gate switches off, preventing abrupt changes in recurrent state or…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace constant friction in a second-order neural-network optimizer by a scalar damping coefficient that grows as a power of the current parameter energy plus velocity energy. This should selectively damp large oscillations and unstable excursions while preserving lower friction during small, potentially useful movements.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace a large diagonalizable recurrent or state-space transition operator by a sparse set of retained oscillatory modes selected according to their contribution to the output autocorrelation. Unlike magnitude-based pruning, the objective is to preserve the power-law return signal generated by pairwise spectral differences, enabling long memory with far fewer modes.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace dense self-attention by a sparse mask on a one-dimensional or ordered token geometry, retaining local neighbors and adding long-range edges with probability proportional to distance raised to \(-(1+\sigma)\). Use \(\sigma\approx0.8\text{--}0.85\) as the initial regime because the paper finds that this range supports delocalized, GOE-like connectivity despite sparse bonds. The resulting layer has linear or near-linear attention cost while maintaining long-range paths.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Use Adam normally, but periodically estimate the spectrum of the Adam-preconditioned Hessian and add a damped low-rank Newton correction when the preconditioned curvature is strongly ill-conditioned or the gradient is concentrated in flat directions. The correction is computed only in a small Lanczos subspace, so the method targets cross-coupled ill-conditioning without materializing or inverting the full Hessian.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace an unpreconditioned conjugate-gradient solve for a damped Gauss–Newton step with a two-level algebraic preconditioner derived from local Jacobian-row supports. Use overlapping local parameter blocks as Schwarz subdomains and a coarse basis containing low-energy local modes, so the optimizer can correct both localized and globally coupled parameter errors.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Choose the consensus gain and gradient-tracking gain in decentralized training from the communication Laplacian spectrum rather than tuning them independently. The gains minimize the worst asymptotic pole radius for the paper's exact quadratic model, providing a principled initialization and a conservative stability safeguard for neural-network optimization.
Useful6/10
Difficulty6/10
Novelty6/10