△ Mechanism confirmed, baseline not beaten
2026
Replace dense attention between tokens on opposite sides of a one-dimensional boundary or segment split with a dyadic low-rank approximation of a Cauchy/Hankel distance kernel. Each distance-scale block uses O(log(1/\varepsilon)) features, and the number of active scales grows only logarithmically with context length after discarding a narrow boundary layer. This is especially suitable for a relative-position attention branch or state-space-like long-range branch, rather than arbitrary…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a large diagonalizable recurrent or state-space transition operator by a sparse set of retained oscillatory modes selected according to their contribution to the output autocorrelation. Unlike magnitude-based pruning, the objective is to preserve the power-law return signal generated by pairwise spectral differences, enabling long memory with far fewer modes.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Use the q-fractional characteristic equation as an online trust-region controller for recurrent gain or residual-memory strength. Instead of allowing the recurrent Jacobian to cross the unit-circle boundary, estimate the dominant characteristic root and rescale the feedback gain whenever it approaches modulus one.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build a delayed recurrent layer whose state update contains explicit taps at lags k tau, and monitor whether its linearized dynamics support periodic or antiperiodic modes over a window of length m tau. Use the smallest singular value of the corresponding periodic-boundary residual as a bifurcation margin: values near zero indicate that a new oscillatory memory mode is being created or destroyed. The margin can be used either as a diagnostic or as a regularizer that keeps training away from…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a data-fitted PCA bottleneck followed by a sparse multivariate Hermite polynomial head for a Gaussian-like latent representation. The head explicitly represents low-order and selected high-order interactions, while PCA controls high-dimensional input and output truncation error instead of forcing a generic MLP to learn these structures from scratch.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent matrix by a structured asymmetric circulant coupling whose Fourier modes have analytically known complex eigenvalues. A selected nonzero mode becomes a rotating attractor, providing a phase-coded recurrent state that can preserve information through oscillatory dynamics without requiring the optimizer to discover a stable spectral structure from scratch. A weak input projection and optional mode-selection loss can use the attractor as a nonlinear memory…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a conventional two-layer channel mixer in a reversible architecture with the tropicalization of two cluster mutations. For every pair of channels, the block applies sign-dependent integer shears and reflections, giving a cheap piecewise-linear transformation that is exactly invertible and requires no stored activations during backpropagation. Continuous trainable affine scale and mixing parameters can be placed around the fixed tropical core.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Replace quadratic self-attention over a sequence with a bank of K auxiliary exponentially decaying states whose rates are fitted directly from the empirical autocorrelation of the sequence features. Each mode captures a distinct time scale, so the module can represent short- and long-range dependencies with O(TK) computation and O(K) recurrent memory rather than storing all previous tokens. Constrain decay rates to be positive and use the paper's extended Markovian block structure to obtain a…
Useful7/10
Difficulty5/10
Novelty4/10
✗ Mechanism failed
2026
Replace magnitude-based channel or expert pruning with a subset-selection objective that maximizes the weakest direction in the candidates' activation span. Relax the binary mask to continuous gates, optimize an entropic soft minimum eigenvalue, and round the gates to retain a fixed number of channels or experts. This should preserve diverse representations and reduce redundant feature directions.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a dense graph-attention or token-mixing matrix by a resolvent-like interaction operator and truncate it to graph neighborhoods whose radius is selected from an estimated spectral gap. Unlike fixed-window sparse attention, the sparsity level is tied to a measurable stability parameter and has an explicit exponential tail criterion.
Useful7/10
Difficulty6/10
Novelty6/10
✓ Mechanism works
2026
Replace a large graph submodule by a compact boundary response operator that maps boundary node features to induced boundary fluxes after the interior has been eliminated. Stack these operators recursively to obtain a hierarchical graph neural network whose coarse-level computation preserves long-range effects of discarded vertices more faithfully than average pooling or simple node clustering.
Useful7/10
Difficulty6/10
Novelty6/10
Audited (legacy)
2026
Replace uniform embedding dimensions with a globally budgeted allocation based on the estimated spectral complexity of each categorical feature. Tables whose category representations have large leading singular-value energy receive more dimensions, while high-cardinality tables are penalized because each extra dimension consumes more parameters.
Useful7/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace random node or token subsampling by a subset selected to preserve the averages of low-frequency graph signals exactly or approximately. Build a graph over nodes or tokens, compute its Laplacian eigenspace, and choose a fixed-cardinality subset whose eigenvector moments match those of the full graph; use the retained subset for graph pooling or downstream attention.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a residual neural network or graph message-passing layer whose skip edges are sampled with probability proportional to their distance as $|i-j|^{-(1+\sigma)}$, while retaining a small local backbone. The paper's mechanism predicts that coarse-grained propagation is governed by the long-range kinetic operator and is therefore asymptotically insensitive to the particular Bernoulli graph realization, yielding controllable superdiffusive information transport without dense all-to-all…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use paired recurrent channels with exactly reciprocal gains while applying a common phase rotation. One channel carries a controlled expanding mode and the other a matching contracting mode, creating a tunable hyperbolic memory spectrum without the optimization fragility of an unconstrained recurrent matrix.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Use the weighted feature Gramian to remove nearly dependent Fourier, sinusoidal, or dictionary features during training instead of relying only on magnitude pruning. The criterion detects redundant directions even when their learned coefficients are individually large, improving conditioning of the linear readout and reducing inference cost.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Represent hierarchical or tree-structured hidden states on words over d symbols and replace a dense mixing layer by a noncommutative Toeplitz operator composed of shared word shifts. Coefficients are reused at every tree location, so the parameter count depends on maximum interaction depth rather than the number of nodes; an optional spectral penalty controls the amplification profile of finite-depth truncations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent an iterative neural computation as a controlled dynamical system and learn sparse residual corrections that are active only for a finite prefix of iterations. Estimate local stable and anti-stable subspaces of the hidden-state Jacobian, increase the correction horizon only while the anti-stable component exceeds a tolerance, and force later controls to zero. This produces adaptive-depth inference with a quantitative stopping criterion.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained message-passing or recurrent propagation matrix by a directed-edge operator with non-backtracking connectivity and orientation-dependent turning phases, inspired by the Kac–Ward construction. During training, monitor and control the zero-momentum spectral gap of \(\mathcal A(0)=I-K(0)\), keeping the model near but on the stable side of the critical surface to obtain long memory without uncontrolled amplification.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Initialize a stable diagonal state-space layer with decay rates \(\omega_i=|\xi_i|\), where \(\xi_i\sim\mathcal N(\mu,\sigma^2)\), instead of using a narrowly clustered rate distribution. The nonzero density of rates near zero creates a population of slow modes whose aggregate impulse response has an algebraic tail, enabling long-horizon memory while every finite-dimensional mode remains exponentially stable.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Insert a proximal layer after a graph, mesh, or spherical convolution that groups all coordinates belonging to the same Laplacian eigenspace and applies one shared shrinkage gate to the whole group. Unlike coefficientwise spectral pruning, the result is unchanged if the eigenvectors inside a repeated eigenspace are rotated, preventing arbitrary basis-dependent feature selection.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent transition with a second-order resonant state whose restoring matrix is full-rank but whose damping is low-rank. The low-rank damping creates a small set of rapidly controlled bright modes and a large dark subspace with long memory, while a small optional damping term prevents numerical drift in completely dark modes.
Useful6/10
Difficulty5/10
Novelty6/10