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
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 a large stable linear state-space or recurrent layer by a lower-order balanced realization computed from frequency-targeted controllability and observability Gramians. Use generalized low-rank ADI with imaginary-axis shifts concentrated at frequencies that dominate the training data, then retain states associated with the largest approximate Hankel singular values. This should reduce recurrent inference cost while preserving the layer's input-output response in the selected frequency…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a low-dimensional basis for the principal module generated by the all-ones vector, then perform adjacency and degree propagation in compressed coordinates. On forests, the paper states that this module equals the automorphism-orbit module, so the reduced representation can preserve principal adjacency-degree information while using far fewer coordinates than the number of vertices.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Turn stochastic edge thinning into a mass-aware graph sparsifier: first form retained connected blobs, then connect blob summaries using the rank-one shortcut probability from the paper. Choose the retention rate below the explicit subcritical threshold so the contracted graph remains a collection of small decorations around leading blobs, reducing message-passing cost without creating an artificial giant component.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a nonlocal regularizer to nonnegative CNN feature maps that rewards activation-zero pixels lying deep inside a contiguous zero region. Unlike L1 sparsity, this penalizes isolated holes and favors block-like inactive areas that are more amenable to spatial skipping, channel gating, or structured pruning.
Useful6/10
Difficulty5/10
Novelty7/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 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
Unverified
2026
Replace a dense tensor-product positional encoding or first MLP layer with a hierarchical sparse-grid B-spline feature map. The network evaluates only localized basis functions indexed by multi-levels with bounded total level, reducing feature count while retaining high-order approximation for functions with mixed derivative regularity. The basis can initially be fixed and later fine-tuned jointly with the downstream network.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Compress a dense neural-network weight tensor with mode-wise selected fibers and a small sampled core, then convert the result into a Tucker layer for efficient execution. Select indices greedily using reconstruction residuals rather than random sampling, and fine-tune the compressed model to recover task accuracy.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a dense block of a large neural-network weight matrix with an adaptively constructed cross approximation, but prevent premature termination using residual checks on O(m+n) additional diagonal-like entries. Accept a rank only after the probe residual has remained below tolerance for several consecutive iterations; otherwise continue adding pivots.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a $K$-class softmax with $N$ binary hyperplane heads, where each class is represented by the signs of its projections onto fixed random directions. Train the embedding to reproduce these codewords and decode by nearest Hamming codeword. The paper's guarantee suggests that $N\approx 2\log_2 K+\log_2(1/\delta)$ can separate all class centers with high probability in sufficiently high dimension, giving a concrete width rule rather than choosing the number of binary heads heuristically.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a dense node-to-landmark graph-attention or message-passing relation by a dictionary of distinct landmark-neighborhood signatures. Nodes sharing the same signature reuse the same structural landmark aggregate, while their individual hidden states are still passed through the output MLP, preserving node-specific predictions. On bounded-treewidth graphs the number of distinct signatures is provably linear in the number k of landmarks, with an explicit dependence on treewidth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct attention groups as hyperedges of a linear r-uniform hypergraph: every pair of tokens is allowed to share at most one group, while each token participates in approximately the same number of groups. Apply local attention inside each group and aggregate the outputs across groups. The construction inherits the paper's sharp capacity bound and prevents both redundant pair interactions and high-degree token hubs.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a nonnegative attention or routing score matrix by two nonnegative vectors, X = uv^T, and learn only entries on a sparse bipartite graph of important query-key or token-expert interactions. Complete the remaining entries multiplicatively and monitor cycle residuals as a certificate of whether the sparse representation is compatible with rank one. Use local ratio violations to trigger additional edges or relax the rank-one approximation only where needed.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace forward activation dropout in a deep residual network with an unbiased multiplicative mask applied only to gradients entering each residual unit or branch. The forward representation remains deterministic for a given minibatch, while the update receives zero-mean stochastic perturbations that are predicted to reproduce dropout-like limiting dynamics in large-width, large-depth ResNets.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a learned embedding for each integer with a compositional embedding of its variable-length Gray codeword. Add an auxiliary constraint that numerically adjacent values have nearby representations, while preserving the ordinary task loss so that the model can learn when numerical adjacency matters.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace a dense channel-mixing matrix by a sparse complex generalised weighing matrix W with exactly w nonzero entries in every row and column, then use U=W divided by square root of w as a norm-preserving mixer. Restricting to k=2 gives a real matrix with entries in {+1,-1}; k=4 supports signed phase rotations. The exact isometry should preserve signal and gradient norms while reducing channel-mixing cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained relative-position attention-bias table by a learnable two-dimensional Fourier representation, or regularize the bias toward a small Fourier ratio. The ratio favors coefficient concentration without depending on the absolute scale of the bias, allowing the trained bias to be reconstructed from a small number of dominant frequencies.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Compress a trained graph-attention model's edge-dependent logits or gates in the line-graph Fourier domain. Smooth edge values become concentrated in low-frequency coefficients, allowing low-frequency coefficients to retain more precision while high-frequency residuals use fewer bits or are discarded.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace one independently learned vector per graph edge with a truncated spectral expansion on the line graph. The model learns coefficients for low-frequency edge modes and reconstructs edge features before message passing, reducing parameters while imposing an inductive bias that incident edges should have correlated behavior.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a single recurrent state with two coupled one-dimensional latent chains whose relative alignment is periodically shifted during inference. Ferromagnetic coupling preserves locally coherent patterns, while controlled sliding produces a nonequilibrium friction effect that can make global magnetization substantially longer-lived than in a static noisy chain. The shift velocity acts as a measurable memory-control parameter rather than an unconstrained architectural hyperparameter.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a sparse graph by thresholding normalized token or item inner products, then use the leading eigenvectors of its centered adjacency matrix as geometric features or a low-rank attention-logit bias. The graph avoids storing all pairwise similarities, while the paper's spectral bound supplies a concrete signal-to-noise test for deciding whether the resulting embedding is trustworthy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a purely recurrent or state-space history summary with two explicitly separated paths: a fixed-size state channel for compressed sequence mixing and a query-dependent indexed channel for exact or near-exact retrieval. Train a lightweight gate to invoke top-k retrieval only when the recurrent state has insufficient evidence for the current query, preserving near-constant cost on ordinary tokens while preventing catastrophic failures on long-range exact-recall tasks.
Useful6/10
Difficulty5/10
Novelty4/10