Research ideas

Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.

△ Mechanism confirmed, baseline not beaten 2026

Kernel-Prompted Random Transformer

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
Paper: Training-Free Universal Approximation by Prompting Random Transformers arXiv:2608.09558
△ Mechanism confirmed, baseline not beaten 2026

Orthogonally mixed 3-bit KV cache

Replace ordinary per-channel or per-token KV quantization with a structured orthogonal transform followed by blockwise 3-bit quantization. Use a normalized Walsh-Hadamard transform and small SO(4) rotations to spread outliers across coordinates, quantize the transformed vectors, and exploit orthogonality to rotate queries and attention outputs so unquantized attention remains mathematically equivalent.

Useful7/10
Difficulty6/10
Novelty6/10
Paper: RotaryQuant: Fitting 120B MoE Models on Consumer Hardware via Fused Compressed-Space Attention arXiv:2608.08081
△ Mechanism confirmed, baseline not beaten 2026

Fading-Memory Habituation Gate

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
Paper: Dynamical principles of habituation across substrates and scales arXiv:2608.00249
△ Mechanism confirmed, baseline not beaten 2026

Tolerance-controlled adaptive low-rank layers

Replace selected dense neural-network operators by low-rank factors whose rank is selected by a randomized residual test at a user-specified tolerance. Construct candidate bases in large blocks for efficient matrix operations, then prune the block to the smallest rank that passes the residual criterion instead of treating the block size as the final rank.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Adaptive, Matrix-Free Low-Rank Approximation arXiv:2607.06758
△ Mechanism confirmed, baseline not beaten 2026

Star-Delta Hub Elimination

Remove a latent relay or hub token from an attention or graph layer and replace its two-hop influence by direct effective edges between retained tokens. The correction is a normalized rank-one update, so it can preserve hub-mediated communication while reducing the number of stored and processed states.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: The Invariant Measure of Multiscale Markov Chains via Fast Arborescence Factorization arXiv:2606.31596