✗ Failed on benchmark
2026
Replace an unconstrained graph-message-passing block with a port-Hamiltonian layer whose edge interactions are generated by a skew-symmetric formation-matrix coupling and whose node damping is positive semidefinite. The layer can model relative graph structure while preventing unforced hidden-state energy growth, reducing exploding activations and oversmoothing caused by arbitrary repeated propagation.
Useful8/10
Difficulty5/10
Novelty6/10
✗ 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
Introduce an effective learning-rate, gain, or regularization parameter that follows the commanded target with a finite implementation rate, and compensate for its predictable threshold-crossing lag. The scheduler estimates the network's current spectral instability boundary and commands the target parameter to cross that boundary early enough that the effective parameter crosses it at the desired time, avoiding overshoot caused by optimizer or hardware smoothing.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural dynamical surrogate not only to reproduce measured trajectories, but also to reproduce the plant's economically optimal decision and objective value. Add a differentiable decision loss obtained by solving the surrogate's inner optimization problem, and reject models that fit observations while producing extra local optima or a shifted optimum.
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
Use the condition discriminator's residual and predictive variance to decide which unlabeled streaming samples may update a model at deployment. Only samples whose condition prediction is both calibrated and close to the currently expected condition are admitted, preventing unreliable operating regimes from causing catastrophic test-time drift.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Model one period of a cyclic optimizer or periodically modulated recurrent network as a discrete-time linear time-periodic system obtained by linearizing the update around its current trajectory. Estimate a periodic Lyapunov matrix sequence and scale the next learning-rate or modulation amplitude so that every phase contracts according to a certified energy decrease. This should prevent delayed divergence caused by resonance with the schedule, even when individual phase Jacobians are…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the global EMA update for each linear-layer momentum matrix with a delta-rule update that learns the current output-side gradient value only along the current input-key direction. Frequently occurring directions are corrected repeatedly, while rarely visited directions are not unnecessarily overwritten or uniformly decayed. Use the resulting matrix as the ordinary momentum buffer in SGD, AdamW, or another optimizer.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat a neural-network training update as a control input and impose control-barrier inequalities on quantities that must remain safe, such as parameter norm, activation variance, attention-logit magnitude, or an estimated Lipschitz margin. At each step, solve a small quadratic program that stays as close as possible to the nominal gradient update while guaranteeing a first-order forward-invariance condition.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Wrap an observation-based neural policy with a real-time safety filter that accounts for uncertainty in its latent-state estimate. The policy proposes an action, while a quadratic program minimally modifies that action so a control-barrier/value function remains nonnegative for every state inside a conformally calibrated error set.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a learned neural controller or world-model policy with a quadratic-program projection that enforces a robust higher-order control barrier condition. The projection uses a neural estimate of hidden state variables and a certified bound on model and estimator residuals, so the nominal policy is changed only when it approaches a learned safety boundary.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace full-precision communication in decentralized or federated optimization with a sparsified uniform quantizer whose scale decreases geometrically, while maintaining an error state at each worker. Choose the scale so that quantization disturbance decays at least as fast as the contraction of the gradient-tracking dynamics; this should preserve linear convergence instead of creating the usual fixed-quantization error floor.
Useful8/10
Difficulty5/10
Novelty5/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
Train a neural policy through a differentiable dynamics model while enforcing a Control Barrier Function condition at every rollout state, rather than applying a penalty only to observed constraint violations. The barrier residual becomes a local certificate that the learned policy points inward at the boundary of the safe set, allowing safety to be checked on unseen states when combined with a margin and Lipschitz bound.
Useful8/10
Difficulty5/10
Novelty5/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 vector field together with a positive-definite metric \(M_\phi(x,u)\) that certifies local contraction at a prescribed rate. The contraction penalty must include the total derivative of the input-dependent metric, so rapidly changing controls are treated as a source of geometry variation rather than incorrectly claiming stability from a frozen metric.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a fixed learning rate for each layer or parameter block with a bounded gain selected by the one-step-ahead predictive loss. The sign of the product between the current gradient and the next gradient estimates whether the previous update moved downhill: aligned gradients increase the gain, while sign reversals decrease it. A mirror-descent update on a bounded interval prevents the runaway step sizes that can occur with exponential or unconstrained learning-rate parameterizations.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train a graph cost predictor not only on the nominal shortest-path decision, but on budget-limited edge perturbations that cause its predicted path to disagree with the true shortest path. The perturbation is an interdiction vector that adds known delays to selected edges, forcing the model to learn path-cost margins and relative rankings rather than merely any cost function that reproduces the nominal argmin.
Useful8/10
Difficulty6/10
Novelty6/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
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