Unverified
2026
Insert a differentiable layer that enforces multiple affine consistency constraints by running several short strings of relaxed projections and averaging their outputs. Change the strings and weights across training steps, but impose bounded string length, positive averaging weights, and an almost-cyclic coverage rule so every constraint is revisited regularly. This creates an architecture-level analogue of dynamic string-averaging rather than applying one fixed projection order.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment a local convolutional block with a fractional nonlocal-gradient branch that aggregates directional feature differences over multiple spatial scales. The residual branch gives each location access to long-range variation while preserving the property that constant feature fields produce zero response. A learnable residual gate allows the network to suppress the branch if nonlocal interactions are unhelpful.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a recurrent or graph-neural layer on a finite state space with a known bijection T, such as a modular cat map, and use the diagonal resolvent gain (1 − α^kx)^−1 as a state-dependent self-return or memory coefficient. States on short periodic orbits receive larger amplification, while long-period states receive weaker amplification, producing deterministic localization without learned disorder.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent an attention or routing state as a symmetric projector or fixed-spectrum positive semidefinite matrix and refine it using the paper's double-bracket flow instead of unconstrained gradient steps. The update rotates the state toward a task-derived Hermitian cost matrix while preserving its eigenvalues, so rank, trace, and spectral diversity remain fixed by construction.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace fixed sparse masks with a stochastic birth-death process for neural connections or spatial units. A diffusing morphogen-like utility field controls where connections are added or removed, while a local simple-point test rejects removals or additions that would disconnect a layer or alter a prescribed computational topology. This creates an adaptive sparse architecture with a tunable compact-to-branched transition rather than unconstrained magnitude pruning.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Build a low-rank trilinear attention module in which query, key, and value factors are constrained to the unit sphere and refined through a few proximal alternating sweeps. The proximal terms suppress factor oscillation and make each sweep improve a well-defined tensor interaction objective, offering a stable alternative to unconstrained tensor-power iterations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct the connectivity mask of a sparse MLP or MoE layer so that every active feature group is covered by a matching to an independent input or sample group. If the mask contains unmatched vertices, repair it with the fewest additional edges or low-rank skip connections before training. The goal is to avoid width- or sparsity-induced singular regimes that can produce sharp interpolation-like loss and generalization spikes.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Condition a temporal neural network on a tempo or dilation ratio through a homomorphism from multiplicative positive scales to additive latent shifts. A ratio composed from several scale changes then produces the sum of their learned effects, allowing interpolation and extrapolation to rates absent from training instead of using an independent embedding per rate.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a recurrent sequence classifier's unconstrained hidden-state alarm head with an online truncated-signature state and a first-hitting-time linear detector. The module summarizes local order information and cross-channel interactions while preserving exact compositional updates, making it suitable for long streaming sequences and early-exit decisions.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Augment a causal sequence model with a small hierarchy of prefix summaries weighted by powers of the logarithmic rank of each preceding token. The summaries retain order-sensitive deviations from a baseline representation while costing O(KNd) for sequence length N, hierarchy width K, and hidden dimension d, instead of O(N^2d) dense attention.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Turn the paper's graphon refinement operation into an adaptive mixture-of-experts or relational-attention router whose number of blocks is learned rather than fixed. Split a block when its members produce incompatible constraint gradients, and merge blocks when their relation rows are statistically indistinguishable, yielding a compact architecture that grows only where the data require extra structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace isotropic particle noise or unconstrained pairwise graph updates by antisymmetric, relative-velocity-tangential noise. For each pair of particles, the update lies approximately in the hyperplane orthogonal to their relative displacement and has variance determined by a regularized soft-potential kernel. This should produce stochastic exploration while reducing center-of-mass drift and violations of kinetic-energy-like invariants.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Augment a graph neural network with features generated by noncommutative words in the adjacency matrix and diagonal degree matrix. Ordered patterns such as AD^2A and DADA distinguish where degree information occurs along a walk; the paper proves that the full scalar moment family determines every tree.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Construct a sparse routing or graph-neural architecture whose activation gates satisfy a hard-core constraint: neighboring sites, experts, or token groups cannot be active simultaneously. Compare the same local routing rule on bipartite and random regular interaction graphs; the graph structure should change the maximum usable activation dimension and may also change optimization stability.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary graph propagation, which repeatedly revisits the edge it just traversed, with a directed-edge non-backtracking operator. Normalize its learned gain using an estimate of the Hashimoto spectral radius so that feature magnitudes neither explode on high-growth graphs nor vanish on sparse graphs.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a shallow neural interpolation controller to a neural ODE or state-space model so one shared vector field matches prescribed derivatives at several anchor trajectories. At every control time, compute controller weights from a small linear system instead of learning all task-specific parameters by backpropagation.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Give each query-token pair a positive adaptive edge weight that evolves by a multiplicative rule instead of relying only on instantaneous dot-product attention logits. Edges whose aggregate interaction is useful can grow, while overloaded or incompatible neighborhoods can shrink. Sparse initialization is preserved because an edge initialized at zero remains zero under the multiplicative dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a learned scalar ordering to a directed graph attention layer and retain only forward edges, producing a DAG attention mask without requiring a supplied topological order. Train the ordering with a differentiable surrogate for weighted surplus, and regularize it toward the paper's explicit half-weight-minus-l2 certificate. This supplies a principled alternative to random masking or unconstrained bidirectional graph attention when causal or hierarchical information flow is desirable.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's correspondence between KAN splines and finite-element or isogeometric shape functions to build coordinate-separable tensor-product trial layers. Replace additive coordinate aggregation with a multiplicative contraction of one-dimensional spline expansions, yielding an explicit tensor-product basis without storing a dense multidimensional grid.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a conventional softmax router or fixed halting score with a scalar confidence state that evolves as a bounded martingale diffusion. The state starts at the network's prior confidence, receives evidence-dependent stochastic increments, and is absorbed at 0 or 1; absorption selects an MoE expert or halts additional transformer blocks. State-dependent volatility lets the model explore aggressively when uncertain and commit rapidly when confident, while the martingale constraint prevents…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an explicit MoE router or constrained output head with the solution of a variational inequality over a convex feasible set. The neural operator can be nonmonotone, but training should enforce a measurable strong-pseudomonotonicity margin so the selected route or control is unique and has bounded sensitivity to changes in the token representation. Use an explicit projection residual for approximate solving and for monitoring whether the implicit layer has actually converged.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace fixed sequence-to-sequence attention with a dynamically maintained tree of connected token groups. Groups can be fused to reduce the number of attention units or split when their representation is heterogeneous, while hypergraph connectivity and nestedness ensure that every intermediate hierarchy remains valid.
Useful6/10
Difficulty6/10
Novelty5/10