✗ Mechanism failed
2026
Replace a dense recurrent transition matrix with a periodic CMV-style product of alternating local 2x2 unitary cores. The transition is exactly norm-preserving, has O(n) trainable parameters under periodic tying, and can be applied through local factor operations rather than stored as an n-by-n matrix. Use turnover refactorization when changing the ordering or boundary connection of cores, enabling a compact cyclic unitary state-space layer.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace the usual linear predictor in continuation of an implicit neural state with a fractional-power predictor fitted from recent states, then correct the prediction using a pseudo-arclength constraint. This is designed for equilibrium layers, implicit sequence models, or homotopy training schedules where the state Jacobian becomes nearly singular and ordinary Newton correction or fixed-point iteration becomes unstable.
Useful6/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Insert an active-set reduction step into a binary energy layer or Hopfield-style discrete optimizer. Coordinates whose signs are stable and whose local fields have a rigorous margin are frozen, while their interactions are folded into an induced bias and only the unresolved tail is updated. This preserves the exact conditional quadratic objective and can reduce dense interaction cost substantially when the state becomes polarized.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Augment a recurrent or state-space layer with a finite-order causal Volterra compensator that models and cancels dominant nonlinear feedback around a stable linear transition. Use quadratic terms by default and add cubic terms only when the model must operate farther from equilibrium, making truncation order an explicit compute and robustness control.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Store a convex object as a direction-indexed vertex tuple and implement composition of objects through componentwise Minkowski addition and nonnegative scaling. This creates a structured residual or compositional layer where convexification is nonexpansive, making perturbation amplification controllable and avoiding repeated generic geometric optimization.
Useful6/10
Difficulty4/10
Novelty8/10
✗ Mechanism failed
2026
Replace a standard nonlinear recurrent transition with a truncated Carleman lift containing levels $z_j\approx u^{\otimes j}$, coupled by linear maps that represent quadratic, linear, and forcing terms. The resulting transition is linear in the lifted state but still expresses nonlinear dynamics in the original state, while the highest-order omitted interaction supplies an explicit truncation-defect signal that can be used for adaptive order selection or regularization.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a static top-k MoE capacity rule with a router whose expert allocation evolves through a finite-domain coverage process. Experts with larger current occupancy can either receive more future capacity, intentionally amplifying specialization, or receive less capacity by reversing the size dependence, allowing a controlled test of the paper's asymmetry-amplification mechanism.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a dense token- or channel-mixing matrix with a product of local braid generators acting on adjacent coordinates. Each generator is an exactly invertible 2-by-2 transformation, while the braid and far-commutativity identities give multiple equivalent factorizations of the same global operator. This creates a sparse, reversible mixer with O(kn) cost for a braid word of length k, rather than O(n^2) cost for a dense matrix.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the paper's eventual path-length bounds to constrain an order-invariant routing graph to a constant-hop communication budget. A learned sparse attention or graph-neural-network layer can explicitly route information through at most three admissible hops, while a more conservative auxiliary route permits at most five minimal-path hops, preventing increasingly long and unstable dependency chains as sequence length grows.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a uniformly discretized recurrent or continuous-depth model with hybrid hidden-state dynamics: integrate a learned drift between event times, then apply a one-sided reflection update at each irregular observation or constraint event. The reflection prevents the hidden state from violating a lower obstacle, while the explicit jump decomposition avoids smearing abrupt information changes across many small residual steps.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace independent softmax expert choices with a collision-free Markov router whose particles occupy expert positions on a one-dimensional or circular index lattice. A particle can move only to an empty neighboring expert, and the move rate contains a product of sine ratios that globally repels nearby assignments; this should reduce expert collapse and produce more evenly spread routing without requiring a separate pairwise diversity loss.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Build a neural feature-mixing layer from a truncated shift S and a diagonal phase operator T satisfying TS=qST, with |q|=1. The relation forces moving one position in the graded feature basis to multiply the phase operator by q, providing a compact inductive bias for periodic, phase-sensitive, or cyclic data.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use Oja's streaming eigenvector estimate on a parameter block's incoming gradient stream, but activate its rank-one preconditioning correction only after the mathematically predicted d log d sample threshold. Before that point, the estimate is treated as unreliable and the optimizer remains close to AdamW or SGD. This prevents early noisy spectral directions from destabilizing training while retaining an O(d)-memory alternative to storing a full gradient covariance matrix.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat the maximum dependency distance faithfully modeled by a finite neural architecture as an emergent correlation length, and estimate how it grows with depth, state size, or attention span. Fit the exponent \(\kappa\) and use it as an architecture-selection signal: a model with larger \(\kappa\) should acquire long-range competence more efficiently at equal parameter or FLOP budget.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Partition a sequence, image, or graph into regions processed by a cheap local operator and a more expressive nonlocal operator, then couple their boundary activations with a shared continuity equation and a conservative interface-flux equation. The interface correction prevents the local and global branches from creating discontinuities or duplicated information, allowing nonlocal computation to be restricted to selected regions while preserving global consistency.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained residual block by a four-field feature dynamics containing a primary feature T, flux-like auxiliary features J, curl-cleaning features psi, and a scalar cleaning feature phi. Couple these fields with learned skew-adjoint spatial operators so that the reversible block preserves the squared feature norm, while a separately controlled relaxation term can remove high-frequency or constraint-violating components. Use an exact Cayley update rather than explicit Euler to…
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace unconstrained pairwise token-routing interactions with a structured two-token router derived from an involutive set-theoretical Yang–Baxter solution. The pair operator is a convex interpolation between identity and a permutation of discrete routing states, so it cannot amplify probability mass or logits when applied to routing distributions. The Yang–Baxter relation provides a falsifiable test for whether three-token routing updates are insensitive to the two admissible…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained simplex router or differentiable mixture layer with a resource-cost-aware router whose learned costs satisfy the paper's monotonicity curvature condition. Use a Euclidean-regularized Frank–Wolfe oracle to update routing probabilities, which should reduce cycling and sensitivity when several examples or agents compete for the same experts.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a neural mixing layer on Fourier or positional modes using a small set of exponentiated Virasoro generators instead of a dense mode-to-mode matrix. The generator coefficients are shared across all inputs, while the Lie bracket fixes how different mode shifts interact; an optional central channel captures the special coupling between modes whose indices sum to zero.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an ordinary graph diffusion or message-passing operator with a positive-semidefinite Laplacian whose kernel contains a prescribed node-wise subspace. The layer smooths only feature components orthogonal to that subspace, preserving global constants, positional modes, or other structural signals even when graph edges are dynamically added or removed.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
For a learned phase-space layer, estimate its symplectic Fourier bandwidth R and divide its output gain by the theorem's support-dependent factor R raised to an exponent determined by the Schatten index p. This creates a resolution-aware normalization: layers with larger phase-space bandwidth are automatically damped when p is not equal to 2, while the Hilbert-Schmidt case p = 2 remains unscaled.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a fixed top-k expert count with a stochastic, token-specific fanout generated by a supercritical binary branching process stopped at a geometric time. The resulting number of active experts has finite mean but a power-law tail with log-periodic modulation, allowing most tokens to use little compute while reserving larger computation for difficult or ambiguous tokens.
Useful5/10
Difficulty6/10
Novelty8/10