✗ Failed on benchmark
2026
Turn constrained-flow generation efficiency into an online diagnostic and controller for neural sampling. When the target ensemble changes faster than the flow can track or becomes internally complex, automatically shorten the training window, increase flow updates, or fall back to local MCMC instead of silently accepting biased or highly correlated samples.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a controlled nonreversible drift to a Langevin or score-based diffusion sampler so trajectories reach a target high-probability region faster, while constraining pathwise entropy production or excess heat. The paper predicts that hazard-rate improvement has a thermodynamic ceiling: general time-dependent survival acceleration is at most linear in perturbation strength and prior entropy production, while rare-event acceleration is bounded exponentially by excess heat.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a monolithic nonlinear latent transition in a neural world model or sequence predictor with two lifted latent channels: a global channel encoding scene-wide or sequence-wide structure and local channels encoding patches, segments, tokens, or objects. Propagate both channels with a block-structured linear operator and decode them jointly, so the encoder remains nonlinear but multi-step latent rollouts do not repeatedly apply a deep transition network.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a continuous-depth or recurrent residual block with a prescribed polynomial Lyapunov decay near its equilibrium. The architecture combines a fixed radial stabilizer with a learned component that is constrained to have zero radial projection, allowing slow algebraic transients and long memory while preventing asymptotic hidden-state growth.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Add a discrete structure-selection gate before a neural predictor, maintaining separate masks for explanatory structure and predictive performance. Use entropy reduction only when the discretization resolution is finer than the observed stochasticity; otherwise use a validation-calibrated predictive mask or retain both masks through a mixture-of-experts gate.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Use the paper's explicit compact factor of a symplectic state-transition matrix to measure aggregate rotation speed in hidden-state dynamics. Penalize excessive or rapidly varying angular velocity rather than penalizing the full recurrent matrix, preserving nontrivial Hamiltonian rotations while suppressing phase drift that can destabilize long sequences.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained token mixer or feed-forward residual map with a feature-conditioned rational operator whose transfer matrix is positive real on the positive orthant. Apply it through a resolvent, rather than an additive residual, so that the accretivity certificate yields a nonexpansive implicit update and suppresses activation explosions.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Give every possible pairwise relation its own recurrent latent state, stored in a dictionary keyed by stable node identities, instead of discarding the state whenever the edge is absent from the current graph. At each timestep, active edges retrieve their old state, update it with the current pair features and neighborhood messages, and write it back after message passing. This should improve predictions in dynamic graphs with intermittent interactions and reduce the burden on node states to…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Generate discrete configurations globally with an autoregressive model and then refine them using a continuous-time Markov chain of local single-site replacement moves. Use importance weights and the paper's normalized ESS to adapt the CTMC refinement budget and to reject training batches in which the proposal has collapsed onto a few modes.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace independent residual-block parameters by a stationary correlated sequence and set the residual multiplier according to the sequence's long-memory exponent and Hermite rank. This preserves a nontrivial O(1) input-output transformation as depth grows, while avoiding activation explosion or identity collapse caused by inappropriate residual scaling.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the usual isotropic Gaussian random Fourier features with a frequency distribution matched to the expected spectral regularity of the target function. For coordinate fields, operator-learning maps, or PDE solution surrogates, this should place more features where the target Fourier energy lies and improve approximation at the same feature count. Stabilize the resulting feature matrix with whitening or ridge regression because spectral accuracy can create severe ill-conditioning.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an expensive nonlinear rollout of a recurrent or neural state-space model by a locally affine rollout whose Jacobian is evaluated once at the current state and then frozen over a short horizon. Use the resulting transition matrix as an explicit stability monitor and optionally penalize or clip its spectral radius, reducing exploding long-horizon predictions without forcing the entire nonlinear network to be globally contractive.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add an explicit transport-delay state to a recurrent neural network, state-space model, or learned optimizer whenever actions, gradients, or control inputs arrive after a fixed delay. Use the queued inputs to construct a finite-horizon predictor state and apply the neural transition or controller to that predicted state rather than to the stale state. The design transfers the paper's delay-as-transport-PDE and backstepping-to-stable-target strategy into a differentiable predictor with an…
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build each one-step operator as a maximum over a compact set of learned or discretized action branches, with a branch-dependent penalty. This directly imports the envelope structure used for nonlinear semigroups and gives a neural architecture suited to HJB equations, robust prediction, and stochastic control under model uncertainty.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed momentum and learning-rate schedule with a batch-aware stability controller derived from the paper's critical-learning-rate scalings. Polyak learning rates should scale approximately with B(1-rho), whereas Nesterov learning rates can scale as B^beta(1-rho) until reaching the base stability ceiling; this may allow larger batches without crossing the instability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a purely memoryless optimizer step by a partially observed feedback controller for parameters evolving under colored, active gradient fluctuations. Estimate the hidden persistent component of the gradient from parameter displacement and observed minibatch gradients, then use that estimate to cancel predictable activity or adapt the effective update target without directly observing the latent disturbance.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat neural-network parameters as the state of a controlled dynamical system and optimize a short sequence of parameter updates instead of committing immediately to the next optimizer step. A cheap guiding optimizer, such as Adam or SGD, is rolled out to produce a moving terminal center; the lookahead optimizer is penalized or constrained when its endpoint leaves a neighborhood of that center. This transfers the paper's policy-relative feasibility and performance idea without requiring a…
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Use an online estimate of the loss barrier separating the current basin from candidate neighboring basins to tune optimizer noise or a trust-region radius. The paper predicts that the current- or power-maximizing barrier is nonzero and approximately matched to an effective harmonic-mean temperature, U_0^* approximately equal to T_act, providing a concrete schedule for increasing or decreasing exploration.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a bounded probing perturbation to the inputs or intermediate outputs of a neural sensor-fusion model, and choose the perturbation by maximizing separation between the predicted trusted-output set and output sets induced by candidate sensor attacks. Bounded feature and measurement uncertainty are propagated through local neural Jacobians as zonotopes, giving a conservative, geometry-based exposure objective rather than relying on random noise. Training can use the resulting margin as a…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the adapted linear latent model as a cheap receding-horizon planner or training-time controller around a nonlinear neural predictor. Optimize a short sequence of latent corrections with a quadratic objective, while constraining latent states and inputs to remain inside the region where the Koopman approximation has been identified and its transition spectrum is stable.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Add a fading-memory consensus force to parameter dynamics, pulling the current parameter toward a distributed average of its past while preserving the ordinary gradient step. Implement the infinite memory through one or several recursive exponential states, and tune the memory decay so that quadratic-mode dynamics remain exponentially stable. This should suppress oscillations and catastrophic steps without relying on conventional momentum alone.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Use a spherical-design codebook and the paper's polar slack factorization to create a nonnegative geometric interaction bias for attention or expert routing. The resulting kernel is generated by a rank-one term and a rank-at-most-d term, and entries close to zero can define a structured sparse mask instead of relying only on learned top-k selection.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use farthest-triplet entropy as a low-bandwidth observable of whether a hyperbolic embedding is angular- or radial-dominated, then adapt the hyperbolic curvature rather than fixing it arbitrarily. In the isotropic shell regime, invert the entropy-to-signal curve to estimate the effective radial/angular parameter and select curvature that reaches a chosen geometric operating point.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Attach two independent critics to a learned controller: an empirical probability that executing the controller reaches a desired terminal set, and a recoverability value estimating whether the current state remains inside a safe reach-avoid region. Execute the learned controller only when both critics pass their thresholds; otherwise route to a conservative fallback policy or expert.
Useful7/10
Difficulty6/10
Novelty6/10