✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition with a decaying symmetric memory operator plus a skew-symmetric rotational operator. The skew component creates phase-shifted cross-channel memory and can represent oscillatory or circulatory temporal dependencies without requiring eigenvalues with large positive real parts.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use a full primal-dual optimization solve in the forward pass, but backpropagate only through the last r iterations starting from a detached warm-start iterate. This avoids storing the full solver trajectory while preserving the forward solution, and provides a tunable bias-versus-memory tradeoff: r=0 is a cheap surrogate gradient, while increasing r should converge toward the implicit equilibrium gradient.
Useful8/10
Difficulty4/10
Novelty6/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
✓✓ Beats tuned baseline
2026
Construct a recurrent or graph-recurrent layer with a homeostatic feedback variable and set its recurrent gain using the graph degree-moment ratio \(\alpha=\langle k^2\rangle/\langle k\rangle\). The feedback loop is deliberately placed below, near, or above a predicted Hopf boundary, allowing controlled persistent oscillations without unconstrained exploding states.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a standard mixture-of-experts router or recurrent transition-mode classifier with a gate whose logits are adapted by the robustness of temporal safety specifications. Experts represent distinct dynamical regimes, while robustness increases the probability of experts whose predicted trajectories satisfy the specification and suppresses modes producing imminent violations. This should improve mode switches and long-horizon rollout quality precisely near safety-critical transitions.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Represent a recurrent or residual network as a linear state update driven by a memoryless activation or feedback nonlinearity, then solve a data-driven quadratic Lyapunov SDP using excitation trajectories. Accept an update or parameter checkpoint only when the certificate proves contraction and bounds the disturbance-to-output gain. This should prevent exploding hidden states and give a measurable transition between stable and unstable recurrent dynamics.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace dense self-attention by a sparse attention graph whose neighborhoods satisfy the paper's size-dependent expansion condition. This preserves a logarithmically controlled route for every token subset to communicate with the rest of the sequence, reducing quadratic attention cost without allowing disconnected or poorly mixed token groups.
Useful8/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace full-state prediction in a neural simulator or neural operator with prediction of a perturbation around a cheap structured background trajectory. Compute the background defect and known linearized or nonlinear corrections explicitly, and let the neural closure model only the remaining residual. Add a residual-magnitude gate so the learned closure is suppressed when the structured solver already explains the target dynamics.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace the standard Gaussian affine reverse step with a conditional transport kernel learned from the forward transition. Given a noisy state x_{k+1}, the model predicts a full conditional distribution for x_k using a monotone conditional CDF or an autoregressive normalizing flow. This represents multimodal and state-dependent reverse transitions that cannot be captured by a single Gaussian mean and variance.
Useful8/10
Difficulty6/10
Novelty5/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
✓✓ Beats tuned baseline
2026
Replace full-state quantized write-back in a deep low-bit residual stack with quantized increment error feedback. The residual branch quantizes the proposed increment after adding the previous carry, while the carry stores the exact discrepancy; this makes the total error telescope instead of accumulating approximately once per layer.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace repeatedly applied unconstrained message passing or recurrent transition maps with a transport layer containing a coherent hopping branch and an explicit dephasing operator. Small dephasing preserves sharp, oscillatory propagation, whereas large dephasing suppresses inter-position correlations and produces stable diffusion-like receptive-field growth, which should reduce long-horizon ringing and exploding sensitivities.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use a consensus-coupled optimizer for replicated model parameters, but construct every communication perturbation so that the all-ones consensus direction remains in the Laplacian null space. This prevents topology noise, pruning, or heterogeneous communication weights from changing the common parameter trajectory while still allowing disagreement modes to be damped.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Partition graph nodes into backward-equivalent classes and run message passing on the K-node quotient graph instead of the original N-node graph. If every node in a class receives the same aggregate message from every source class and shares the same local update map, class-constant node representations remain class-constant at every layer, making the quotient computation exactly equivalent to the full GNN on that invariant subspace.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace uniform graph-convolution aggregation with a distance-aware message transform whose strength decays as \(\gamma^k\). At hop \(k\), transform the learned local evidence with \(2\operatorname{artanh}(\gamma^k z)\) before summation, so distant nodes have a provably shrinking influence window rather than accumulating unbounded noisy evidence.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace a single neural representation of a rapidly oscillatory PDE solution by a macroscopic network plus an explicitly oscillatory corrector network. Feed the network both the slow coordinate $x$ and fast coordinate $y=x/\varepsilon$, and train the resulting composite field in a variational energy objective. This targets the paper's scale-robust approximation bound rather than forcing the optimizer and finite sample set to discover oscillations of wavelength $\varepsilon$.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use the learned path only as a global proposal, then correct complete trajectories rather than endpoints. Exponentiated negative work gives self-normalized importance weights, while the same path ratio gives an independent Metropolis acceptance probability. This turns an imperfect neural sampler into an asymptotically exact sampler whenever forward and reverse path laws overlap.
Useful8/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an autoregressive rollout of a learned dynamical model with a branch-trunk factorization that predicts all future steps simultaneously. The branch network encodes the future action sequence, while the trunk network encodes the current state and query coordinates; their inner products produce the complete horizon. This removes repeated state updates during inference and gives a compact differentiable model for planning.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Augment a learned neural state-space model with an online regularized least-squares confidence set for its local linearization or last-layer dynamics, then propagate a homothetic uncertainty tube around every predicted trajectory. Use the tube to tighten RL action constraints, reject unsafe imagined rollouts, or weight training examples by certified prediction reliability. The mechanism should improve long-horizon behavior specifically when model uncertainty is large, rather than acting as an…
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a neural feedback law together with explicit well-posedness barriers, then certify the resulting closed loop using a common quadratic Lyapunov and activation-sector certificate. The controller is deployed only if the certificate proves exponential decay or a discounted quadratic-cost bound, converting training into a falsifiable stability-constrained synthesis procedure.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained neural flux Jacobian with a matrix of the form \(A(u)=H(u)^{-1}S(u)\), where \(S(u)\) is symmetric and \(H(u)\) is the positive-definite Hessian of a strictly convex entropy. Because \(A(u)\) is similar to a symmetric matrix, every characteristic speed is real. Reconstruct the flux by integrating this Jacobian along a fixed path from a reference state, and use the resulting module inside a differentiable finite-volume solver or learned dynamical model.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent or state-space transition with a finite set of mode matrices selected by a Markov routing process, while explicitly constraining the associated Kronecker operator to have spectral radius below one. This targets exploding hidden-state variances caused by rare but repeatedly visited unstable modes, a failure mode not detected by average spectral radius or ordinary Lyapunov stability.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a categorical denoiser for the clean token but convert its output analytically into the reverse CTMC jump rates using the exact forward transition kernel. This separates the easy-to-learn clean-token posterior from the quantity required by the reverse process and should keep the uniform-diffusion ELBO finite at initialization, unlike direct denoiser substitution.
Useful8/10
Difficulty4/10
Novelty7/10