✗ Failed on benchmark
2026
Replace selected residual, recurrent, or state-space blocks by modules whose input-output Jacobians satisfy an IODP inequality throughout a prescribed activation domain. The constraint controls incremental amplification between two trajectories without requiring either trajectory to remain near one fixed equilibrium, so it should improve robustness to changing contexts and prevent exploding long-horizon sensitivities.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a full-resolution global flow-matching or diffusion model with a hierarchy of local velocity fields operating on progressively finer grids. Coarse levels generate long-wavelength structure and pass it to fine levels through upsampling and residual conditioning, while every velocity network uses only a locality radius prescribed by the RG bound. This should preserve long-range correlations without quadratic global attention or a full-resolution global receptive field.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Augment an RNN or state-space model with a three-dimensional auxiliary spin updated by noncommuting rotations associated with event types or token classes. The ordered product preserves information that additive counters discard: two sequences with the same number of each event can produce different final spins when their event order differs. Train the spin axes, angles, and readout jointly with the task model while constraining every update to remain on the sphere.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Build a neural ODE or invertible transformation whose primitive layers are flows of learned gradient vector fields, then synthesize non-gradient directions using short Lie-bracket commutator products. The paper's bounded-bracket-generation result predicts that restricted gradient primitives can approximate a much larger class of diffeomorphisms than a plain stack of gradient flows.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
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
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
Replace recurrence or nearest-neighbour analogue lookup with a learned delay-coordinate observer that continuously corrects a latent state using the current observation. Constrain the observer's closed-loop Jacobian or linear state matrix to have spectral radius below one, so prediction error contracts geometrically and required burn-in grows logarithmically with target accuracy.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Partition a neural network into independently trained or independently monitored modules and constrain their cross-module interaction gain using a compositional contraction certificate. This enables stable deep modular MLPs, graph blocks, or recurrent modules without estimating the full network Jacobian, while providing an explicit coupling threshold for when the architecture loses contraction.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
For a recurrent or graph neural network with known local connectivity, estimate each node's local Jacobian row using only graph neighbors rather than all hidden coordinates. Use the resulting sparse Jacobian both to compute a contraction certificate and to regularize training toward dynamically local interactions, reducing estimator variance and the number of samples required for reliable stability decisions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained token mixer or feed-forward residual map with a feature-conditioned rational operator whose transfer matrix is positive real on the positive orthant. Apply it through a resolvent, rather than an additive residual, so that the accretivity certificate yields a nonexpansive implicit update and suppresses activation explosions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Augment a 1D neural operator or transformer with explicit tokens for detected discontinuities. Advance each front analytically using the local Rankine–Hugoniot speed and train the network only to reconstruct smooth regions and the residual caused by source terms and grid resolution.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Build a recurrent module from two finite-state factors: a normalization state and a winner-selection state. Choose or learn their coupling so that the joint transition system contains a certified composite two-cycle, giving the network a small robust memory state, while every fixed-input generator still collapses most states toward attractors. The module can be embedded in a continuous RNN using soft state assignments during training and straight-through discretization for algebraic auditing.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a standard recurrent state update or finite-order SSM filter with a causal relative-history operator using a weakly singular kernel k(s)=s^{p-1}m(s), where 0<p<1. The resulting layer retains information over a power-law range of timescales and introduces tunable frequency-dependent phase and attenuation, while remaining implementable through a small bank of exponentially decaying states.
Useful7/10
Difficulty5/10
Novelty6/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
Build a recurrent or implicit neural layer from a bipartite graph containing variable nodes and equation or mechanism nodes, rather than a directed graph containing only variables. The forward pass solves all mechanism residuals simultaneously, while an intervention replaces one selected equation and fixes its target variable; this distinguishes interventions that impose the same value through different mechanisms. The resulting module is suitable for equilibrium world models, differentiable…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single smooth neural vector field with a finite collection of smooth subnetworks selected by learned affine hyperplanes. The architecture exposes switching geometry directly, allowing it to represent friction-like or threshold dynamics without approximating discontinuities using excessively steep activations.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a conventional linear decoder in an autoencoder or latent state-space model with an explicit quadratic manifold decoder, allowing a small latent vector to represent curved and transport-like state trajectories. Add a dynamics-aware invariance loss that penalizes the discrepancy between the time derivative of the quadratic manifold and the neural dynamics evaluated on that manifold.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use trajectory sensitivities to remove neural units or parameter groups whose effects are redundant over the available data support. A parameter group is pruned when its Fisher contribution is small or its sensitivity is nearly collinear with other groups, producing a compact neural ODE without relying only on parameter magnitude.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace deterministic binary-tree pooling or hierarchical feature aggregation by a stochastic merge that chooses either elementwise addition or elementwise minimum. The mixing probability p controls whether zero or sparse states proliferate or disappear, with a predicted absorbing-state transition at p = 1/2.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Add an online receptive-field expansion monitor to a graph neural network and use it to gate message-passing depth or invoke graph pooling. For a sampled node set F and propagation neighborhood K, continue fine-scale propagation only while the growth ratio |KF|/|F| is close to one; when it is persistently expansive, replace further propagation with pooling, local attention, or long-range skip messages. This transfers the paper's Følner-versus-paradoxical mechanism into an architecture-level…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace part of a CNN or continuous-depth feature block with two coupled feature fields. One field is transported up gradients of the other through a conservative cross-gradient flux, creating adaptive spatial organization that ordinary diffusion or symmetric convolution cannot produce. The coupling strength and dominant wavelength are controlled by a directly testable linear-instability boundary.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Construct the sparse transition matrix and input projection of a recurrent or state-space layer so that every hidden-state row is covered by a matching in the controllability core. This prevents hidden directions from becoming unreachable from the input sequence, especially in multi-input systems and across a distribution of transition matrices or task conditions.
Useful7/10
Difficulty5/10
Novelty7/10