✗ 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
Evaluate a neural network’s learned state by comparing its normal future-task performance with a matched blind counterfactual in which the stored representation, adapter, optimizer state, or memory slots are inaccessible and the model must re-optimize from the same compute budget. Train or select models to maximize this operational value rather than training loss or mutual information with the training data. The method should suppress nuisance memorization because information that cannot…
Useful8/10
Difficulty5/10
Novelty7/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
Replace a single value critic with graph-indexed critics V_alpha and graph-indexed policy heads pi_A, where the labeled graph covers every possible environment mode at every step. Train sampled Bellman inequalities rather than only equality-based temporal-difference errors, and select the policy head using the paper's min-max reachability rule. This targets robust RL settings in which the transition mode can change arbitrarily, such as unknown actuator regimes, domain randomization modes, or…
Useful8/10
Difficulty5/10
Novelty7/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
Attach an adaptive conformal error radius to every predicted agent and forecast horizon, then use that radius to inflate collision constraints or mask unsafe actions in a learned policy. Unlike a fixed heuristic margin, the radius automatically grows after systematic prediction failures and shrinks when the predictor is accurate, providing an explicit accuracy-versus-conservatism control.
Useful7/10
Difficulty4/10
Novelty5/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
Use the distinction between persistent saturated equilibria and immediate equilibrium loss to adapt the clipping threshold or learning rate. Increase the allowable update only when saturation is locally persistent and attracting; reduce it when saturation produces a nonpositive branch slope, a shrinking stability margin, or a sharp increase in clipped residual variance.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Train masked predictors with an explicit mixture of high-visibility masks, low-visibility masks, and a small atom at the fully masked input. High-visibility masks preserve ordinary denoising quality, while low-visibility and fully masked examples force the network to learn global mode frequencies that are invisible when nearly all context is shown. Tune the low-visibility mass using unconditional-mode recovery as an auxiliary validation metric.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Use the paper's negative-semidefinite interaction curvature to detect and compensate for destructive coupling among layerwise learning-rate, momentum, or preconditioner mechanisms. Instead of independently tuning mechanism amplitudes, estimate their reduced curvature after hidden optimizer states relax, then apply a low-rank trust-region step or freeze mechanisms whose interaction curvature is too negative.
Useful6/10
Difficulty5/10
Novelty7/10