Architecture ideas

Attention variants, state-space and recurrent cells, normalization and token-mixing schemes — each tested against the standard block it replaces.

Unverified 2026

Binomial-thinning (s,S) capacity controller

Replace continuously fluctuating conditional-computation decisions with a fixed-charge (s,S) controller for the number of active experts or channel groups. If the currently provisioned capacity falls below s, activate capacity up to S; otherwise retain the current capacity, preventing repeated small routing or kernel-launch decisions. Binomial thinning models the random subset of provisioned experts or channels that are actually available after token load, dropout, failures, or admission limits.

Useful5/10
Difficulty5/10
Novelty7/10
Paper: The optimality of an (s, S) hiring policy on a workforce planning problem with fixed recruitment costs and binomial turnover arXiv:2607.28171
Unverified 2026

Branching-Fanout Sparse MoE

Replace a fixed top-k expert count with a stochastic, token-specific fanout generated by a supercritical binary branching process stopped at a geometric time. The resulting number of active experts has finite mean but a power-law tail with log-periodic modulation, allowing most tokens to use little compute while reserving larger computation for difficult or ambiguous tokens.

Useful5/10
Difficulty6/10
Novelty8/10
Paper: Power-law and log-periodic degree tails for a family of probability generating function equations arising in evolving networks arXiv:2607.12564
Unverified 2026

Marginal-Preserving Difference Noise

Construct two latent variables X and Y with exactly the same marginal distribution, while forcing their difference X-Y to follow a chosen centered noise or residual law. Insert the pair into a residual, VAE, or diffusion block so that the model receives the desired perturbation without changing the marginal latent distribution at either endpoint. This creates a controlled alternative to independently sampled noise, especially when marginal drift in repeated stochastic layers is harmful.

Useful5/10
Difficulty5/10
Novelty7/10
Paper: By Law, Every Zero-Mean Risk Is the Difference of Two Equally Distributed Risks arXiv:2607.05460
Unverified 2026

Conservative amortized collision layer

Add a learned stochastic pair-interaction layer to a particle graph neural network, with a conditional normalizing flow generating the post-interaction relative state. Parameterize the update in center-of-mass and invariant relative coordinates so every sampled interaction preserves pair momentum and kinetic energy exactly. The flow learns the transition law directly from observed scattering or trajectory data, replacing repeated numerical collision solves or unconstrained message-passing…

Useful5/10
Difficulty6/10
Novelty6/10
Paper: A particle method for the Boltzmann equation via amortized sampling from Green's function of the lifted linear operator arXiv:2608.22880
Unverified 2026

Rough Multiplicative Random Features

Replace explicitly stored independent random positional features with deterministic multiplicative phase features generated from a small table of random phases indexed by primes. Restrict positions to integers whose prime factors exceed a slowly growing threshold, because the paper's central-limit result says periodic weighted sums over these rough integers recover Gaussian behavior despite strong multiplicative dependence.

Useful4/10
Difficulty5/10
Novelty9/10
Paper: Random Multiplicative Functions with Periodic Weights arXiv:2608.00184