✓✓ Beats tuned baseline
2026
Split a neural ODE or diffusion-model probability-flow ODE into a stiff known smoothing operator, a learned drift, and an optional local reaction term. Use super-time-stepping stages for the smoothing operator inside a single macrostep, while evaluating the learned drift only at selected coupling stages and treating the local reaction with diagonal or block-local implicit solves. This should allow substantially larger stable macrosteps when the known operator has a large negative spectral…
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace ordinary depth-wise feature propagation by a ternary hierarchical block that recursively aggregates three child representations while maintaining separate neutral and defect channels. The block is initialized from the Sierpinski six-vertex recursion, then optionally learns a bounded correction. The neutral channel preserves the paper's cubic mixing law, while the defect channel provides a controlled route for long-range and nonlocal interactions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Inject weak, unpostselected stochastic perturbations into activations, attention links, or recurrent transitions, but scale their strength according to effective computational size. The schedule is designed so that noise is initially a weak perturbation and becomes dominant only beyond a controlled depth or sequence length, producing a measurable crossover rather than uncalibrated constant dropout.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the raw transition matrix of a Koopman-inspired latent model or linear state-space model by its restriction to a data-derived forward-compatible subspace. The subspace is obtained by repeatedly intersecting the current latent dictionary with its image under the learned dynamics, suppressing directions that generate spurious or unsupported eigenmodes while retaining nonzero Koopman modes represented by the dictionary.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat undesirable neural-network states as obstacles and steer training or inference away from them with a smooth distance barrier while preserving a nominal loss descent direction. The barrier can protect against exploding activations, excessive attention concentration, unsafe controller outputs, or leaving a certified representation region without introducing discontinuous gradient clipping.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the unconstrained rectified-flow velocity predictor with the gradient of a learned scalar potential. At every rectification round, fit the potential by weighted least squares to the current displacement field, then integrate the resulting conservative velocity from the source distribution to the target distribution. The gradient restriction is intended to eliminate non-transport rotational motion and improve convergence toward the quadratic optimal-transport coupling.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Calibrate process and observation uncertainty bounds by requiring a learned neural dynamical model to contain calibration trajectories in its reachable sets, instead of fitting a Gaussian noise model. The resulting bounds can control an uncertainty-aware loss, trigger teacher forcing or re-observation, and identify latent coordinates whose dynamics are not adequately modeled. This transfers the paper's conformance principle into a falsifiable training monitor and adaptive rollout schedule.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Apply Komuro-style expansivity to a continuous-time neural latent flow by requiring distinct latent trajectories to separate even when the second trajectory is allowed an arbitrary increasing time reparametrization. This targets neural ODE world models and irregularly sampled sequence models, where ordinary pointwise separation can mistake clock-speed differences for different states.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the exact matrix-polar normalization in Muon with the smoothed feedback \(h_\epsilon(M)=M(M^\top M+\epsilon I)^{-1/2}\). This retains singular-vector-aware updates and approximately unit-normalizes dominant spectral modes, but avoids unstable behavior when the momentum matrix is rank deficient or has tiny singular values.
Useful7/10
Difficulty5/10
Novelty4/10
✗ Failed on benchmark
2026
Build a positive continuous-depth RNN or state-space layer in which a nonnegative recurrent-input gain is generated by a PITO controller. If sustained large gain produces sustained large hidden-state output through a PIPO plant, the controller automatically decreases the gain, preventing runaway recurrent dynamics without requiring a globally tiny fixed gain. The construction predicts a quantitative attenuation threshold and exponential decay rate when the hidden output stays above that…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use a finite-state Markov router to select recurrent or expert Jacobians, and regularize or optimize the router through the top Lyapunov exponent computed from state-conditioned projective statistics. The paper's mechanism predicts that this exponent varies smoothly with routing probabilities when the transition matrix is primitive and the dominant exponent is simple, while loss of primitivity, resonance, or exponent collision marks a detectable boundary where routing gradients may become…
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace sequential upward message passing in a tree-structured neural module with rake–compress contraction of quadratic latent-state messages. Each node stores a quadratic value function and each edge stores a linear transition or coupling triple; leaf elimination and unary-node compression are implemented as batched Schur complements, followed by a reverse pass that reconstructs node latents and edge outputs. The layer is exact for Gaussian or quadratic latent models and remains…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace fixed chunked-prefill settings in an LLM serving engine with a feedback controller that decreases the number of prompt tokens processed per scheduling quantum as GPU saturation or long-context load increases. The controller targets a high-quantile bound on the absolute GPU-power ramp while preserving the existing peak-power ceiling and measuring the resulting latency-throughput tradeoff.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Partition a neural network into N interacting modules and constrain the Jacobian of its implicit residual map to be block diagonally dominant. Each module can compute its update locally while cross-module coupling is monitored through a normalized block-row margin. The certificate guarantees local nonsingularity of the equilibrium equations and predicts a sharp loss of robustness when the largest BDD ratio approaches one.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Use a convergent kernel approximation of the Zubov invariant as a trust-region monitor for a learned dynamics model. The estimated Zubov sublevel sets become an inference-time gate that rejects, shortens, or dampens transitions predicted to leave the learned attraction region.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Constrain a recurrent transition so that its dynamically relevant invariant subspaces have no eigenvalues near the unit circle, separating contracting memory directions from expanding prediction directions. Add a pseudo-orbit consistency loss so that trajectories generated with bounded transition perturbations remain close to clean trajectories, as expected from hyperbolic shadowing.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Augment an optimizer with a periodic phase and deliberately use a cyclic learning-rate or momentum forcing whose averaged dynamics have an attracting low-dimensional set. Treat the resulting periodic parameter orbit as an invariant torus and tune the schedule so transverse contraction dominates tangential sensitivity and minibatch perturbations. The goal is a robust, phase-locked training orbit that explores parameter space without losing attraction toward a useful solution manifold.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use a two-stage residual augmentation loop: first let a residual network explain model mismatch, then project its learned vector field onto a physically constrained candidate library and replace the flexible residual with the accepted sparse terms. This turns an unconstrained neural correction into a low-complexity dynamical law that is easier to roll out over long horizons and can expose unsupported hidden-state explanations.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Train a sequence model so that measured perturbation responses and spontaneous hidden-state correlations satisfy the paper's off-diagonal fluctuation–response identity. This discourages arbitrary non-reciprocal dynamics while preserving a controlled antisymmetric response that can encode directional temporal dependencies.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Add a graph-structural anti-oscillation constraint to binary or thresholded recurrent message-passing networks. The paper shows that a partition with sufficiently many cross-partition neighbors creates an exact period-two orbit, so training can explicitly penalize such high cross-degree bipartite cores or choose the threshold above their strength.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Track the covariance of a small recurrent population state and regulate its effective gain before finite-size fluctuations diverge. The controller uses the covariance Jacobian eigenvalues from the paper, making the distance to criticality an explicit adaptive regularization signal for recurrent or state-space neural networks.
Useful7/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a per-feature or per-token state that accumulates recent stimulation and decays when stimulation is absent, then use a nonlinear decreasing gain to suppress repeatedly activated features. This creates short-term adaptation without changing the core transformer or recurrent weights: familiar inputs are processed with reduced gain, while novel inputs recover their full response.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained neural transition model with a hybrid sparse dynamics model: retain analytically known first-order relaxation or control terms and learn only a sparse set of candidate interactions from a physics-guided library. Fit the library coefficients using a robust TLS-plus-RANSAC procedure, then use the identified model as the transition function or as a residual correction to a neural state-space model.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the relaxed QFT tensor-network topology as a trainable norm-preserving mixer inside a neural block, replacing a dense token-mixing matrix or an expensive global convolution. The network learns data-adapted global interactions while retaining structured O(N log^2 N) application and an exact cheap inverse, making it suitable for image tokens, long sequences, or reversible residual blocks.
Useful7/10
Difficulty6/10
Novelty6/10