✗ 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
At a learned switching hyperplane, replace ambiguous hard routing by a convexified vector field whose normal component is zero whenever neighboring vector fields point toward the surface. This gives a non-chattering approximation of Filippov sliding and can improve long-horizon integration near friction thresholds, impacts, and climate regime boundaries.
Useful8/10
Difficulty6/10
Novelty8/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
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
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
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
Replace pointwise hidden-state distance penalties with a trajectory metric that measures the largest discrepancy over a short rollout. This directly controls transient amplification: two nearly identical states are considered unstable if their predicted trajectories separate at any intermediate time, even when they happen to reconverge at the final step.
Useful7/10
Difficulty3/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or neural-ODE hidden state with a positive state driven by reaction-like polynomial flows whose rate vector is modulated by inputs or context. Train the module together with an ISS penalty so bounded gate perturbations produce a bounded hidden-state deviation, preventing long-horizon amplification while retaining nonlinear computation.
Useful7/10
Difficulty5/10
Novelty7/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
Split a recurrent or state-space model into a coarse quotient state \(z_t\) and a leaf or fibre state \(y_t\), where the quotient evolves autonomously and the fibre is driven conditionally by the quotient. Constrain the two transition operators to have independently measurable contraction or correlation rates, then allocate capacity and regularization to the slower branch. This is intended for sequence tasks containing both slowly evolving global variables and rapidly mixing local variables.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a small robust quadratic-program layer to a neural controller. The network proposes an action, and the QP returns the closest action satisfying an ISS Lyapunov decrease constraint and a robust safety-barrier constraint under bounded model disturbances. This should preserve the network's behavior away from constraint boundaries while preventing unstable or unsafe actions near those boundaries.
Useful7/10
Difficulty5/10
Novelty5/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
✗ Failed on benchmark
2026
Replace an unconstrained latent ODE or recurrent update with Hamiltonian dynamics on a product of Euclidean coordinates and a Lie-algebra momentum. The momentum dynamics contain the explicit coadjoint term generated by the Lie-group structure constants, allowing the model to represent rotational or frame-dependent memory without learning this antisymmetric coupling from data.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Construct a spatiotemporal neural block from localized functions of a learned parabolic operator instead of unrestricted attention or convolution. Use one filter for fine-scale diffusion and another for coarse-scale temporal aggregation, with the scale ratio controlling information propagation. The block should suppress distant interactions while still permitting long-range mixing through coarse filters.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a discrete or one-hot recurrent state table with a low-dimensional vector memory whose event embeddings are orthogonal whenever the corresponding events are mutually exclusive in an input exclusivity graph. The module uses continuous state vectors and can therefore target dimension \(d=\xi(G)\), whereas a discrete state encoding is lower-bounded by \(N\geq\chi(G)\). This should be tested on graph-defined formal-language recognition tasks, where the graph is known and the claimed…
Useful6/10
Difficulty6/10
Novelty7/10