✗ Failed on benchmark
2026
Replace dense coarse-to-fine cross-attention at multiresolution interfaces with a sparse, nonnegative overlap operator whose weighted feature average is exactly conserved between the two resolutions. Use this operator as a low-order path and blend it with an unrestricted neural cross-attention path through a convex limiter that keeps features inside a box or simplex domain. The construction is especially suitable for adaptive token grids, hierarchical graph neural networks, neural operators…
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Use a smoothed Burg entropy as the mirror map in a proximal-gradient optimizer for positive or simplex-valued neural parameters. The optimizer performs a Bregman-proximal step instead of an additive Euclidean update, while the smoothing parameter avoids the singularity of ordinary Burg entropy at zero.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Construct a spatiotemporal neural block from localized functions of a learned parabolic operator instead of unrestricted attention or convolution. Use one filter for fine-scale diffusion and another for coarse-scale temporal aggregation, with the scale ratio controlling information propagation. The block should suppress distant interactions while still permitting long-range mixing through coarse filters.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Construct a sparse attention layer by sampling backward token histories as a continuous-time branching process rather than allowing every query to attend to every key. Each active ancestor either dies or branches into a bounded number of candidate ancestors, with branching probability controlled by a small parameter. The branch-out penalty predicts exponentially small probability of long, highly branching histories, providing a direct knob for receptive-field size and attention FLOPs.
Useful7/10
Difficulty5/10
Novelty7/10
✓ Mechanism works
2026
Replace an unconstrained nonlinearity on hyperbolic pairwise similarities with a function from the paper's exact Lorentz–Gram preserver family. The transformed similarity matrix remains realizable as Lorentz inner products of future-directed unit timelike vectors, allowing a network to sharpen or smooth hyperbolic neighborhoods without introducing geometrically impossible pairwise relations.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained attention or MoE routing matrix with a row-stochastic matrix that preserves a learned Gibbs-like distribution over groups. Anneal its temperature so that the router converges to a block-upper-triangular operator: mixing remains flexible within equal-energy groups, while cross-group traffic becomes directional rather than oscillating or collapsing. This creates a hierarchy-aware inductive bias and can reduce the number of active expert or attention connections.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace ordinary feature-only cross-attention between two graph sets with a transport coupling optimized using pairwise structural costs. Use the paper's positive-semidefinite graph-kernel factorization to compute the quadratic GW interaction without materializing an O(N_0^2 N_1^2) tensor, and use the inexact-gradient convergence bound to control truncated or approximate updates. The resulting coupling can be used directly as attention weights or as a soft graph-matching matrix.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a consistency loss for a neural model processing irregularly sampled functions or sequences, comparing its latent covariance representation before and after a time-coordinate warp. The target discrepancy should be near zero for affine transformations but should grow with the normalized curvature, bandwidth, and local sparsity of a nonlinear warp.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained positive higher-order gating function by a factorially normalized homogeneous polynomial whose coefficients are trained toward the Lorentzian Hessian signature. This gives multiplicative routing or attention interactions a controlled curvature pattern instead of allowing arbitrary unstable higher-order amplification.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace unconstrained momentum updates for selected neural-network parameter blocks by damped second-order motion on a unit sphere. The update learns directions while preserving the block norm exactly, and includes the centripetal term required for a valid acceleration constrained to the sphere rather than merely projecting gradients after an unconstrained step.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independent softmax routing or attention normalization with a differentiable approximate distribution over one-to-one assignments, using the Bethe permanent as the partition-function surrogate. Constrain the allowed token-to-expert or query-to-key support graph to have high girth, which gives an explicit bound on the approximation error and reduces short-cycle-induced correlations.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use signed spanning-forest minor numerators to encourage a graph-structured neural layer to preserve independent multi-coordinate responses instead of collapsing several outputs onto the same direction. The determinant coefficients are only 0 or ±1, making the regularizer combinatorial and sign-exact rather than a noisy learned determinant surrogate.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use a small set of known or trusted pairwise costs to estimate the effective entropic temperature of a Sinkhorn attention or mixture-of-experts routing layer directly from its observed transport plan. This provides a calibration controller that can detect over-concentrated routing and adjust epsilon without backpropagating through a costly temperature search.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Add a recurrent associative matrix to each selected transformer layer so recent key-value relationships can be retrieved without retaining every past token or performing gradient updates. The matrix uses input-dependent retention and write gates, but retrieval is always performed from the pre-write state, preventing the current target from leaking into its own prediction. Frobenius-norm clipping makes the recurrent memory bounded and provides a direct stability control.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Use the paper's first-passage crossover as a controller for the communication or attention radius of a multi-agent policy. Instead of fixing a costly global attention range, estimate environmental depletion statistics online and set the radius near the predicted equality of individual and collective search times, expanding it only when the environment enters the collective-search regime. This turns a statistical-mechanical transition formula into an adaptive sparsification rule.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a differentiable reaction-diffusion layer that converts dense token or pixel features into sparse, spatially coherent routing masks. Two competing orientations form complexes through conserved monomer reservoirs, so local assignments can cluster while opposite assignments mutually exclude one another instead of independently activating at the same location. The layer can be used as a soft-to-hard MoE router, attention-mask generator, or object-part grouping module.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independently normalized attention or routing weights with an entropic doubly stochastic transport plan, while choosing its regularization ε using the paper's explicit statistical-stability bound. Increase ε when residual inversion or minibatch fluctuations are amplified, and decrease it only when the estimated bound permits sharper assignments.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the linear phase progression in a positional encoding or rotary attention mechanism with a deterministic quadratic phase. The resulting position signal is generated by an irrational rotation with linearly changing increments, and the paper proves that its infinite diffraction measure is purely absolutely continuous, suggesting disorder-like spectral coverage without random sampling.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Parameterize a complex linear layer as a product of sparse triangular network factors whose positive modulus version is totally nonnegative. The layer can use phase cancellation for expressive transformations, while selected minors remain bounded by explicitly computable positive minors, giving a structured alternative to unconstrained dense complex weights.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace ordinary token pooling or attention aggregation in a hyperbolic representation space with the point satisfying a bounded radial equilibrium law. Each token contributes a unit tangent direction multiplied by \(\tanh\) of its hyperbolic distance from the candidate, so distant outliers cannot dominate the pooled representation while nearby, geometrically consistent tokens still determine it.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a higher-order neural computation as a bipartite incidence graph between node features and hyperedges, and assign each node-hyperedge incidence an anchor probability or learned anchor score. Add a regularizer that maximizes the predicted size of the surviving (k,n)-core under random node, hyperedge, or token dropout, thereby preventing structured pruning or routing from disconnecting essential higher-order computations. At inference, retain only incidences belonging to the predicted…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use a pseudorandom sparse interaction graph as the measurement pattern for latent node coordinates. Add a loss on edgewise latent distances and train on an automatically selected large induced subset, so that coordinates are constrained by many distributed measurements rather than local neighborhoods alone. The target is to eliminate non-global geometric ambiguities and reduce drift in geometric GNN or transformer representations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent each token value in an attention head as a bounded three-dimensional Lie-algebra vector and impose a weighted polygon-closure condition on the aggregate value vectors. The module is invariant to a common \(SU(2)\simeq SO(3)\) rotation of all token vectors, preventing the head from spending capacity on an arbitrary global orientation. A soft closure penalty gives a drop-in experiment, while projection onto the zero-sum manifold provides a harder constrained variant.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train a graph neural network with a learnable fractional graph mask constrained toward the tree-double-matching polytope. This gives the model a global connectivity constraint while penalizing attention patterns that concentrate too many incident edges on individual vertices.
Useful6/10
Difficulty5/10
Novelty6/10