Unverified
2026
Construct a sparse message-passing graph from a tree backbone by subdividing every backbone edge and attaching leaves so that 2d_T1(x_i)+f_i is constant across backbone vertices. Use this graph as a fixed communication skeleton, with propagation weights calibrated by the predicted spectral radius. The same construction can be compressed into an effective backbone operator by eliminating subdivision and leaf nodes.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct the latent transition from a nondegenerate bilinear form phi and a form-compatible operator instead of from an unconstrained dense matrix. The resulting SSM has an exact orthogonal or symplectic algebraic structure, reducing transition parameter redundancy and testing whether preservation of a latent pairing improves extrapolation on reversible, parity-sensitive, or Hamiltonian-like sequence tasks.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a periodically driven hybrid recurrent state-space model whose vector field is piecewise smooth across learned switching surfaces. Engineer a transverse homoclinic intersection around a hyperbolic recurrent state; the resulting shift-like invariant set provides a controllable symbolic reservoir for sequence prediction and long-horizon generation.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Build a neural architecture whose receptive field or attention span is increased according to an estimated disorder-to-order crossover scale. Local branches process windows below the crossover as if they were stochastic, while a global branch is activated only when the context exceeds the predicted scale needed to expose deterministic recurrence. This targets sequences or images containing long-range quasiperiodic, hierarchical, or algorithmically generated structure that is statistically…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build an implicit layer from a piecewise-linear maximal monotone operator on visible variables z_* and auxiliary variables z_**, then eliminate the auxiliary block rather than exposing it in the network output. Compute the layer through a fixed point of the eliminated component of a nonexpansive resolvent, with damping when the auxiliary map is not strictly contractive.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Factor a neural linear layer as W = M A, where A is randomized at initialization and M is a deterministic channel mixer or learned feature transform. Regularize M toward low inverse-Hilbert–Schmidt norm under a scale constraint, because the paper's theorem predicts that this raises the high-probability lower bound on s_min(W) and reduces near-singular initialization events.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a standard two-layer multiplicative interaction block with auxiliary positive features X whose neighboring products generate two coupled feature grids x and y. Add the Y-diamond recurrence as either a hard recurrent update or a differentiable consistency loss, forcing local interactions to obey the same compatibility structure as an SL2/Y-frieze.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Augment pairwise attention on a set of n tokens with a rigidity operator derived from normalized pairwise directions. The operator couples infinitesimal node displacements through changes in pairwise distances, while the complete-graph theorem provides a geometry-independent eigenvalue target n/2 after spherical centering and normalization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct two latent variables X and Y with exactly the same marginal distribution, while forcing their difference X-Y to follow a chosen centered noise or residual law. Insert the pair into a residual, VAE, or diffusion block so that the model receives the desired perturbation without changing the marginal latent distribution at either endpoint. This creates a controlled alternative to independently sampled noise, especially when marginal drift in repeated stochastic layers is harmful.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a piecewise Möbius transformation as a deterministic latent mixing layer, using the paper's exact branch structure rather than a generic unconstrained MLP. The transformation repeatedly moves points between branches while preserving a known reference density, creating a cheap chaotic mixer with analytically computable Jacobian factors. Use a truncated, normalized version in practice so that the sigma-finite invariant measure becomes a valid finite training distribution.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the complex-conjugate palindromic coefficient that cancels the leading temporal phase defect of oscillatory modes. Implement complex arithmetic directly or use an exactly equivalent doubled-real state, then project the final state to its real component for real-valued prediction tasks.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained linear residual adapter by an operator \(T\) satisfying a polynomial relation in the commutator operator \(\Delta_A(X)=AX-XA\). Choose the polynomial roots in a stable half-plane so that repeated commutators become nilpotent, making repeated adapter application terminate algebraically and permitting a finite-polynomial inverse of \(I+T\).
Useful4/10
Difficulty6/10
Novelty9/10
Unverified
2026
Represent the active experts or channels of a sparse layer by a presence set and impose a reaction-style dependency graph on possible support changes. During a growth phase, activate only the least support set closed under enabled dependencies; during later pruning, allow trajectory-dependent removals but never add structurally unreachable experts. This should reduce routing churn and dead experts while preserving adaptive sparsity.
Useful4/10
Difficulty5/10
Novelty7/10