✗ Failed on benchmark
2026
Replace the assumption that a minibatch gradient is fully Gaussian by a Gaussian center plus an explicit single-example big-jump correction. At each update, estimate the distribution of per-example gradient projections along the proposed update direction and use the predicted aggregate tail probability to reduce the step size or increase clipping only when the minibatch is in its non-Gaussian crossover regime.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the switched nonlinear extension to distinguish stability of the linearized modes from stability of the full neural dynamics. Stabilize worst-case linear products and limit the variation of each nonlinear Jacobian inside a specified radius, yielding an explicit local basin estimate and a penalty that prevents mode interactions from destroying attraction.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Add a learnable cyclic-coordinate mechanism to latent dynamics so that selected latent coordinates do not enter the Hamiltonian and their conjugate momenta become conserved. This provides an explicit dimensionality-discovery and invariance bias, encouraging the model to represent nuisance or symmetry directions compactly instead of spending independent dynamics capacity on them.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a fully connected neural SDE drift with coordinate-wise functions that can read only the paths of graph parents. Learn soft edge gates and penalize violations of the paper's pathwise Lipschitz condition, so the model remains stable during long rollouts and supports explicit interventions on selected coordinates.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a small continuous-time Markov latent module between a neural encoder and decoder, with input-dependent transition rates and a fixed library of graph topologies such as directed cycles, reversible chains, and branching motifs. The output is an observable of the stationary distribution, while a learned convex mixture over topology-specific response curves constrains the network to represent responses as combinations of interpretable nonequilibrium mechanisms.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Maintain a posterior over the effective stochastic-gradient noise scale and trigger expensive diagnostics or conservative optimizer changes only when uncertainty in that scale threatens a training-stability certificate. Unlike entropy-based exploration, the trigger depends on the predicted excess loss or stability gap caused by calibrating the optimizer to the wrong noise level.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a causal memory branch whose lag-response function is represented by a Bernstein polynomial with coefficients constrained to produce a nonnegative, decreasing, convex kernel. The branch aggregates past hidden states using this kernel, giving the model a learnable long-memory profile while preventing oscillatory, negative, or increasing historical influence.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained latent transition in an SSM or recurrent block by quiver data (alpha,gamma), where alpha evolves the latent state and gamma injects token or feature inputs. Add a differentiable penalty that detects eigenmodes of alpha not reached from gamma, preventing dead latent directions and improving long-context signal propagation. The paper’s exact open condition becomes a practical regularizer rather than a hard architectural constraint.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Run a small ensemble of neural-network replicas and treat their parameter or representation distribution as a mean-field state. Estimate the linearized replica-to-replica response and its covariance eigenmodes; when the leading mode approaches the critical eigenvalue associated with a pitchfork bifurcation, reduce the learning rate or noise, and when it is safely subcritical, increase exploration. The eigenvector identifies the parameter or feature direction in which branch splitting is…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition or latent neural-ODE vector field with a port-Hamiltonian transition. The layer separates conservative mixing from dissipative contraction, guaranteeing non-increasing latent storage energy when the external input is zero and bounding energy growth under driven inputs.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace unconstrained token-mixing logits by a symmetric zero-row-sum response matrix generated from positive conductances on a small auxiliary electrical network. The resulting mixer has conservation and positivity structure, while circular minors have a prescribed sign pattern associated with positive grove measurements. This is especially suitable for graph neural networks and attention variants that need stable global diffusion rather than arbitrary dense affinities.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Add a tail-risk penalty whenever a neural network's learned feature covariance has excessive inverse-eigenvalue mass. The penalty suppresses nearly singular representation directions, which may be inconspicuous in mean validation loss but can produce rare, very large prediction errors under noise or distribution shift.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a single scalar optimizer memory per parameter block with a small occupancy distribution whose bins represent distinct relaxation or gradient-history regimes. Train this state using a conservative redistribution operator and an energy-decreasing correction, allowing the optimizer to represent non-equilibrium lag and hysteresis that cannot be captured by one momentum variable.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Treat the hidden-state evolution of an RNN or state-space model as a parameterized dynamical system and globally continue its attractors over a grid of inputs, perturbation amplitudes, and training checkpoints. Penalize or stop training when the task-relevant attractor loses basin mass, rather than relying only on local Jacobian eigenvalues at one nominal trajectory.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Build a neural PDE surrogate that predicts changes in equilibrium variables rather than changes in conservative state variables. The network receives the local state and geometry, predicts an equilibrium-coordinate increment, and subtracts the network output evaluated at a reference equilibrium, forcing the reference state to have exactly zero learned residual.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat the sequence of recurrent or state-space Jacobians along a trajectory as a noncommutative matrix cocycle, analogous to the time-dependent offspring mean matrices in the branching model. Estimate its finite-horizon growth exponent and use it to adapt spectral normalization or recurrent gain, targeting a slightly negative exponent for stable memory without uncontrolled exploding dynamics.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the reachability verifier as an optimization controller: permit a neural controller update only when the proposed parameter step remains inside a certified STL-safe trust region, and shrink the region when the reachable robustness margin collapses. This turns verification from an expensive final check into feedback that prevents gradient descent from crossing a temporal-logic feasibility boundary.
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace the recurrent transition by a dissipative linear state update minus a maximal monotone nonlinear damping operator. Couple the hidden-state update to an output map so that the cell satisfies a discrete analogue of the paper's scattering-passivity inequality, controlling both hidden-state energy and output energy by initial-state energy plus input energy.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Replace an unconstrained second-order residual or state-space block with a position-velocity system whose damping is the gradient or subgradient of a convex function. Compute the next state implicitly, so the damping cannot inject energy and the resulting layer is robust to large learned damping nonlinearities, nonsmooth activations, and long rollouts.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Treat the diffusion drift Lipschitz constant K as an explicit capacity knob and tune it from the amount of trajectory data. Enforce K directly with spectral normalization or a product-of-layer-norm constraint, then select among a small set of budgets using held-out return or behavior-cloning likelihood rather than allowing unconstrained networks to acquire an uncontrolled effective Lipschitz constant.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Build a multi-expert or multi-task layer whose feature channels are divided into a globally shared subspace and expert-private subspaces. Matrix-weighted message passing couples experts only through selected feature directions, while the nullspace preserves specialization; the graph-cut condition provides a concrete test that the shared channels can propagate across all experts rather than becoming disconnected islands.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a finite-state monitor to a neural policy and allow only actions whose successor remains in the simultaneous backward-reachable winning set for all active modes. Modes may encode safety, hardware configuration, and independent task goals. This gives a hard runtime constraint rather than relying on a reward penalty to teach the policy not to enter irreversible dead ends.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent or neural-ODE vector field with a Lie-algebra-valued connection depending on time, input position, and an auxiliary spectral parameter. Train the model both for prediction and for approximate zero curvature, so evolution along different discretized paths is compatible rather than accumulating arbitrary noncommutative drift.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a safety projection step to every or selected Euler updates of a flow-matching action sampler. Instead of correcting only the first action, differentiate a collision-risk function through the predicted full action chunk, construct local linear inequality constraints, and apply the smallest correction that makes the future trajectory safe.
Useful7/10
Difficulty5/10
Novelty5/10