✗ Failed on benchmark
2026
Represent a stochastic recurrent or state-space model as an event trajectory and train it with trajectories conditioned on a rare terminal event, such as a catastrophic state, a constraint violation, or an unusually large prediction error. Instead of simulating forward until the event occurs, update connected spacetime clusters while holding the initial state and terminal event boundary fixed, so every retained trajectory is useful for rare-event learning. This provides a principled alternative…
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition by a sequence of exact SU(1,1) hyperbolic updates. The layer processes each token with a 2-complex-dimensional state and preserves the indefinite energy |a|^2-|b|^2=1 exactly, preventing numerical drift while retaining non-unitary amplification and attenuation.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment each recurrent or state-space hidden channel with a two-dimensional oscillatory state and periodically compute a pseudo-phase from its Cartesian coordinates. Use sparse event-triggered feedback to reduce the squared phase order parameter, preventing hidden channels from synchronising while avoiding the computation and communication cost of continuously recomputing the control signal. The controller acts as a tangent rotation of each two-dimensional hidden state, changing phase diversity…
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace a stack of independently parameterized residual or MLP blocks with a small latent grid or vector repeatedly updated by one shared transition rule. Let the number of updates depend on the current latent state, so easy examples terminate early while hard examples receive more computation, potentially improving parameter efficiency and extrapolation.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace additive recurrent pooling with a graded state containing the current feature increment, an antisymmetric order-sensitive area matrix, and an optional symmetric quadratic-variation accumulator. Compose chunks using the paper's exact group law, allowing a sequence model to retain compressed pairwise ordering information without explicitly forming all token pairs.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a graph neural dynamical system whose node states are coupled through a graph Laplacian, using the Laplacian spectral gap as a controllable synchronization mechanism. Increasing coupling strength or algebraic connectivity should selectively suppress disagreement modes, producing a measurable faster decay of node-to-node errors without requiring stronger contraction of the common mode.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the standard diagonal or identity preconditioner used when solving an implicit neural layer with a coarse/fine Schur-complement preconditioner. The hidden state is decomposed into a low-dimensional coarse subspace and its orthogonal complement; the coarse interaction is solved accurately, while the fine block receives a damped approximate inverse. The method is especially suitable for deep equilibrium models, implicit MLPs, and Newton or quasi-Newton training of residual dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed-order polynomial or recurrent state-space block by an Arnoldi basis built from a learned operator and the current input, and use subdiagonal coefficients as geometry-aware gates over Krylov depth. The gates quantify how much genuinely new direction each operator application contributes, allowing the layer to stop early near Krylov breakdown and suppress redundant or unstable directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a response-spectrum monitor to recurrent, state-space, or deep-equilibrium networks by treating products of hidden features as composite observables. Estimate the full susceptibility and a bare susceptibility, reconstruct an irreducible interaction vertex, and damp the state update whenever the leading Bethe–Salpeter eigenvalue approaches one. This targets collective failure modes that ordinary single-feature Jacobian checks can miss.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace an unconstrained high-dimensional neural dynamical model with a low-dimensional latent chart whose image is trained to be an approximately invariant spectral submanifold. Tie the encoder, decoder, and latent vector field to a known symmetry representation, so symmetry-related states share parameters and reduced rollouts cannot violate the system's group action.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the paper's saddle-node sensitivity mechanism to decide which message-passing edges should be added, strengthened, or rejected. In a graph neural ODE, neural consensus layer, or recurrent graph block, estimate the critical coupling at which node representations become phase-locked or contractive, then prefer candidate edges whose predicted sensitivity lowers that threshold. This avoids the assumption that more connectivity always improves propagation and gives a topology-aware alternative…
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a neural sequence model's unconstrained multi-step latent rollout with a data-driven LPV predictor acting on a learned latent state. Build the predictor from Hankel matrices of past latent observations, inputs, and scheduling features, then use an LQ factorization to project the large data coefficient matrix into a fixed-dimensional coordinate system. The model preserves scheduling-conditioned dynamics while making rollout cost independent of the number of training trajectories.
Useful7/10
Difficulty6/10
Novelty6/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
✗ Failed on benchmark
2026
Encode a continuous or sampled multivariate time series as degree-N log-signatures on m local intervals, choosing (m,N) to minimize the number of stored scalars under an explicit linear-CDE approximation budget. Unlike fixed-size temporal patches, the representation increases temporal resolution when the path is oscillatory and increases algebraic degree when the path is smooth but strongly nonlinear.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build an implicit or unrolled graph neural operator on a symmetric simplicial mesh, and perform every symmetry-compatible linear solve in a fixed representation-theoretic basis rather than the original edge/face basis. The same basis can be reused for Poisson, Maxwell, diffusion, and learned linear combinations of DEC operators, yielding parallel independent blocks and lower peak memory without changing the discretized solution.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Construct a residual sequence or depth network whose nonnegative influence density follows a discretized noisy Fisher-KPP equation: local influence diffuses, grows when small, saturates at a finite carrying capacity, and receives state-dependent noise. Use this density to gate ordinary feature updates rather than relying only on unconstrained residual additions. The mechanism predicts a measurable propagation speed and an instability boundary, allowing the architecture to be falsified…
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace or augment a recurrent or state-space block with a small ensemble of stable linear memory lifts. Each lift stores a low-dimensional state whose repeated matrix powers generate a structured long-range convolution, and a learned gate mixes the experts using both their current predictions and their slowest block-operator mode. The module can represent multiple memory timescales without explicitly storing a long token history.
Useful7/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Use dephasing as a depth- or time-dependent control variable rather than a fixed regularizer: early layers retain coherent transport for feature discrimination, while later layers increase dephasing to eliminate unstable high-frequency oscillations. The schedule is selected from an observable spectral or correlation ratio, giving a falsifiable switch point instead of tuning noise blindly.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a single polynomial graph filter or dense inverse with a multiscale layer that applies unitary propagations at dyadic times and combines them according to the dyadic resolvent identity. For a symmetric graph operator, this implements a stable rational spectral filter that can selectively retain or suppress frequency bands while exposing logarithmic multiscale structure.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace dense pairwise interactions between all forecast horizons with nested time-shell summaries. For sorted horizons, the readout at shell j receives a cumulative embedding of all coefficients or queries assigned to later horizons, reproducing the paper's dependence on products such as \(\Pi_j=\prod_{l>j}e^{\alpha_l}=e^{\sum_{l>j}\alpha_l}\). This gives an \(O(Kd)\) multi-horizon interaction instead of an \(O(K^2d)\) temporal attention block and should work best for weak-memory…
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace scale-blind pooling or downsampling with a coarse-graining block that carries an explicit relevant scale variable \(\eta\) alongside the feature field. The block is constrained to represent features in the memory-retaining form \(h(\xi,\eta)=\eta^{\alpha}F(\xi/\eta^{\beta})\), allowing both feature amplitude and profile shape to depend on the scale inherited from the input or previous RG step.
Useful7/10
Difficulty5/10
Novelty6/10