Unverified
2026
Replace an unconstrained recurrent memory with a truncated path-signature state that is updated continuously from the input control path. Feed this structured state to a learned vector field, allowing the model to represent path-dependent dynamics through iterated integrals of the entire history rather than only the latest hidden state.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a dense learned linear operator on continuous or image features by a truncated Hermite projection expansion whose coefficients are directly regularized in a Schatten-p norm. The layer becomes a structured low-rank operator, while the radial Hermite-Laguerre correspondence provides an analytically tractable parameterization and an exact spectral penalty.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use deadline objectives to train or control a router that explicitly trades off completion probability against completed work by a fixed horizon. Begin with fair allocation for robust exploration, then anneal toward a feedback-greedy rule once per-item difficulty estimates have sufficient evidence.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the linear state transition in a small recurrent or state-space module by a circulant matrix acting on a vector over a finite field. The hidden state then has only finitely many possible values and follows an exactly periodic orbit after at most \(q^n\) states, eliminating numerical drift on modular-counting and symbolic-memory tasks. A learned real-valued encoder and decoder can surround the discrete core, while the transition itself is fixed, searched, or trained with a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace generic projected-gradient iterations for equality-plus-bilateral constraints with an active-set semismooth Newton layer. Each iteration fixes currently active lower and upper bounds and solves one structured saddle-point system, potentially converging in a few iterations when only a small subset of constraints is active.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a dense token-mixing matrix in a sequence model with a fixed or learnable SBP derivative operator D=P^{-1}Q. The discrete integration-by-parts identity makes the interior mixing energy-neutral or boundary-dissipative, reducing exploding activations in deep residual stacks while preserving directional information along the sequence.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a profile-preserving exchange layer that mixes representations through pairwise state swaps, with weights shared over all positions. Unlike ordinary token-wise MLP mixing, the layer explicitly models interactions between two categorical states while respecting the symmetry of position permutations.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Equip multiple recurrent agents with a shared spatial or token-level trail field whose influence is a bounded function of accumulated visitation, rather than an unbounded additive memory. Use the paper's simultaneous/sequential invariance as a falsifiable design target: parallel and randomly ordered asynchronous agent updates should produce nearly identical predictions when trail occupancy is saturated, while deliberately nonsaturating controls should show order dependence. This can enable…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the usual unconstrained PINN output u_theta(x) with a latent field w_theta(x), and reconstruct the physical solution as u_theta(x) = -2 log cosh(w_theta(x)). Train w_theta to be convex while enforcing the Liouville or real two-Hessian PDE residual and the boundary condition u = 0. The transformation automatically gives u less than or equal to zero, matching the target solutions, while convexity supplies a strong global shape prior.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace explicit quotient construction by a differentiable projection that removes learned group-orbit directions from both source and target features. The paper's reduction argument shows that a closed level constraint makes the restricted form horizontal, so the network can operate on invariant coordinates while retaining a measurable residual for symmetry leakage.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the paper's crystal parenthesis matching as a deterministic local search over a sequence of MoE expert assignments. For adjacent experts i and i+1, pair assignments according to the crystal rule and move one unpaired i to i+1 only when this reduces expert-load imbalance. This provides a structured alternative to relying exclusively on an auxiliary load-balancing loss.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a graph-neural layer that analytically eliminates fast auxiliary nodes inside repeated decorated motifs and replaces each motif by an effective edge or hyperedge. The effective interaction is computed from the log-partition function of the eliminated variables, while a residual neural correction can model violations of the assumed local motif structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a rational-like feature transformation with an auxiliary state y constrained by polynomial equations G(x,y)=0, and update x and y jointly along the tangent space of that constraint manifold. This creates residual blocks in which nonlinear feature identities remain consistent over many layers or time steps, reducing auxiliary-variable drift and potentially stabilizing rational activations and implicit recurrent dynamics.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a feature transformation that approximates the derivative of a fractional diffusion operator with respect to its order. Instead of only smoothing features with one fractional order, the layer exposes whether a feature changes rapidly across spatial scales, which can help with textures, edges, and multiscale patterns.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Parameterize a cell-complex neural network by features on p-cells and derive lower-dimensional boundary features using the cellular boundary map over F2. For a 2D square complex, neighboring plaquette bits determine each link feature through XOR, reproducing the paper's exact gauge-law reconstruction and preventing the network from representing inconsistent open boundary configurations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use mutually orthogonal Latin labels as deterministic expert assignments for token batches. Each routing family is individually balanced, and pairs of families avoid repeated co-assignment patterns, enabling multiple routing rounds or auxiliary experts without the severe load collisions caused by independent random hashing.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace activation-magnitude-based adaptive computation halting with a criterion based on the actual recurrent update and a local stability margin. The loop halts when the state change is small relative to state scale for several consecutive steps, avoiding pathological decisions when LayerNorm-driven dynamics cause the activation norm to collapse.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independent top-k MoE routing with a submodular polyhedral allocation over experts. A learned set function assigns a marginal gain to each additional expert allocation, so the router exhibits diminishing returns and can enforce global capacity constraints rather than making unrelated per-token choices. The allocation is obtained by sorting marginal gains, giving a fast greedy router with piecewise-linear routing regions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained Fourier-feature block in an implicit neural representation or coordinate MLP with a sparsity-aware layer whose output gain is normalized according to the distance outside the training interval. The normalization uses the paper's endpoint law, preventing a small in-domain Fourier representation from producing arbitrarily large outputs just beyond the observed coordinate range.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace independent coordinate rounding of a fixed-sum vector with nearest-point quantization in the projected integer lattice A_n^*. The quantized vector preserves the zero-sum constraint exactly, while the globally optimal rounding correction accounts for the aggregate residual induced by projection.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a single smooth inverse predictor near detected ambiguity boundaries with multiple prediction branches and a soft gate. The gate is trained to preserve distinct decompositions rather than forcing the network to interpolate through a thin high-curvature transition layer, while a Jacobian or curvature penalty identifies unresolved ambiguity regions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a coordinate-aware long-range aggregation branch whose singular low-frequency component is explicitly centered before it is mixed into token representations. The centering acts as a neural counterterm: constant or slowly varying value fields cannot accumulate an activation contribution that grows with context size, while local and higher-frequency interactions remain available through an ordinary attention residual branch.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn a recurrent or state-space memory into a constrained hereditary state: the latent state remains in a learned convex domain, and only input motion that reaches the boundary changes the plastic component. This creates a nonexpansive, rate-independent memory that should suppress unstable state growth and make the representation depend on meaningful cumulative changes rather than arbitrary update frequency.
Useful6/10
Difficulty4/10
Novelty5/10