✗ Failed on benchmark
2026
Train a neural barrier function that certifies a lower bound on the probability of reaching a target before entering an unsafe set, uniformly over an entire compact set of initial states. Add boundary and expected-drift penalties to a learned world model or policy, and enforce a positive slack margin rather than fitting only pointwise trajectories. The mechanism should improve safety under distribution shift because the certificate constrains one-step stochastic transitions throughout the…
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Add an observability objective to an RNN so that a finite trajectory of selected hidden coordinates preserves information about the initial hidden state. The regularizer maximizes the smallest singular value or log determinant of the finite-horizon observation Jacobian, counteracting ReLU activation masks that erase hidden-state directions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace uniformly spaced history taps in a neural state-space encoder with a fixed or learned set of non-uniform delays. Regularize the resulting delay-observation matrix to have a large smallest singular value, which makes latent-state reconstruction less sensitive to irregular timestamps and observation noise. This is directly applicable to event-based data, missing timestamps, and systems with multiple time scales.
Useful8/10
Difficulty6/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
Constrain a neural policy or recurrent dynamics model to be order-preserving, then construct upper and lower abstract transitions by evaluating monotone maps at opposite corners of each state-action cell. Train with a loss that rewards the upper abstraction for reaching safe target cells and the lower abstraction for avoiding unsafe cells, while reporting the undecided gap as a quantitative certificate.
Useful8/10
Difficulty6/10
Novelty7/10
✗ 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
✗ 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
✗ 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
✗ 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
✗ 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
✗ 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
✗ 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
✗ Failed on benchmark
2026
Use the random-attractor construction as a training and inference diagnostic: initialize latent trajectories far in the past with different states but the same recent noise sequence, then measure whether they contract toward the same current set. This detects whether a stochastic recurrent model has a bounded, reproducible random attractor or instead exhibits discretization-induced divergence and spurious long-term modes.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a deterministic graph propagation layer by a stable stochastic linearized latent dynamics whose frequency-resolved covariance matrix defines spectral bands. Train or initialize the graph operator so that a selected covariance band has a nonzero Chern number and remains separated by a measurable spectral gap, producing representations that are robust to local perturbations and can support boundary-localized responses.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Add a local bifurcation monitor to a neural ODE, continuous-time RNN, or state-space model by computing the central determinant and central trace from characteristic invariants of the state Jacobian. Their directional derivatives along the zero-eigenvalue direction estimate the BT coefficients and predict whether the model is approaching a codimension-two transition, allowing training to avoid destructive criticality or intentionally preserve a useful long-memory regime.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Treat the input- or minibatch-dependent Jacobians of a recurrent or state-space network as a random derivative cocycle, and regularize its second Lyapunov exponent away from the first while independently placing the top exponent in a target stable range. This transfers the paper's equivalence between quasi-irreducibility, projective contraction, and a vertical spectral gap into a measurable training objective and a long-horizon stability monitor.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat optimizer stochasticity as an effective temperature and periodically apply a small temperature pulse, such as a temporary change in minibatch size, learning rate, dropout, or Langevin-noise amplitude. Measure the transient excess optimization dissipation and use its integrated response as a heat-capacity-like signal; sharp peaks provide a principled trigger for learning-rate changes, regularization changes, or phase-transition logging.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach an SU(2) transport matrix to every directed edge of a graph neural network and penalize nontrivial plaquette holonomies instead of penalizing individual edge transformations. The regularizer is invariant to arbitrary local changes of latent representation frame, encouraging path-consistent relational features without requiring all edges to share one global coordinate system.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Pair a neural latent dynamical system with a reference latent system driven by the same external input, and train a coupling or controller so that a synchrony residual converges to zero. The target is transverse stabilization of a behavior-equivalence manifold rather than pointwise tracking of one selected trajectory or equilibrium.
Useful7/10
Difficulty6/10
Novelty7/10