△ Mechanism confirmed, baseline not beaten
2026
Construct a bipartite candidate graph between tokens and experts from the router’s top-k logits, then solve a capacity-constrained maximum-cardinality matching rather than dispatching each token independently. The mechanism targets the extreme tail of routing completion: it should reduce unmatched or repeatedly reassigned tokens and lower maximum dispatch delay and expert starvation, even when average routing quality changes little.
Useful7/10
Difficulty6/10
Novelty4/10
✗ Failed on benchmark
2026
Use the evolving singular spectrum of the represented matrix W_t=U_tV_t^{\top} to modulate one common, gauge-equivariant learning rate. Slow the shared update when spectral mass accumulates outside the intended low-rank subspace, preventing adaptive dynamics from amplifying nuisance tail directions while retaining the shared-rate structure needed for low-rank recovery.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Train one functional flow-matching network against conditional velocity targets formed from randomly varying finite-rank reconstructions, including sensor sets that are not nested across training examples. Decode predictions from two sensor layouts into a common function representation and add a cross-layout consistency penalty. The paper's convergence result predicts that this remains statistically valid as reconstruction error decreases, unlike methods that implicitly rely on changing grids…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Compress an existing dense neural-network weight matrix into a recursive butterfly operator using Gaussian sketches of complementary blocks. This is useful for deployment or distillation: the dense model provides an oracle for matrix-vector products, while the compressed model stores only recursive transfer bases and small cores. The generalized Nyström identity gives exact reconstruction for rank-k blocks and a principled approximation route for numerically low-rank blocks.
Useful7/10
Difficulty7/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a sequence of tensorized LoRA-style adapters, expert corrections, or residual weight updates as a traceable graph tensor network and add them using path concatenation plus chord overlay. Periodically round the accumulated graph with SVD so adapter rank and inference cost remain bounded while approximation error is explicitly controlled. This targets continual fine-tuning and mixture-of-experts settings where naively summing low-rank updates causes rank and memory to grow with the…
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace ordinary depth-wise feature propagation by a ternary hierarchical block that recursively aggregates three child representations while maintaining separate neutral and defect channels. The block is initialized from the Sierpinski six-vertex recursion, then optionally learns a bounded correction. The neutral channel preserves the paper's cubic mixing law, while the defect channel provides a controlled route for long-range and nonlocal interactions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Inject weak, unpostselected stochastic perturbations into activations, attention links, or recurrent transitions, but scale their strength according to effective computational size. The schedule is designed so that noise is initially a weak perturbation and becomes dominant only beyond a controlled depth or sequence length, producing a measurable crossover rather than uncalibrated constant dropout.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace random or greedy one-expert-at-a-time activation with a deterministic binary van der Corput sequence. At each training or inference step, the schedule chooses an expert whose cumulative usage remains close to its proportional target, while recursively balancing nested expert groups rather than only balancing individual experts.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat undesirable neural-network states as obstacles and steer training or inference away from them with a smooth distance barrier while preserving a nominal loss descent direction. The barrier can protect against exploding activations, excessive attention concentration, unsafe controller outputs, or leaving a certified representation region without introducing discontinuous gradient clipping.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace dense token-to-token attention by a multiscale spiderweb communication pattern. Tokens first aggregate upward through a dyadic hierarchy, communicate horizontally only with a small number of cells at the appropriate height, and then receive information broadcast downward. Hyperbolic distance supplies a principled rule for choosing the height at which two tokens interact: nearby tokens interact at fine scales, while far-apart tokens interact through coarse representatives.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the exact matrix-polar normalization in Muon with the smoothed feedback \(h_\epsilon(M)=M(M^\top M+\epsilon I)^{-1/2}\). This retains singular-vector-aware updates and approximately unit-normalizes dominant spectral modes, but avoids unstable behavior when the momentum matrix is rank deficient or has tiny singular values.
Useful7/10
Difficulty5/10
Novelty4/10
✗ Failed on benchmark
2026
Train masked predictors with an explicit mixture of high-visibility masks, low-visibility masks, and a small atom at the fully masked input. High-visibility masks preserve ordinary denoising quality, while low-visibility and fully masked examples force the network to learn global mode frequencies that are invisible when nearly all context is shown. Tune the low-visibility mass using unconditional-mode recovery as an auxiliary validation metric.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Replace fixed chunked-prefill settings in an LLM serving engine with a feedback controller that decreases the number of prompt tokens processed per scheduling quantum as GPU saturation or long-context load increases. The controller targets a high-quantile bound on the absolute GPU-power ramp while preserving the existing peak-power ceiling and measuring the resulting latency-throughput tradeoff.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Partition a neural network into N interacting modules and constrain the Jacobian of its implicit residual map to be block diagonally dominant. Each module can compute its update locally while cross-module coupling is monitored through a normalized block-row margin. The certificate guarantees local nonsingularity of the equilibrium equations and predicts a sharp loss of robustness when the largest BDD ratio approaches one.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a per-feature or per-token state that accumulates recent stimulation and decays when stimulation is absent, then use a nonlinear decreasing gain to suppress repeatedly activated features. This creates short-term adaptation without changing the core transformer or recurrent weights: familiar inputs are processed with reduced gain, while novel inputs recover their full response.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the relaxed QFT tensor-network topology as a trainable norm-preserving mixer inside a neural block, replacing a dense token-mixing matrix or an expensive global convolution. The network learns data-adapted global interactions while retaining structured O(N log^2 N) application and an exact cheap inverse, making it suitable for image tokens, long sequences, or reversible residual blocks.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Represent each input graph by a short ordered sequence of topological tokens rather than a persistence diagram. For each overlapping interval on a shared filtration grid, compute the number of connected components and independent one-dimensional cycles, concatenate these counts with inexpensive graph summary statistics, and process the resulting sequence with a small Transformer. The representation should retain multiscale structural information while avoiding pairwise persistence-diagram…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a static batch size with a schedule optimized for a prescribed learning-rate schedule and a fixed total number of processed examples. Steps whose stochastic-gradient noise has a large effect on the paper's loss bound receive larger batches, with the weighting determined by the future learning-rate tail rather than by a hand-designed warmup or cooldown rule.
Useful7/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace unconstrained softmax cross-attention with a many-to-many transport matrix whose row and column masses have explicit upper bounds. Compute the attention cost from both feature similarity and pairwise relational disagreement, so a token is attended to only when its relationships to other tokens are jointly compatible. The inequality constraints provide a principled dustbin-free mechanism for ignoring distractor tokens.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Replace fixed PCA-rank selection in a hidden layer with a renormalization-group-inspired gate over covariance eigenvalue bands. The gate retains modes whose effective quartic interaction remains unstable or strongly scale-dependent, while pruning bands that flow toward the Gaussian noise fixed point. Unlike top-eigenvalue truncation, this is designed for extensive-rank signal distributed throughout the bulk spectrum.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Encode a continuous or sampled multivariate time series as degree-N log-signatures on m local intervals, choosing (m,N) to minimize the number of stored scalars under an explicit linear-CDE approximation budget. Unlike fixed-size temporal patches, the representation increases temporal resolution when the path is oscillatory and increases algebraic degree when the path is smooth but strongly nonlinear.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Treat token-to-expert assignments as a bipartite routing graph and penalize patterns that leave token groups sharing too few experts. Enforcing sublinear expansion makes routing diversity explicit: even a moderately sized group of tokens must reach many distinct experts, reducing expert collapse and improving load balance without requiring every token to use every expert.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use measured local Jacobian growth to set the variance of dropout, feature noise, or stochastic-depth perturbations, implementing the paper's fluctuation-response idea that multiplicative noise is tied to the positive scrambling or Lyapunov rate. The controller maintains a target growth regime instead of applying a fixed noise schedule throughout training. It predicts a stability transition when the estimated growth rate crosses zero and a variance-growth proportionality that can be tested…
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Construct a residual sequence or depth network whose nonnegative influence density follows a discretized noisy Fisher-KPP equation: local influence diffuses, grows when small, saturates at a finite carrying capacity, and receives state-dependent noise. Use this density to gate ordinary feature updates rather than relying only on unconstrained residual additions. The mechanism predicts a measurable propagation speed and an instability boundary, allowing the architecture to be falsified…
Useful7/10
Difficulty6/10
Novelty8/10