✗ Failed on benchmark
2026
Replace a fixed optimizer memory order with a nested family of gradient-integral controllers. Training begins with a first-order update and activates additional accumulated-gradient states only after an exponentially smoothed residual fails to decrease for several decision intervals; newly activated gains are ramped from zero, so the parameter update remains continuous and previously learned states are preserved. The optimizer should use little memory on easy problems and acquire longer memory…
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace derivative-based latent-dynamics fitting with an integral regression and maintain a history stack selected by the smallest eigenvalue of its information matrix. The model should perform aggressive parameter updates only when the estimated latent regressors are sufficiently exciting, while a perturbation bound prevents false excitation caused by inaccurate hidden-state estimates.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a controllable delay to the gradient force during optimization so that parameters follow a delayed-gradient dynamical system. Choose the delay below the stability boundary for ordinary training, and temporarily cross the boundary when the optimizer is trapped in a sharp or stagnant basin, causing stochastic fluctuations to be amplified out of the basin rather than waiting for a rare Arrhenius escape.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the generalized Cramér–Rao relation to adapt the inverse-temperature or noise schedule of an energy-based sampler, diffusion sampler, or stochastic optimizer. The controller limits each temperature change according to the measured energy variance and Fisher information, preventing uncontrolled changes in the sampled energy distribution while allowing larger steps in insensitive regions.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
When several action branches have nearly equal Q-values, select among them using their long-horizon transition consequences rather than only noisy one-step critic values. Construct a finite sampled approximation to the paper's marked tangential Bellman operator: each candidate receives a local deficit mark and a continuation-value mark, and the branch scores are iterated through a discounted fixed point. Under a perturbation of size comparable to the finite-pool extreme-value gap, the resulting…
Useful8/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a fixed number of randomly sampled continuous actions with a state-dependent candidate pool whose size is chosen from the predicted extreme-value error of the best candidate. If the local action deficit has order \(\|u-u^\star\|^\kappa\) in an effective dimension \(d\), the best sampled action has expected Bellman error proportional to \(N^{-\kappa/d}\). This gives an explicit stopping rule for increasing the pool only when the estimated residual action error is larger than the…
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a standard softmax-gradient update for a probability vector with a two-stage KL Mirror-Prox update. The predictor evaluates the population-dependent cost at the current distribution, and the corrector evaluates it at the predicted distribution, reducing oscillation when routing or attention costs are coupled across tokens or samples.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Train a neural forecaster or policy network to preserve the pairwise ordering that determines profitable charge and discharge decisions, rather than optimizing only pointwise forecast error. Combine a conventional prediction loss with a pairwise ranking loss weighted by the economic price gap, then pass the prediction through a feasibility-aware storage scheduler.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
For sparse terminal-reward RL, first solve a discounted version of the fixed-policy Bellman equation to detect states with zero probability of ever reaching success. Clamp these dead states to value zero, retain successful terminal states at value one, and then run undiscounted stochastic policy evaluation and greedy improvement on the reduced state space. The clamp removes the nonunique harmonic solutions that make direct undiscounted TD unstable or initialization-dependent.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train the raw neural policy to anticipate the safety shield instead of relying on it indefinitely. Add the expected process-correction distance to the PPO objective and adapt its multiplier with a primal-dual update so that policy correction remains below a specified budget.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the pointwise strong-form PINN loss with a vector of localized weak residuals generated by fixed compactly supported polynomial test functions. Use a neural network or KAN as the trial function, integrate by parts once, and evaluate each test residual with Gauss–Legendre quadrature; this lowers the required derivative order and prevents a few high-curvature collocation points from dominating training.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Insert an online errors-in-variables subspace estimator into a latent state-space neural network. A fixed recent window of encoder features and controls is used to estimate a noise-corrected low-dimensional state subspace and refit the latent transition and readout matrices, allowing the model to follow sensor degradation or changing operating conditions without replaying the entire dataset.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace uniform minibatch sampling by a fixed-size determinantal point process whose similarity matrix is a diffusion kernel on the training-data k-NN graph. The sampler repels nearby or redundant examples while preserving multiple diffusion modes, so a small batch should cover intrinsic data geometry and provide lower-variance estimates of losses and gradients.
Useful8/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Partition neural-network parameters into blocks and update each block using a stochastic proximal best response, followed by Krasnoselskii relaxation. The relaxation factor and minibatch size become explicit stability knobs: aggressive stochastic updates are damped, while larger batches are used when the estimated update variance approaches the mean-square stability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the usual inverse-Hessian implicit hypergradient with the derivative of the minimum-norm inner solution. Compute it as the limit of derivatives of a uniquely solvable Tikhonov-regularized problem, using a decreasing damping parameter and conjugate-gradient solves. This should make bilevel training usable when the inner model is overparameterized or has flat directions.
Useful7/10
Difficulty5/10
Novelty6/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
✗ Failed on benchmark
2026
Wrap a neural policy with an online disturbance estimator and a zonotopic reachability shield. Instead of rejecting actions using a permanently worst-case disturbance set, update the disturbance zonotope from observed transition residuals and accept an action only when the resulting reachable set remains inside the safe region.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural value or latent-dynamics model with temporal-difference targets before enforcing a stiff differential-equation residual, and ramp the physics weight only after the critic has become predictive. For a stochastic dynamical model, the residual is computed using the infinitesimal generator, while terminal, safe, and failure boundary conditions are imposed through separate penalties.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace hand-tuned exponentially separated coefficients for multiple neural objectives with weights obtained from a local KKT certificate. For L1 hinge penalties, solve a small linear program that maximizes the smallest tier weight while enforcing approximate stationarity of the weighted objective at the current priority solution. This should preserve high-priority behavior more reliably than fixed loss weights while avoiding unnecessarily large coefficients.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Train a recurrent or neural-ODE state transition with an integral residual instead of matching noisy finite-difference derivatives. Enforce sparse regulator-to-state connectivity with group sparsity, so the model learns a compact dynamical mechanism while avoiding the severe variance amplification caused by estimating derivatives from sampled data.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train an augmented latent neural ODE from snapshot observations of only the visible coordinates by transporting particles from an initial latent distribution and differentiating their visible locations through forward sensitivity equations. Replace density-PDE discretization or potentially biased same-particle density objectives with a kernel marginal-matching loss whose gradient is estimated using independent particle sets.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a small robust quadratic-program layer to a neural controller. The network proposes an action, and the QP returns the closest action satisfying an ISS Lyapunov decrease constraint and a robust safety-barrier constraint under bounded model disturbances. This should preserve the network's behavior away from constraint boundaries while preventing unstable or unsafe actions near those boundaries.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a static batch size with a schedule optimized for a prescribed learning-rate schedule and a fixed total number of processed examples. Steps whose stochastic-gradient noise has a large effect on the paper's loss bound receive larger batches, with the weighting determined by the future learning-rate tail rather than by a hand-designed warmup or cooldown rule.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the unresolved small jumps of an infinite-activity stable Levy noise source in a neural SDE or stochastic optimizer with one Gaussian increment whose variance equals the discarded jump variance. Simulate only jumps above the cutoff exactly or by Poisson sampling, retaining the large-jump distribution while obtaining the paper's O(\varepsilon) Wasserstein error instead of the naive O(\varepsilon^{1-\alpha/2}) error.
Useful7/10
Difficulty5/10
Novelty8/10