△ Mechanism confirmed, baseline not beaten
2026
Replace independent architecture generation with a diffusion mutation kernel that starts from a known valid neural architecture, re-noises it for only a fraction of the diffusion horizon, and denoises it conditionally toward a new architecture. The resulting candidates should remain closer to the parent and retain validity at low mutation strength, while larger re-noising fractions should produce greater novelty and access to distinct architectural basins.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed or percentile-based gradient-clipping threshold with a threshold computed from the exact joint bias-energy envelope. The controller allows the user to specify how expensive removed-gradient bias is relative to retained update energy, while a running p-moment estimate determines the radius needed to satisfy a target joint-cost budget.
Useful8/10
Difficulty4/10
Novelty6/10
△ 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
△ Mechanism confirmed, baseline not beaten
2026
Modify the flow-matching denoising velocity at every integration step by the smallest Euclidean correction that satisfies a control-barrier inequality on the entire generated action chunk. Aggregate waypoint and constraint barriers with a smooth minimum, so the sampler remains differentiable and can enforce safety without retraining the action model or applying a discontinuous final-action projection.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a neural latent or sequence model with a Gaussian behavior head that predicts an entire future trajectory jointly from the observed prefix and planned inputs. Instead of recursively applying only a point predictor, condition the learned joint trajectory covariance on the available prefix, producing a corrected future mean and uncertainty that incorporates temporal correlations.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a graph and its spectral positional features using affinities between inputs after optimally aligning one input over the known symmetry group. Feed these quotient-space eigenvectors to a transformer or graph neural network, so symmetry-equivalent examples receive the same structural coordinates without storing augmented copies.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Train one prompt-conditioned controller to solve a distribution of stochastic control tasks directly from the control objective, instead of generating an optimal trajectory dataset for every task. Use the probability-flow velocity to evolve particles deterministically, evaluate running and terminal costs on those particles, and backpropagate through the rollout to learn a reusable operator.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a learned critic with group-relative trajectory advantages whose weights are explicitly ordered by terminal feasibility. Feasible rollouts receive larger positive update weight than violating rollouts, while per-timestep normalization prevents high-variance late-horizon returns from dominating the policy gradient.
Useful7/10
Difficulty4/10
Novelty6/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
△ 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
△ Mechanism confirmed, baseline not beaten
2026
Replace a portion of quadratic key-value attention or an external episodic table with a per-sample matrix fast memory updated by rank-one delta corrections. The memory directly learns a linear key-to-value map and can be carried across sequence segments, providing cheap online adaptation with constant state size per head.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add a differentiable SNST layer before an EEG classifier or sequence model. For every local channel pair and wavelet band, compute the magnitude of the complex cross-channel analytic response, then average it over a controllable temporal window and concatenate it with ordinary channelwise features. This gives the model an explicit, phase-robust amplitude-coupling representation that is especially useful when labeled training data are scarce.
Useful6/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained feature vector of size n+1 by the coefficients of a homogeneous degree-n binary polynomial and make the layer transform through the irreducible symmetric-power representation of GL_2(R). For n=4 this creates a five-channel equivariant feature block whose transformation law is exact rather than learned through augmentation.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an independently generated discrete latent sequence or redundancy stream with a symmetric two-state Markov source whose transition probability is tuned or learned. Train the downstream transformer to reconstruct the semantic target after random insertions, while using the paper's insertion-capacity expression to select the latent rate and redundancy budget. The representation should preserve information under timing drift, repeated tokens, and inserted distractors better than iid token…
Useful6/10
Difficulty5/10
Novelty7/10