✓✓ Beats tuned baseline
2026
Treat optimization as a forced dynamical system whose state is the parameter velocity and whose input is the minibatch gradient. Permit ordinary momentum updates below a target energy, but smoothly increase damping when optimizer energy exceeds that target. This preserves less-conservative behavior in low-energy regions while imposing dissipative dynamics during potentially divergent excursions.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an instantaneous diagonal optimizer with a causal convolution of recent gradients, where cross-layer or cross-module gradient correlations define a finite-memory Onsager response matrix. Estimate the response at several parameter-block pairs and lags, integrate it to obtain a finite-time transport matrix, and use its regularized inverse or symmetric part to precondition the update. This targets optimization regimes in which gradients propagate between blocks with measurable delay, such…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace periodic all-reduce in federated or distributed training with local broadcasts triggered by a prescribed parameter-disagreement envelope. Each worker maintains held copies of the latest parameters received from neighbors and applies a consensus correction to its local optimizer update. After an asynchronous reception causes a discontinuous change in sampled disagreement, a receiver-side exponentially decaying correction temporarily enlarges the allowable envelope, preventing false…
Useful8/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed optimizer preconditioner with a diagonal matrix selected by an online convex optimizer. A gradient predictor supplies the direction, while a linear-loss regret update learns coordinate-wise gains that favor transformations aligned with the realized stochastic gradient. The method retains the identity preconditioner as an explicit comparator, so it can be tested for negative regret and improvement over ordinary SGD.
Useful8/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an EKF or a large particle ensemble inside a neural world model with a fixed-order polynomial chaos representation of the latent state distribution. The transition network is evaluated under quadrature or sampled chaos variables, and Galerkin projection produces the next uncertainty coefficients directly; a coefficient-wise LMMSE update then assimilates observations without backpropagating through resampling.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat a scalar projection of the stochastic training trajectory as a generalized current and use a finite-time concentration bound to decide when its mean estimate is reliable. Increase batch size, reduce the learning rate, or stop collecting samples when the bound predicts that the probability of a misleading gradient estimate is below a target confidence level.
Useful7/10
Difficulty6/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 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
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 confirmed, baseline not beaten
2026
Partition a network's parameters into M ordered blocks and represent blockwise normalized update activity by a nonnegative density n_i. Instead of assigning independent learning rates, evolve this density through a discrete conservative current whose diffusivity depends on local activity, while adding calibrated multiplicative noise from the corresponding mobility. This couples learning-rate adaptation across depth or layer order and prevents isolated blocks from becoming arbitrarily overactive.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a fixed PAGE refresh schedule with a restart policy selected from the PL condition-number regime. For well-conditioned objectives, use frequent full-gradient refreshes and short inner phases; for ill-conditioned objectives, use the conventional condition-number-scaled PAGE phase length. The goal is lower component-gradient cost to a target loss while retaining PAGE's low-variance updates.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Use the paper's extreme-value escape statistics as a diagnostic for delayed-gradient bursts. If many stochastic minibatch realizations escape through an unstable delay mode, their first-passage times should become approximately Gumbel distributed, allowing the optimizer to distinguish useful basin escape from destructive divergence and to terminate or retune the burst automatically.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Wrap stochastic optimization or iterative neural inference in a controller that measures how far the state distribution moves during each interval and compares this motion with the available noise-dependent entropy-production budget. The controller increases the learning rate or reduces inference steps only while the trajectory remains inside the predicted speed-limit region, preventing fast jumps that cause accuracy collapse.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Attach a calibrated risk monitor to intermediate diffusion states and terminate mutations that are likely to violate hard architecture or performance constraints before full decoding and training. This transfers the paper's separation between proposal generation and authoritative external evaluation into an early-stopping controller for expensive neural architecture trials.
Useful7/10
Difficulty5/10
Novelty7/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
✗ 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
✗ Failed on benchmark
2026
Use the trajectory martingale decomposition to separate predictable training updates from genuinely unpredictable residual updates, then scale the residual according to its estimated response to future loss. The method targets stochastic or event-driven optimization with history-dependent samples and predicts that response-weighted residual energy, rather than total gradient variance, controls update noise and instability.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed-noise Langevin optimizer with one that estimates the response of a training observable to a matched perturbation of the optimizer drift and noise, then adjusts damping and temperature to satisfy the finite-time fluctuation-response relation. The observable can be minibatch loss, validation loss, or a gradient projection, while the perturbation is a small controlled change in the corresponding update drift. This provides an online noise schedule and a falsifiable calibration…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Choose the neural operator's input-history length from the measured correlation time of the unresolved closure signal produced by coarse-graining. This avoids under-memory, which causes systematic closure error, and over-memory, which increases attention cost and can destabilize training. The same diagnostic can drive adaptive memory truncation across physical regimes.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace many independently equilibrated SGLD runs at different hyperparameters with one controlled sweep in which an auxiliary drift transports particles through the stationary distributions indexed by the swept parameter. Estimate the response of loss, predictions, uncertainty, or weight observables using covariance with the stationary generalized-potential derivative instead of finite differences between separate runs.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Treat a neural hidden-state process as a finite or discretized continuous-time Markov chain and define a target event as first entry into a target state set. Instead of estimating the derivative of the mean hitting time by expensive long rollouts, build an auxiliary regenerative chain that resets to the source state after reaching the target and estimate the same response from its stationary distribution. Penalize disagreement between this response prediction and short empirical perturbation…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the lifted second-moment operator to adapt the residual step size of a deep residual network or neural ODE under multiplicative layer noise. Instead of choosing a fixed residual coefficient, shrink or enlarge it online to keep the predicted covariance-growth factor below a target margin, producing a stochastic stability controller for depth and inference time.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace hand-designed Heavy Ball or Nesterov coefficients with a low-order linear controller synthesized by a semidefinite program. The controller receives the stochastic mini-batch gradient and emits the parameter update; dynamic IQC multipliers constrain both gradient curvature and temporally correlated mini-batch noise, so the SDP directly minimizes a certified contraction factor rather than optimizing momentum heuristically.
Useful7/10
Difficulty7/10
Novelty7/10