Running benchmark…
2026
Replace a deterministic graph propagation layer by a stable stochastic linearized latent dynamics whose frequency-resolved covariance matrix defines spectral bands. Train or initialize the graph operator so that a selected covariance band has a nonzero Chern number and remains separated by a measurable spectral gap, producing representations that are robust to local perturbations and can support boundary-localized responses.
Useful7/10
Difficulty7/10
Novelty8/10
Running benchmark…
2026
Attach a learned controller to a physical or simulated plant and use a continuous safety certificate to compute a conservative remaining-time budget before the current action or latent prediction can become unsafe. Compile this spatial margin into a unit-rate temporal contract, allowing asynchronous inference, batching, or early execution without online rollout integration; trigger a new network evaluation only when the countdown reaches a guard threshold.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace uniformly spaced diffusion or energy annealing schedules by a finite sequence of quench-relax stages whose intermediary distributions are approximately equally spaced in Fisher-Rao distance. Each stage abruptly changes the model energy or noise level and then runs a short relaxation phase; the schedule concentrates stages where the distribution changes most sharply. This should reduce nonequilibrium mismatch at a fixed number of sampler evaluations and avoid large distributional jumps…
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train two parameter replicas with symmetric coupling, treating one replica as a prepared thermalization packet for the other. Estimate the slow local Hessian direction and initialize or periodically reset the packet so that the coupled state has zero projection onto that mode; the target should then relax according to the next-slowest mode rather than the original bottleneck.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Constrain a set of learnable or batch-produced unit-norm embeddings by matching their spherical-harmonic power spectrum to a target spectrum rather than relying only on pairwise Euclidean repulsion. This creates an explicit, tunable mechanism for suppressing low-frequency density fluctuations or enhancing a selected angular frequency, which can improve uniformity and reduce representation collapse on hyperspherical embeddings.
Useful7/10
Difficulty5/10
Novelty7/10
Running benchmark…
2026
Add a curvature-margin regularizer to a neural latent-state estimator or world model so that every initial-state direction is sufficiently constrained by the observation history and prior. The regularizer targets the smallest posterior-curvature eigenvalue, not total information, making the estimator resistant to systematic transition-model mismatch in poorly observed latent directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Apply the paper's compositional PAS idea to recurrent or state-space networks by propagating a polytope of possible hidden states and input perturbations over multiple time blocks. Instead of validating one hidden trajectory at a time, maintain a trusted convex family and re-linearize only when its nonlinear-fidelity tolerance is exceeded. This creates a runtime monitor and adaptive horizon mechanism for long-sequence inference, forecasting, and learned world models.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a family of nearby neural-network parameter updates by a low-dimensional polytope around the current parameters, and retain only the convex inner region whose predicted nonlinear training dynamics remain close to actual dynamics. Optimize the training objective over this trusted family with a small quadratic program rather than testing many independent candidate steps. The method turns a scalar learning-rate choice into a reusable set of jointly safe update directions.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct deep or recurrent networks whose layer weights are correlated across depth with a prescribed power-law covariance, rather than either fully tying or fully independently sampling layers. The paper predicts two usable design boundaries: \(\gamma=1/2\) for divergence of correlation-induced fourth moments and \(\gamma=1\) for loss of summable-correlation flatness.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Initialize each row of a neural weight matrix as a stationary correlated Gaussian process instead of using independent entries, but constrain its correlation tail to remain on the finite-fourth-moment side of the transition. This creates controllable structured spectra while avoiding the heavy-edge regime predicted for correlations slower than \(t^{-1/2}\).
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Treat the optimized surrogate and the training trajectory as objects that require a decision-level audit. Use multistart optimization to count phantom optima, and periodically evaluate whether stochastic training has changed the surrogate optimum even when validation prediction error remains nearly constant; stop, roll back, or average checkpoints when decision drift exceeds a threshold.
Useful7/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use the auxiliary-spin response of a sequence model as a finite-horizon diagnostic of whether learned event dynamics have become degenerate or insensitive to ordering. Track the minimum polarization gap and the Chern number of the phase-indexed response during training, then regularize or early-stop when a gap closing coincides with a topological-sector change. This supplies a sharp monitor based on a vanishing response norm and an integer transition, rather than relying only on validation loss.
Useful7/10
Difficulty5/10
Novelty9/10
Unverified
2026
Replace an unconstrained recurrent transition with a two-dimensional damped rotation whose parameters are induced by a learnable circular reorientation distribution. The first Fourier mode controls both memory persistence and phase rotation, giving the network an interpretable oscillatory memory while guaranteeing contraction when the effective decay rate is positive.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Constrain a recurrent or state-space neural network to keep its hidden state inside an ellipsoid that is robustly invariant under bounded feature inputs, hidden-state perturbations, and model mismatch estimated from offline trajectories. The ellipsoid and a stabilizing recurrent gain are fitted from data through an SDP-inspired certificate, then used either as a training regularizer or as a projection layer at inference time.
Useful7/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace Muon's single momentum matrix with a weighted mixture of fast and slow relaxation modes. The fast mode tracks rapidly changing gradients while the slow mode preserves a longer-horizon direction; their mixture is semi-orthogonalized and applied as the matrix update.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
For a neural network with a trainable linear head or low-rank adapter, store feature vectors from recent minibatches and select a finite set that is sufficiently independent. Apply Modified Gram-Schmidt to obtain orthonormalized memory directions, then add residual corrections along these directions so the local parameter-error dynamics have an identity coefficient matrix rather than a poorly conditioned empirical Gramian. The method predicts a sharp transition after the buffer first contains…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural controller or learned dynamics model against a finite-horizon set-valued certificate rather than only sampled trajectories. Represent uncertain states and bounded disturbances with hybrid zonotopes, propagate them through affine dynamics and a piecewise-linear neural network, and penalize reachable-set violations and failure to contract into a terminal set. This turns rare worst-case failures into a directly optimized geometric objective.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or state-space network from heterogeneous dynamical modules and characterize each module through sampled frequency-response passivity and Davis–Wielandt shell bounds. Constrain inter-module coupling so that the composed frequency response retains a positive passivity margin, providing a model-based alternative to blindly shrinking all recurrent weights.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained neural ODE or recurrent update field with the negative gradient of a learned scalar energy \(E_\theta(z,t)\). The resulting hidden-state dynamics have an exact Lyapunov certificate: energy decreases continuously, bounded trajectories cannot exhibit nonstationary recurrence, and the Łojasiewicz mechanism predicts convergence to a single equilibrium rather than persistent oscillation or chaos.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace AdamW's single exponentially decaying second-moment accumulator with a small bank of accumulators whose combined impulse response approximates fractional relaxation. The resulting preconditioner remembers rare or old gradient directions with a power-law rather than geometric decay, which may improve optimization on nonstationary, sparse-gradient, or long-horizon problems.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Treat stochastic optimization with a time-dependent learning-rate, momentum, weight-decay, or data-mixture schedule as a nonautonomous Markov process. Estimate the entropy production of each parameter trajectory by comparing its forward transition likelihood with the likelihood under a separately simulated optimizer driven by the reversed schedule, then use this estimate to adapt the learning rate or injected gradient noise. The controller is designed to remain in a low-dissipation regime…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Use a convex uncertainty region over latent item scores to select the next ranked-list query, rather than training separate pairwise preference predictors. Sort the centroid of the current region to obtain a proper ranking; every returned pairwise counterexample intersects the region with a halfspace and removes a constant fraction of its volume under the centroid-cut guarantee. This provides an active-learning procedure for preference models, reward models, or ranking heads that remains…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the forward-backward reversal error as an online reliability signal: save more checkpoints or increase the low-rank dimension only when reversing a block produces a large defect. This turns the paper's observations about chaotic low-rank trajectories and rank deficiency into an adaptive memory-versus-gradient-accuracy controller.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use componentwise Gauss--Hermite quadrature to compute the differential entropy of a Gaussian-mixture output head instead of estimating entropy with samples. This gives a low-variance, differentiable uncertainty regularizer for mixture-density networks, latent world models, or policies whose predictive distribution is multimodal.
Useful7/10
Difficulty4/10
Novelty6/10