✗ Mechanism failed
2026
Replace independent-client assumptions in federated learning with a dynamical estimate of conformity-amplified client corruption. Track the fraction of honest clients that have adopted a misleading update direction, predict its equilibrium using a bounded-rational conformity model, and use that effective error probability in a MAP estimator for the global gradient or class label.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a finite-sample lower safety certificate to the trajectory selected by a neural planner or policy by calibrating the difference between predicted and realized clearance. A lower-tail CVaR of sampled neural predictions can provide the raw margin, while conformal calibration subtracts an empirical correction that absorbs predictor bias and sampling error.
Useful8/10
Difficulty4/10
Novelty5/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 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
△ Mechanism confirmed, baseline not beaten
2026
Train and select neural ODE architectures using parameter sensitivities and Fisher information, so that a model is penalized or rejected when different parameters produce nearly indistinguishable trajectory effects. The neural component remains inside the ODE vector field, but its width, depth, and parameterization are selected using predictive error together with the smallest Fisher-information eigenvalue, effective rank, and confidence intervals.
Useful8/10
Difficulty6/10
Novelty7/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
✗ Mechanism failed
2026
Replace independently injected federated-learning noise with communication noise whose variance increases with disagreement between a client update and a server or neighboring-client reference. Combine this with a contractive server update so that the sensitivity of later communicated updates decays geometrically, reducing cumulative privacy loss relative to naive composition. The method is suitable for decentralized SGD, FedAvg, or distributed fine-tuning.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Construct a prescribed-performance funnel directly from state-only demonstrations, then train a state-feedback neural network whose output is bounded and whose gain is optimized to keep the tracking error inside that funnel. The controller should not imitate actions; it should reproduce the demonstrated transient and steady-state error geometry while explicitly reducing feedback authority whenever actuator saturation would make the funnel infeasible.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the Gaussian trajectory predictor inside an inference-time planner or model-based reinforcement-learning policy, optimizing a nominal action sequence together with affine feedback gains against predicted disturbances. The resulting controller reacts to realized model residuals rather than relying on open-loop neural rollouts, while preserving a convex quadratic structure when the prediction map and covariance are frozen.
Useful8/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Treat one optimizer update as a stochastic dynamical map and estimate its local contraction margin from recent parameter-update or gradient residuals. Reduce the usable margin, and therefore the learning rate or trust-region radius, by a Wasserstein/heavy-tail penalty based on online excess kurtosis so distribution shifts cause graceful step-size shrinkage rather than sudden divergence.
Useful8/10
Difficulty5/10
Novelty7/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 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
Treat the optimized surrogate and the training trajectory as objects that require a decision-level audit. Use multistart optimization to count phantom optima, and periodically evaluate whether stochastic training has changed the surrogate optimum even when validation prediction error remains nearly constant; stop, roll back, or average checkpoints when decision drift exceeds a threshold.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Mechanism failed
2026
Attach a Gaussian condition discriminator to an intermediate neural representation and train it adversarially against the fault classifier. The discriminator predicts both the mean and uncertainty of a continuous operating condition, forcing the encoder to remove condition-dependent variation without treating the condition as a small set of artificial domains.
Useful7/10
Difficulty4/10
Novelty5/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
✓✓ Beats tuned baseline
2026
Replace the final layer of a neural predictor with Bayesian linear regression over deterministic trigonometric features, retaining a computable posterior variance and a high-probability confidence envelope over the full bounded input domain. Use this envelope to reject unsafe actions, downweight uncertain training targets, or restrict optimizer updates in regions where the network is extrapolating.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Use critical-slowing-down statistics from the delayed dynamical system to detect when training approaches an oscillatory instability. Rising lag-one autocorrelation and variance, together with a recovery-rate estimate approaching zero, trigger a learning-rate or momentum reduction before loss divergence occurs.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Mechanism failed
2026
Add a dedicated near-zero-loss Langevin phase after ordinary training, with inverse temperature increased while the optimizer remains stochastic. The dynamics should preferentially spend time in high-dimensional or singular regions of the zero-training-loss set, providing a concrete mechanism for selecting solutions that are more robust to parameter perturbations and may generalize better.
Useful7/10
Difficulty4/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
Regularize a neural decision policy against economically harmful changes in its action when the predicted price ordering is perturbed. Targeted swaps of extrema and threshold-adjacent entries directly test the paper’s mechanism that a small number of ordering mistakes can cause a disproportionate revenue loss.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train a lightweight auxiliary predictor C_phi(s) for the probability that the current policy will eventually fail from state s, then bias environment resets, replay sampling, or data replacement toward high-criticality states. Correct the resulting policy-training samples with importance weights so the expected gradient still targets the original data distribution rather than an uncontrolled failure-only objective.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Replace unconstrained neural-network updates by updates projected toward directions supported by a recent, regularized gradient or feature subspace. This transfers PRPC's errors-in-variables correction: directions that are weakly identified by noisy or rank-deficient minibatches receive stronger shrinkage, preventing large updates caused by accidental correlations. The method is especially suitable for recurrent, world-model, and small-data fine-tuning problems where minibatch covariance is…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace deterministic LoRA importance scores with one-sided tests of whether each rank-one update has population contribution at least a user-selected threshold. Maintain empirical contribution samples during fine-tuning, estimate their uncertainty, and prune the components with the weakest statistical evidence while respecting the target rank budget. The method should avoid deleting components merely because their latest minibatch gradient was small.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a finite-resolution observation channel between minibatch statistics and the optimizer update, then distinguish information that predicts useful future loss reduction from information that is present in the gradient but has no control value. Use the actionable representation to select the update and suppress increasingly fine, noisy measurements that do not improve progress.
Useful7/10
Difficulty6/10
Novelty7/10