✗ Failed on benchmark
2026
Use discovered infinitesimal generators to create small continuous transformations of hidden states and force a neural predictor to commute with those transformations. This converts symmetry discovery into self-supervised augmentation without prespecifying a group, canonical coordinates, or hand-designed equivariant layers.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a latent neural state-space model with an observable-coordinate residual that is first learned flexibly and then projected onto a constrained library of interpretable coupling terms. Train or collect data only after checking that the trajectory sufficiently excites the candidate terms; this prevents a latent model from fitting arbitrary hidden-state effects that are unidentifiable from the observations.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Augment a neural dynamics model with a separately trained discrepancy predictor and calibrate an asymmetric conformal residual score. Use the resulting state- and input-dependent uncertainty set to reject, damp, or regularize neural rollouts when they leave a calibrated region, rather than treating all residual directions as equally uncertain.
Useful8/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Add a sensitivity-aware stability monitor and regularizer to an RNN, neural state-space model, or linearized sequence model. Instead of evaluating the model at many perturbed inputs or parameter settings, estimate how each perturbation changes the dominant eigenvalues of the local hidden-state Jacobian, then penalize perturbations predicted to push eigenvalues toward the unit circle. This should improve long-horizon behavior while identifying a quantitative perturbation radius at which…
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use a neural dynamics model together with an online uncertainty radius to tighten rollout constraints, action bounds, or latent-state trust regions. The controller or training loop becomes conservative when the predictor is data-poor or exposed to correlated trajectories, and relaxes constraints as uncertainty shrinks. This directly transfers the paper's uniform-in-time confidence-bound and robust recursive-feasibility mechanism to neural world models and safe reinforcement learning.
Useful8/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a recurrent or implicit neural layer with a local bifurcation monitor that estimates the scalar return-map coefficients A, B, c, and d near a latent fixed point. Penalize trajectories approaching the predicted fold or grazing curves, or deliberately target selected chambers when multistability is useful. The method converts local Jacobian and finite-difference measurements into a falsifiable prediction of when latent fixed points appear, disappear, or change stability.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Constrain the Jacobian of a neural ODE or recurrent transition so that its second additive compound is Metzler and irreducible, then regularize the resulting finite-window wedge transition toward strict positivity. This should contract projective distances between admissible tangent 2-planes, causing perturbation planes to align and making long-horizon representations effectively two-dimensional rather than allowing uncontrolled orientation growth.
Useful8/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace noisy pointwise derivative matching in a neural state-space model with a weak-form Koopman-generator residual. An encoder maps observations to latent observables, while a learned matrix generator propagates those observables. Integration by parts removes the need to differentiate noisy trajectories and provides a controllable noise-averaging mechanism.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace pointwise spectral-norm contraction in a recurrent or state-space model with an average logarithmic contraction certificate for an input-conditioned fibre update. Let a base state carry expressive, possibly noncontractive dynamics, while an auxiliary latent fibre contracts on average. This should preserve useful variability in the base while preventing long-horizon fibre explosion and making the fibre converge to an input-dependent invariant section.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Equip a learned dynamics model with an adaptive parameter estimate and an explicit component-wise uncertainty box. Require a nominal backup-policy rollout to remain inside a safety margin equal to the rollout's worst-case parameter sensitivity, producing a conservative filter for reinforcement learning and world-model planning that becomes less conservative as the model identifies its parameters.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace ordinary empirical-risk minimization on pooled heterogeneous data with worst-case conditional risk over joint distributions that remain close to every source under an optimal-transport budget. The adversary transports source context-label pairs toward high-loss, target-event-like examples, while source-specific radii prevent arbitrary shifts. This should improve performance on rare target contexts and unseen domains without requiring abundant target labels.
Useful8/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's tail comparison to decide when another call from the same verifier family is useless and when to switch to a different model, modality, or evidence source. The objective is to reduce the high-alpha survivor population—the incorrect examples that consistently fool one verifier—rather than maximizing average one-shot verifier accuracy.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a standard recurrent update with a two-state absolute-value cell whose local dynamics are exactly piecewise affine. Train the coupling parameters while enforcing discrete-time Schur inequalities inside each activation quadrant, preventing exploding recurrent trajectories while retaining nonsmooth gating and richer dynamics than a globally contractive linear cell.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a reachability loss that forces annotated structural endpoints or landmarks to remain connected through high-confidence pixels. Instead of averaging error over all pixels, the loss penalizes the weakest pixel on the best available path, directly targeting bottlenecks responsible for broken vessels, roads, and cracks.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or state-space update with a block whose state Jacobian is contractive and whose input Jacobian has a controlled gain. This should make hidden-state discrepancies caused by initialization, quantization, or input noise decay geometrically rather than explode, while retaining a finite and predictable response to persistent input perturbations.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Use the paper's explicit compact factor of a symplectic state-transition matrix to measure aggregate rotation speed in hidden-state dynamics. Penalize excessive or rapidly varying angular velocity rather than penalizing the full recurrent matrix, preserving nontrivial Hamiltonian rotations while suppressing phase drift that can destabilize long sequences.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an expensive nonlinear rollout of a recurrent or neural state-space model by a locally affine rollout whose Jacobian is evaluated once at the current state and then frozen over a short horizon. Use the resulting transition matrix as an explicit stability monitor and optionally penalize or clip its spectral radius, reducing exploding long-horizon predictions without forcing the entire nonlinear network to be globally contractive.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Train a low-dimensional projection of embeddings against centered pairwise geometry instead of only using raw-distance preservation or a JL-style guarantee. The loss removes the population or minibatch distance baseline before comparing distances, forcing the bottleneck to retain the fluctuations that carry ranking and task information.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace ordinary token merging or graph pooling with a learned block map whose output preserves information about a remote target conditioned on the surrounding coarse representation. The paper's majority-spin counterexample gives a concrete failure mode: two microscopic configurations mapped to the same pooled token can imply different predictions for distant variables.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace independent feature, expert, or edge dropout by sampling subsets from a forest-induced strongly Rayleigh distribution. The distribution is multiaffine and negatively dependent, so selecting one computational route suppresses redundant correlated routes without the positive correlations created by independent or blockwise heuristics. Use the sampled subset as a structured mask during training and compare it against Bernoulli dropout at equal expected sparsity.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Use explicitly stochastic latent dynamics to detect hidden-state changes that are invisible in the observed output spectrum. Near the integral-memory regime, constrain or monitor cross diffusion with a forward-versus-reverse path statistic, preventing output-equivalent latent models from developing physically implausible irreversible dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace ordinary row-softmax attention with a doubly stochastic Sinkhorn attention plan W, and periodically recover a gauge-fixed pairwise cost from W using the exact double-centering identity. Use this recovered cost to initialize or regularize a structured attention score, making the attention geometry identifiable despite arbitrary query and key row and column offsets.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace fixed Gaussian noise in a private optimizer with generalized-Gaussian noise whose shape p is selected for the actual clipped-gradient sensitivity and privacy budget. For every candidate p, numerically find the minimum scale b satisfying the hockey-stick privacy constraint, then choose the p minimizing a gradient-update utility moment such as variance or expected absolute magnitude.
Useful7/10
Difficulty5/10
Novelty7/10