✗ Failed on benchmark
2026
Use the evolving singular spectrum of the represented matrix W_t=U_tV_t^{\top} to modulate one common, gauge-equivariant learning rate. Slow the shared update when spectral mass accumulates outside the intended low-rank subspace, preventing adaptive dynamics from amplifying nuisance tail directions while retaining the shared-rate structure needed for low-rank recovery.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Train one functional flow-matching network against conditional velocity targets formed from randomly varying finite-rank reconstructions, including sensor sets that are not nested across training examples. Decode predictions from two sensor layouts into a common function representation and add a cross-layout consistency penalty. The paper's convergence result predicts that this remains statistically valid as reconstruction error decreases, unlike methods that implicitly rely on changing grids…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a sequence of tensorized LoRA-style adapters, expert corrections, or residual weight updates as a traceable graph tensor network and add them using path concatenation plus chord overlay. Periodically round the accumulated graph with SVD so adapter rank and inference cost remain bounded while approximation error is explicitly controlled. This targets continual fine-tuning and mixture-of-experts settings where naively summing low-rank updates causes rank and memory to grow with the…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Inject weak, unpostselected stochastic perturbations into activations, attention links, or recurrent transitions, but scale their strength according to effective computational size. The schedule is designed so that noise is initially a weak perturbation and becomes dominant only beyond a controlled depth or sequence length, producing a measurable crossover rather than uncalibrated constant dropout.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Treat undesirable neural-network states as obstacles and steer training or inference away from them with a smooth distance barrier while preserving a nominal loss descent direction. The barrier can protect against exploding activations, excessive attention concentration, unsafe controller outputs, or leaving a certified representation region without introducing discontinuous gradient clipping.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the exact matrix-polar normalization in Muon with the smoothed feedback \(h_\epsilon(M)=M(M^\top M+\epsilon I)^{-1/2}\). This retains singular-vector-aware updates and approximately unit-normalizes dominant spectral modes, but avoids unstable behavior when the momentum matrix is rank deficient or has tiny singular values.
Useful7/10
Difficulty5/10
Novelty4/10
✗ Failed on benchmark
2026
Train masked predictors with an explicit mixture of high-visibility masks, low-visibility masks, and a small atom at the fully masked input. High-visibility masks preserve ordinary denoising quality, while low-visibility and fully masked examples force the network to learn global mode frequencies that are invisible when nearly all context is shown. Tune the low-visibility mass using unconditional-mode recovery as an auxiliary validation metric.
Useful7/10
Difficulty3/10
Novelty5/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
△ Mechanism confirmed, baseline not beaten
2026
Use the relaxed QFT tensor-network topology as a trainable norm-preserving mixer inside a neural block, replacing a dense token-mixing matrix or an expensive global convolution. The network learns data-adapted global interactions while retaining structured O(N log^2 N) application and an exact cheap inverse, making it suitable for image tokens, long sequences, or reversible residual blocks.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace fixed PCA-rank selection in a hidden layer with a renormalization-group-inspired gate over covariance eigenvalue bands. The gate retains modes whose effective quartic interaction remains unstable or strongly scale-dependent, while pruning bands that flow toward the Gaussian noise fixed point. Unlike top-eigenvalue truncation, this is designed for extensive-rank signal distributed throughout the bulk spectrum.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use measured local Jacobian growth to set the variance of dropout, feature noise, or stochastic-depth perturbations, implementing the paper's fluctuation-response idea that multiplicative noise is tied to the positive scrambling or Lyapunov rate. The controller maintains a target growth regime instead of applying a fixed noise schedule throughout training. It predicts a stability transition when the estimated growth rate crosses zero and a variance-growth proportionality that can be tested…
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Train a cheap shared multi-task probe briefly, extract one semantic embedding per task, and use density-based clustering to determine which tasks should share a neural trunk. After clustering, replace the globally shared trunk by one trunk per discovered cluster, with task heads remaining separate; this preserves cooperation among related tasks while isolating destructive task interactions.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace deterministic LoRA importance scores with one-sided tests of whether each rank-one update has population contribution at least a user-selected threshold. Maintain empirical contribution samples during fine-tuning, estimate their uncertainty, and prune the components with the weakest statistical evidence while respecting the target rank budget. The method should avoid deleting components merely because their latest minibatch gradient was small.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Penalize short positive feedback cycles in an iterative neural module by suppressing products of absolute Jacobian blocks around the cycle. This targets the mechanism responsible for exponential temperature sensitivity rather than merely penalizing the total Jacobian norm, allowing strong feed-forward paths while controlling recurrent amplification.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Convert an LM's probabilities over a controlled set of verbal continuations into probabilities over application states using a fixed semantic map, then calibrate the resulting state vector on held-out labeled examples. This replaces unconstrained verbal confidence with an auditable posterior estimate whose error can be directly evaluated.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Train a generative watermark so that its information about the payload is deliberately distributed across positions or overlapping windows instead of being concentrated in a few easily cropped tokens. The objective uses the paper's conditional information profile and the footprint-resolution lower bound to select the smallest carrier support compatible with a target crop size, while preserving generation quality outside that support.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a causal memory branch whose lag-response function is represented by a Bernstein polynomial with coefficients constrained to produce a nonnegative, decreasing, convex kernel. The branch aggregates past hidden states using this kernel, giving the model a learnable long-memory profile while preventing oscillatory, negative, or increasing historical influence.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a multi-expert or multi-task layer whose feature channels are divided into a globally shared subspace and expert-private subspaces. Matrix-weighted message passing couples experts only through selected feature directions, while the nullspace preserves specialization; the graph-cut condition provides a concrete test that the shared channels can propagate across all experts rather than becoming disconnected islands.
Useful7/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained attention or MoE routing matrix with a row-stochastic matrix that preserves a learned Gibbs-like distribution over groups. Anneal its temperature so that the router converges to a block-upper-triangular operator: mixing remains flexible within equal-energy groups, while cross-group traffic becomes directional rather than oscillating or collapsing. This creates a hierarchy-aware inductive bias and can reduce the number of active expert or attention connections.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a consistency loss for a neural model processing irregularly sampled functions or sequences, comparing its latent covariance representation before and after a time-coordinate warp. The target discrepancy should be near zero for affine transformations but should grow with the normalized curvature, bandwidth, and local sparsity of a nonlinear warp.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a small set of known or trusted pairwise costs to estimate the effective entropic temperature of a Sinkhorn attention or mixture-of-experts routing layer directly from its observed transport plan. This provides a calibration controller that can detect over-concentrated routing and adjust epsilon without backpropagating through a costly temperature search.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Insert a projection-space mixer that combines several fixed or learned directions using reciprocal correlations with the current feature, then normalize the result. The exact construction has a universal beta law for its squared input-output cosine, so it can create controlled angular diversity while remaining deterministic and independent of the chosen direction dictionary.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained residual block by a first-order gradient-flow correction whose energy contains first-, second-, and third-difference penalties, mirroring the paper's higher-gradient gravitational energy. The correction suppresses high-frequency modes while retaining a trainable nonlinear residual branch, and its step size can be chosen from an explicit spectral stability bound.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10