△ Mechanism confirmed, baseline not beaten
2026
Replace the usual sum of pairwise modality similarities with a higher-order score based on the coordinatewise Hadamard product of all normalized modality embeddings. For modalities indexed by i=1,...,m, score a tuple using s(x_1,...,x_m)=\omega^\top(\bar g_1(x_1)\odot\cdots\odot\bar g_m(x_m)), where \omega is learned and \odot is coordinatewise multiplication. This adds explicit m-way interactions without concatenating raw features or introducing a joint encoder.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Replace consecutive or randomly assigned transformed KV coefficients with groups whose variance-volume is approximately equal. Train one equal-size vector-quantizer codebook per group, so a fixed-width cache does not waste its low-rate budget by forcing high-variance and low-variance coordinates into badly mismatched groups. This is a drop-in quantization-layout change that can be applied to keys, values, or both.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace the usual JL dimension choice with a task-specific dimension budget based on the paper's asymptotic ranking law. For retrieval, nearest-neighbor search, or compressed attention keys, choose m from a target Kendall correlation and automatically expand the projection when measured ranking quality falls below the target.
Useful7/10
Difficulty3/10
Novelty7/10
✗ Mechanism failed
2026
Choose the neural operator's input-history length from the measured correlation time of the unresolved closure signal produced by coarse-graining. This avoids under-memory, which causes systematic closure error, and over-memory, which increases attention cost and can destabilize training. The same diagnostic can drive adaptive memory truncation across physical regimes.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Prune redundant attention heads using separate similarity scores for sink behavior and content routing. Two heads are considered safely redundant only when their normalized content compositions are close in Aitchison distance and their sink-mass trajectories are also close, avoiding pruning decisions dominated by a shared sink token.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Distill a teacher's attention into a student by matching sink mass and the normalized content distribution as separate targets rather than applying one KL divergence to the entire attention row. Use the Aitchison distance on the content composition, which compares relative token allocation and prevents a large common sink probability from overwhelming differences between content tokens.
Useful7/10
Difficulty3/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Freeze a randomly initialized single-layer transformer and use a constructed soft prompt to make its attention weights equal Gaussian-kernel weights over support examples. The resulting model performs Nadaraya-Watson regression in one forward pass, so task adaptation stores prompt tokens rather than modifying network weights. Prompt length becomes the number of kernel centers, while hidden dimension and prompt norm determine whether the required logits can be represented accurately.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use predicted covariance reduction as a differentiable gate for selecting tokens, views, sensors, or retrieved demonstrations. The gate favors inputs with high expected information gain while accounting for acquisition cost, turning attention and data collection into active observability optimization.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace independent pairwise feature matching across augmented or multimodal views with jointly estimated soft permutation matrices constrained to agree through cycles. The paper's multi-view result suggests that independent copies can cross a correspondence-recovery threshold even when every individual pairwise matching is statistically non-informative. In a neural network, this can provide cleaner token, patch, object, or cell alignment targets and can be used either as a differentiable…
Useful7/10
Difficulty5/10
Novelty6/10
✓ Mechanism works
2026
Replace confidence-only masked diffusion decoding with an adaptive scheduler that chooses batches whose unrevealed tokens have low conditional total correlation given the already revealed context. The scheduler should preserve large parallel batches when token predictions are conditionally independent, but split highly dependent tokens into separate rounds to reduce forward-KL error.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Add a training-time regularizer that keeps the empirical joint covariance of hidden activations on multiple inputs close to the recursively predicted NNGP covariance. The regularizer targets the finite-width fluctuations quantified by the Wasserstein result, and is particularly appropriate for recurrent networks and attention blocks with shared weights, where hidden states at different positions or time steps are statistically coupled.
Useful6/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.
Useful6/10
Difficulty5/10
Novelty7/10