✗ Failed on benchmark
2026
Use the local Jacobian of a looped transformer to estimate its remaining relaxation time and stop the recurrent computation when the predicted residual reduction is sufficient. Near a saddle-node fold, the paper's asymptotic relation converts an estimated dominant eigenvalue into a compute forecast, allowing dynamic iteration budgets instead of a conservative fixed maximum.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed DCT or Fourier transform in transform coding with a trainable isometric tensor-network transform whose local gates are learned once on a dataset. Retain the k coefficients with largest magnitude and reconstruct with the exact adjoint transform; the transform remains norm-preserving and fast while adapting its coefficient ordering to the data distribution.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use a local chaining complexity computed from an empirical input metric to predict stochastic output error for each individual input. Easy, locally concentrated inputs can use fewer dropout, ensemble, or diffusion samples, while high-complexity inputs receive additional computation; unlike a global confidence threshold, the allocation varies with the input.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a learned controller to a physical or simulated plant and use a continuous safety certificate to compute a conservative remaining-time budget before the current action or latent prediction can become unsafe. Compile this spatial margin into a unit-rate temporal contract, allowing asynchronous inference, batching, or early execution without online rollout integration; trigger a new network evaluation only when the countdown reaches a guard threshold.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Precondition activation or cache blocks with a fixed product U = A Sigma B of orthogonal transforms and a random signed permutation before quantization or coordinate sampling. The random permutation makes the product incoherent, so energy is less concentrated in a few coordinates and lossy compression should introduce less worst-case distortion.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Insert a fixed DPSS/prolate projection before an expensive neural block, retaining exactly the modes whose time-frequency concentration eigenvalues exceed a target threshold. Use the paper's tail-quantile formula to choose the projection rank from sequence length, effective bandwidth, and tolerated energy loss, then optionally learn a small correction in the retained coordinates. Unlike a Fourier truncation, the basis is optimized for simultaneous localization in the finite input window and the…
Useful7/10
Difficulty5/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 confirmed, baseline not beaten
2026
Treat a change in a neural network mask, expert set, layer width, or adapter configuration as an optimal transition problem rather than an instantaneous switch. A cheap planner proposes a short sequence of topology masks and parameter interpolations, while an expensive forward-pass feasibility filter rejects each candidate intermediate model if it violates accuracy, activation, norm, latency, or memory limits. This permits dynamic pruning and MoE reconfiguration with a certificate that the…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Attach an evidential cost head to a neural graph model, representing each edge cost by a weighted set of interval boxes, and compress this representation before the downstream shortest-path or routing solver. Instead of minimizing Jaccard or Jousselme distance between the original and compressed mass functions, choose merges that minimize the induced cost error on the currently selected route, while enforcing a conservative monotonicity condition so that the resulting path regret is bounded.
Useful7/10
Difficulty5/10
Novelty8/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 failed
2026
Embed every variable-domain sample into one fixed ambient hyperrectangle and append its signed-distance function as an additional channel to the operator input. Deterministically extend fields outside the physical domain, resample them onto a shared latent grid, apply standard Fourier layers, then interpolate and mask the output on the requested target discretization. The network learns the operator rather than a separate geometry encoder, so the same weights can be used across shapes and mesh…
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
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
△ Mechanism confirmed, baseline not beaten
2026
Attach a certificate to a cached transformer KV state or recurrent latent state and refresh it only while its predicted certificate remains inside a latency-contracted admissible region. The controller uses a bound on certificate drift to guarantee that the state will remain admissible throughout the next sampling, communication, and execution delay, reducing unnecessary recomputation while exposing a measurable refresh boundary.
Useful7/10
Difficulty5/10
Novelty8/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
✗ Failed on benchmark
2026
Replace a neural sequence model's unconstrained multi-step latent rollout with a data-driven LPV predictor acting on a learned latent state. Build the predictor from Hankel matrices of past latent observations, inputs, and scheduling features, then use an LQ factorization to project the large data coefficient matrix into a fixed-dimensional coordinate system. The model preserves scheduling-conditioned dynamics while making rollout cost independent of the number of training trajectories.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
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
△ Mechanism confirmed, baseline not beaten
2026
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
△ Mechanism confirmed, baseline not beaten
2026
Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.
Useful6/10
Difficulty5/10
Novelty6/10