Unverified
2026
Add a causal memory branch whose weights are generated by the paper's power-type Volterra kernel rather than learned independently at every lag. Learn or softly constrain the exponents so the model can select rough short-memory behavior or smoother long-memory behavior while using only a few parameters. The branch can be implemented as a truncated causal convolution, a multiresolution approximation, or a recurrent state-space realization.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use Kemeny’s constant as a diffusion-quality gate when adding shortcut edges or cliques to a graph used by a GNN. Candidate augmentations are accepted only when they reduce estimated average hitting time, preventing rewiring operations that superficially shorten paths but make the random walk mix more slowly.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace uniform or purely loss-driven update allocation with a scheduler that targets both the mean update rate and the temporal variance of updates for each parameter group, task, or expert. At every training step, assign the available minibatch slots or accelerator workers to groups with the largest weighted deficits, preventing starvation while avoiding highly bursty update streams that can produce optimizer oscillations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use attention-graph hitting times to identify tokens whose information has not mixed through the network, then route only those tokens through additional Transformer blocks. Tokens with fast reachability exit early, while slow or isolated tokens receive more computation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a periodic coarse optimization phase to SGD or Adam that operates on a compressed parameterization and returns a prolongated correction to the full network. Retain nonsmooth constraints or regularizers explicitly through a primal-dual update instead of relying on penalty smoothing. Accept the correction only when it improves a cheap fine-batch merit test, making the method useful even when the coarse objective is only approximately coherent with the fine objective.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
For local structures with a forward/reverse ambiguity, expose both ordered directions and add one explicit orientation bit. This creates a shared bidirectional positional encoder that can distinguish reflected neighborhoods without maintaining two completely independent directional encoders.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace Euclidean projection onto a smooth convex parameter constraint by a local tangent-halfspace linear minimization step. The method is particularly suitable for convex softmax heads or low-dimensional adapter parameters constrained to an ellipsoid, where projections require matrix solves or expensive nonlinear routines but membership and boundary-normal queries are cheap.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Reparameterize all Bayesian neural-network weights by a bounded latent vector in the unit ball and use a simple ball-constrained MCMC kernel instead of unconstrained HMC or random-walk sampling. A radial diffeomorphism expands points near the ball boundary into arbitrarily large weights, preserving heavy-tailed posterior mass while preventing the sampler from numerically wandering through an unbounded parameter space.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the support graph of a sparse attention or routing mask as a feasibility object before applying normalization. Reject or minimally repair masks whose neighborhoods violate Hall's condition, ensuring that every selected query/key subset has enough reachable mass to support the desired marginals.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace exhaustive optimization of N binary gates by the geometrically admissible sign patterns induced by projections onto a common direction. For two-dimensional gate vectors, enumerate angular cells exactly; for higher-dimensional vectors, sample directions and evaluate only the induced configurations.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Represent a neural architecture as an undirected support graph and prune a matching of edges, so no two simultaneously removed edges share an endpoint. Use the paper's degree/connectivity theorem as a certificate that the pruned architecture retains k-edge-connectivity, preserving multiple routes between computational units instead of relying on unconstrained magnitude pruning.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace expensive global spectral analysis of a sparse graph propagation matrix, banded SSM transition matrix, or linearized layer with smallest-singular-value calculations on overlapping local sections. Penalize local sections whose pseudospectrum enters a forbidden region, adding the paper's explicit C0/L safety margin so that the resulting constraint has a principled finite-window error tolerance.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace repeated fine-scale message passing on a recursively constructed graph by a finite-state compositional module that summarizes each cell through boundary connectivity states. Child summaries are combined only through admissible configurations, so the network can represent globally consistent paths and forests without enumerating full walks. The same update map is shared across all hierarchy levels, giving logarithmic-depth computation in the graph diameter and a strong inductive bias for…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a 2D recurrent or residual neural lattice with slowly varying local couplings, while parameterizing those couplings so that an anisotropy invariant remains constant across all spatial and depth locations. The network obtains controlled local propagation velocities rather than arbitrary inhomogeneous amplification, enabling depth-dependent receptive fields while preserving near-critical signal propagation.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a recurrent ReLU module that evaluates a binary refinement cascade using a fixed-dimensional state and shared cell weights. Replace hard binary digit selection with two overlapping circle coordinates; switch between their affine state updates only at points where the two candidate updates agree, so the switch is an exact continuous piecewise-linear ReLU operation rather than a multiplicative gate.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace communicated floating-point gradients in synchronous federated or data-parallel training with one-bit threshold queries whose thresholds are sampled publicly before gradients are observed. Use several fixed geometric amplitude scales so the same protocol handles unknown gradient means and heavy-tailed client updates without an interactive localization round. Decode each coordinate from the scale whose neighboring estimates are statistically consistent, then apply the decoded aggregate…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace heuristic magnitude pruning in a layerwise convex reconstruction problem with safe screening based on a perspective relaxation of the cardinality constraint. A channel is removed only when a lower bound for every solution containing that channel exceeds the loss of a feasible incumbent; conversely, a channel is forced to remain when every solution excluding it is provably worse.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a structural penalty to a learned hypergraph or sparse routing graph that measures the gap between its conjugate vertex-degree spectrum and the squared spectrum of its up-Laplacian. The paper's identity says this gap equals twice the number of failed elementary shifts, so minimizing it encourages an ordered incidence structure rather than merely matching degree statistics or sparsity.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a symmetric token affinity matrix and approximate only its spectrally outlying token-mixing modes using a small set of sampled landmark columns. The resulting low-rank operator replaces an \(O(n^2)\) dense mixer by two skinny matrix multiplications, while the paper's residual guarantee predicts that large-magnitude global interaction modes are preserved.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a learned nonnegative banded transition matrix by an ordered product of learnable stochastic bidiagonal factors. Each factor performs one local left or right transport step, so a product of p lower and q upper factors creates an effective bandwidth of p+q while retaining nonnegative entries, row sums equal to one, and a highly structured propagation kernel.
Useful6/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace dense attention or strictly local windows with a refreshed sparse communication graph whose edge lengths follow a truncated power law. For sequence positions or image patches at distance $r$, sample edges with probability proportional to $(1+r)^{-(d+\alpha)}$; in the regime $0<\alpha<d$, repeated layers should spread information across the sequence much faster than a local window while using only $O(nk)$ edges per layer. The main test is whether this preserves long-range accuracy at…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a routed neural state update from a collection of branch maps whose inverse-style refinement operators are uniformly contractive. The discrete routing sequence acts as an expandable symbolic code, while contraction makes the continuous state associated with a long routing history insensitive to initialization and earlier perturbations. Use a finite active top-\(K\) set during training, but retain an expandable branch table so the model can represent increasingly complex or rare modes.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach a symbolic sparse head to a neural encoder instead of using a dense final MLP. The head evaluates a library of learnable power-law and interaction terms on nonnegative learned features, jointly optimizes linear coefficients and exponents, and removes inactive terms with coefficient sparsity. This should provide a compact model with better relative-error behavior on positive targets spanning several orders of magnitude.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace dense spatial attention on a 2D feature grid by attention from every non-landmark token to a small periodic set of landmark tokens. Choose landmarks using the paper's residue construction so that every non-landmark token has at least one landmark exactly k Manhattan steps away. Use this guaranteed edge as a sparse global-information route, combined with a cheap local convolution or residual path for accuracy.
Useful6/10
Difficulty5/10
Novelty7/10