Unverified
2026
Replace dense token-to-token attention with attention over connected token groups, called polymers, while forbidding nearby polymers from being simultaneously selected. Each candidate group receives an exponentially decaying size and boundary penalty, and the layer sums or samples only compatible collections of groups. The construction should create structured sparsity and prevent redundant overlapping attention regions.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a learned causal mixing profile by a monotone profile followed by a prefix-average Hardy mixer. The monotonicity constraint makes the mixer provably non-degenerate in the BMO sense: localized variation in the profile cannot be reduced below a calibrated factor by prefix averaging. This is a cheap alternative to dense causal attention for tasks where importance or state profiles are expected to decay along sequence position.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace independent token scores with a query-conditioned positive-semidefinite low-rank quadratic score over a fixed-size selected subset. Repeatedly convert the quadratic objective into a linear exposure vector and apply a cheap top-k oracle, allowing the selector to model joint token interactions without constructing an n-by-n attention matrix. The margin between the current low-dimensional shadow and alternatives provides a practical confidence or early-stopping signal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Assign each of K entity or token types an integer code from a B_{2,\Delta}-set A, so every unordered pair {i,j} produces a unique and margin-separated scalar code a_i+a_j. Use this code as a compact symmetric pair feature for graph edges, attention biases, or pairwise relation MLPs, avoiding collisions that occur when ordinary low-dimensional additive encodings are quantized or hashed.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a fixed quantile output with a Lambda-quantile head that receives a predictive sample set and applies a learned value-dependent threshold \(\Lambda(x)\). Unlike ordinary quantile regression, the model can use a low threshold in one value range and a high threshold in another, which is useful when error costs or calibration requirements vary across the output domain. Start with a piecewise-constant or monotone spline parameterization, then test whether allowing controlled…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Augment every graph node with weighted participation in simple cycles of lengths 3 through K, computed using the paper's squarefree trace construction. Feed these features into a graph transformer or message-passing network so nodes with identical local degrees and ordinary spectral statistics can still be distinguished by their exact loop environment.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a measurement-conditioned attention layer with two explicitly separated fields: a geometry-only inverse-temperature profile that controls interaction strength and an outcome-dependent chemical-potential bias. For a region bounded by coordinates a and b, force the interaction gate to vanish as the square root of the distance from either boundary, while allowing a separate potential channel to encode measured values.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace part of an attention matrix with a mixture of fuzzy permutation matrices induced by short permutations. Each basis element represents an order-preserving k-token matching smeared over all embeddings into the sequence, while a balancing constraint makes the aggregate attention receive uniform global coverage. Retain a standard low-rank or local-attention residual so the structured branch does not prevent arbitrary content-dependent interactions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat learned features on a mesh as differential forms and pool them against oriented chains using wedge or cap products instead of ordinary coordinate averaging. Couple forward and boundary features with the signed chain differential so that pooling commutes with differentiation, preserving local conservation and orientation information.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the first learned one-dimensional convolution or STFT-like feature extractor with a differentiable bank of time-frequency shifts of a totally positive window. Parameterize the temporal spacing \(\alpha\) and frequency spacing \(\beta\) so that \(\alpha\beta<1\) is always satisfied, giving a mathematically certified oversampled representation instead of an arbitrarily subsampled filterbank.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a small number of latent region-offset variables to a graph or token-mixing layer, interpreting selected edges as low-permeability barriers that suppress cross-region information flow. Eliminate the latent variables analytically, yielding a visible-node update with a structured low-rank correction rather than adding persistent hidden node states. The module is intended to preserve within-cluster propagation while preventing oversmoothing or contamination across learned boundaries.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a softmax transition or mixture-of-experts router by probabilities obtained from squared amplitudes of an isometric latent transition. Each input state is mapped to an orthogonal latent subspace, and summing probability over the latent index produces the desired expert or next-state distribution. The latent amplitudes can retain information that would be destroyed by directly averaging expert outputs, while normalization is guaranteed by construction.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Build a parameter-free spectral channel mixer whose channels are arranged as components of an l-form and whose multiplier is the trace-free Beurling--Ahlfors transform. At every nonzero spatial frequency it mixes the exact and coexact channel subspaces with opposite signs, preventing a uniform channel-direction bias and preserving a structured cancellation property. Insert it as a residual branch before a convolution, MLP, or attention block, with one learned scalar gate controlling its…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a scalar softmax classifier or MoE router with a positive-operator-valued measurement computed from learned class or expert density matrices. The resulting operators are positive semidefinite and sum exactly to the identity, so routing probabilities remain normalized for every input state while retaining matrix-valued uncertainty and correlations between latent directions.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent each of n signed tokens with two or more anticommuting feature channels and build equivariant outputs from exterior products rather than unconstrained tensor products. Penalize or project out positive-degree signed-permutation invariants, approximating the coinvariant quotient so that the layer retains order-sensitive orientation information without learning redundant invariant directions.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach each token or graph node a discrete grade a in a finite group A, and modify attention value composition with a normalized group 2-cocycle rather than independent pairwise gates. The cocycle provides a globally consistent projective interaction rule, so composing three messages gives the same result under either parenthesization. This may improve relational reasoning while reducing the number of freely learned interaction parameters.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace fixed-radius image blur or pooling with disk averages whose radius is proportional to the distance from each pixel to the image boundary. Compute the transform at every spatial location and train a lightweight decoder to reconstruct the pre-transform feature map, using reconstruction error as an anti-collapse regularizer. This creates a scale-adaptive smoothing layer with an injectivity motivation in the continuum while providing larger context in the image interior.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment an exponential state-space memory branch with a causal convolution whose lag-j weight is exp(-lambda j) ell(j)/j. The 1/j boundary provides broad logarithmic memory, while lambda supplies an explicit finite memory scale and prevents uncontrolled accumulation from an untempered long-memory kernel.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the paper's explicit square insertion surgery to generate new quad-mesh examples with altered local valence patterns but unchanged genus, unchanged non-target vertices, and unchanged rotational-holonomy subgroup. Train a mesh GNN with consistency loss or label-preserving augmentation across the original and surgically modified meshes, forcing predictions to depend on global structure rather than accidental local tessellation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a large flat positional-embedding table with a recursively decoded nine-way address whose child transformations contract coordinates by exactly 1/3. Encode an input position using features attached to the address prefix at several depths, guaranteeing that increasing depth produces a geometrically localized representation and that an infinite valid address cannot ambiguously represent two distinct points. This is especially suitable for 2D vision tokens, maps, point clouds, or…
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Use the model's non-monotonicity result to make graph connectivity a learned resource rather than assuming that every extra edge helps. An edge router assigns transmission scores but also charges a source-side collision cost for exposing an infected node to many susceptible neighbors. The resulting router can prune edges that increase competition and reduce useful reachability.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment a singular scalar activation \(\sigma\) with a distributionally regularized activation \(g\) whose Fourier transform is multiplied by \((i\rho)^\alpha\). This suppresses the problematic low-frequency singular component and can produce better-conditioned random-feature or first-layer representations, while a residual raw-activation branch prevents loss of standard approximation behavior.
Useful5/10
Difficulty5/10
Novelty8/10