Unverified
2026
Build a two-dimensional local metric from the neural-network loss along a pair of controlled parameter directions, such as the optimizer velocity and a stochastic-gradient fluctuation direction. Compute both scalar curvature R and curvature density mathcal R = sqrt(|g|) R, then use their different peaks or scaling laws to detect sharp optimization transitions and trigger learning-rate or regularization changes.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace independent softmax expert choices with a collision-free Markov router whose particles occupy expert positions on a one-dimensional or circular index lattice. A particle can move only to an empty neighboring expert, and the move rate contains a product of sine ratios that globally repels nearby assignments; this should reduce expert collapse and produce more evenly spread routing without requiring a separate pairwise diversity loss.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Insert a short gKdV-inspired spectral flow between neural blocks to regularize rough feature maps without using an isotropic low-pass filter. The module applies a Fourier dispersive phase and derivative-coupled polynomial residual updates, with an optional finite factorial dilation penalty to encourage analytic-looking features.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a continuous-time neural dynamics module from scalar potential networks and their iterated Lie brackets instead of directly predicting an unrestricted vector field. Gradient primitives provide structured vector fields, while commutators add non-conservative and rotational directions; the paper proves that finite spans of such objects generate every smooth vector field on the stated compact manifold.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent each token or graph node by an anti-Hermitian matrix latent state and replace a standard residual transformation with a discretized Lie-algebra vortex flow. The commutator nonlinearities are equivariant under global unitary conjugation, so the block can learn interactions without selecting a basis and preserves the anti-Hermitian state space when initialized there.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an empirically chosen momentum or learning-rate modulation by a forcing amplitude calibrated to the homoclinic energy balance of a reduced optimizer mode. The controller deliberately operates below the separatrix-crossing threshold when stable refinement is desired, or slightly above it when the optimizer must escape a basin. This creates a falsifiable transition prediction rather than merely adding noise or tuning a schedule.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's marginally irrelevant RG flow to schedule communication between two neural feature streams. A fast stream, such as transformer attention, can interact with a slower or more persistent stream, such as an SSM or low-frequency convolutional branch, through a gate that decreases like \(1/(1+a y_0 \ell)\) instead of remaining fixed across depth or training time. A learnable initial amplitude preserves adaptability while the inverse-logarithmic envelope suppresses harmful long-range…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Train Fourier or state-space neural models by eliminating well-conditioned spectral modes first and retaining near-resonant modes until a later stage. The schedule is determined by the small-divisor geometry of a reference transport vector, with a cumulative Brjuno-like budget controlling how aggressively spectral corrections may be applied. This should prevent rare nearly resonant modes from producing disproportionately large gradients or unstable long-horizon rollouts.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a Christoffel word as a periodic binary gate for an expensive training operation: activate the operation exactly r times in every N-step period, but distribute those activations as uniformly as possible rather than in blocks or independent Bernoulli trials. Candidate operations include SAM perturbation steps, Hessian-vector preconditioning, gradient clipping, EMA teacher refreshes, or an auxiliary MoE expert. The intended benefit is lower burst-induced gradient variance at the same average…
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Treat the maximum dependency distance faithfully modeled by a finite neural architecture as an emergent correlation length, and estimate how it grows with depth, state size, or attention span. Fit the exponent \(\kappa\) and use it as an architecture-selection signal: a model with larger \(\kappa\) should acquire long-range competence more efficiently at equal parameter or FLOP budget.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Treat each recurrent update or inference block as a time-dependent map F_n and regularize it toward a limiting autonomous map F whose long-horizon dynamics are easier to analyze. In addition to penalizing one-step map differences, impose a quotient-consistency loss so that pairs of hidden states that are asymptotically indistinguishable under F remain indistinguishable under every time-dependent generator F_n.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained residual block by a four-field feature dynamics containing a primary feature T, flux-like auxiliary features J, curl-cleaning features psi, and a scalar cleaning feature phi. Couple these fields with learned skew-adjoint spatial operators so that the reversible block preserves the squared feature norm, while a separately controlled relaxation term can remove high-frequency or constraint-violating components. Use an exact Cayley update rather than explicit Euler to…
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the paper's effective operator 𝒢 = (I + K⁻¹L)⁻¹ as a learned, geometry-aware preconditioner for momentum or latent-state updates. The coupling matrix L changes the response of momentum variables without changing coordinate components, providing a controlled mechanism for mixing fast and slow latent channels.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Build a neural stochastic layer in which each particle's drift and diffusion are selected from a convex set depending on the current particle distribution. Instead of committing to one learned vector field, the layer chooses a task-useful admissible coefficient using differentiable simplex weights, providing controlled stochastic diversity and distribution-aware dynamics.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace part of a sequence or spatiotemporal model's unconstrained recurrence with a bank of stable second-order filters whose poles are a frequency-shifted precession pole and a diffusion pole. The chemical-potential parameter produces oscillatory memory, while the diffusion parameter produces scale-dependent decay; a learned residual branch preserves expressivity when the prior is imperfect.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an eigendecomposition-based spectral controller in a small recurrent or state-space transition layer with explicit polynomial projectors. Each hidden state is split into invariant modes, and each mode receives a separately constrained recurrent multiplier, enabling direct suppression of unstable modes or selective retention of long-memory modes using only matrix-polynomial evaluations.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Introduce an auxiliary matrix-valued optimizer state whose update is a Lie–Poisson flow discretized by similarity transforms rather than additive Euler steps. Because similarity transforms preserve $\operatorname{tr}(Z^k)$ and the full eigenvalue multiset, long training runs avoid spectral drift in the optimizer state; the state can then generate a preconditioned update for ordinary neural-network parameters.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained simplex router or differentiable mixture layer with a resource-cost-aware router whose learned costs satisfy the paper's monotonicity curvature condition. Use a Euclidean-regularized Frank–Wolfe oracle to update routing probabilities, which should reduce cycling and sensitivity when several examples or agents compete for the same experts.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a deterministic latent transition with a set-valued relation consisting of all next states within a learned tolerance of the predicted transition, and train the model so noisy or approximate latent rollouts are shadowed by valid exact trajectories. Use forward and inverse-limit consistency losses to make the same robustness property visible in finite sequence windows.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an ordinary graph diffusion or message-passing operator with a positive-semidefinite Laplacian whose kernel contains a prescribed node-wise subspace. The layer smooths only feature components orthogonal to that subspace, preserving global constants, positional modes, or other structural signals even when graph edges are dynamically added or removed.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace purely deterministic training trajectories with an optimizer that periodically resets parameters to a reference checkpoint at iid random renewal times. Use the renewal equation to compare how different reset-time distributions trade off uninterrupted progress against recovery from poor regions, and trigger resets when the observed loss trajectory matches the predicted low-progress regime.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a parametric neural dynamical model by matching randomized Fourier features of observed and simulated trajectory windows, using k=2p+1 features when the model has p trainable dynamic parameters. The random projections compress long noisy trajectories into a small identification signal while retaining nonlinear dependence on all lags, potentially making model calibration less sensitive to correlated, non-Gaussian, or state-dependent observation noise.
Useful5/10
Difficulty3/10
Novelty4/10
Unverified
2026
Use a two-gradient predictor-corrector average as the gradient supplied to Adam, retaining trajectory smoothing while avoiding the three or four gradient evaluations required by full RK3. Vary the mixing coefficient to test whether the reported regularization comes from gradient averaging itself rather than from high-order integration.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use a CFL-like step-size controller for neural simulators or neural ODE rollouts, shrinking the integration step when the predicted state changes rapidly and relaxing it when dynamics are smooth. The controller uses the smallest spatial resolution and maximum predicted velocity, rather than a fixed global step chosen for the worst case.
Useful5/10
Difficulty3/10
Novelty4/10