✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace a full neural-network Gauss–Newton solve with a damped solve in an adaptively constructed low-dimensional parameter subspace. The subspace contains the current gradient, recent accepted updates, Krylov curvature directions, and randomized Jacobian-curvature probes, and is enlarged whenever its projected gradient fails to capture enough descent information.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Compress a trained wide analytic-activation MLP by fitting a narrow same-depth student to the teacher's function values and input derivatives, rather than matching only outputs on a calibration dataset. Choose the student width from the input dimension and target error, with a target scaling m = O((log(1/epsilon))^d_in), and use sequential layer fitting plus channel reweighting to limit error accumulation through depth.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a residual module whose state explicitly contains both a persistent context representation and an accumulator. Each residual branch computes one learned correction and adds it to the accumulator, instead of forcing every layer to represent the complete output from scratch. This provides a concrete solver-like architecture for high-dimensional regression and iterative latent prediction.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a continuous-depth or recurrent residual block with a prescribed polynomial Lyapunov decay near its equilibrium. The architecture combines a fixed radial stabilizer with a learned component that is constrained to have zero radial projection, allowing slow algebraic transients and long memory while preventing asymptotic hidden-state growth.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the usual isotropic Gaussian random Fourier features with a frequency distribution matched to the expected spectral regularity of the target function. For coordinate fields, operator-learning maps, or PDE solution surrogates, this should place more features where the target Fourier energy lies and improve approximation at the same feature count. Stabilize the resulting feature matrix with whitening or ridge regression because spectral accuracy can create severe ill-conditioning.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace an unconstrained continuous-depth neural update with a constrained implicit Runge–Kutta step whose internal stages and final state are required to remain in a convex feasible set. For box-constrained latent states, this prevents exploding or negative states while retaining the high-order structure of Radau or Gauss integration and avoiding the order-destroying behavior of post-step clipping.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Constrain a student policy to transform its action in the same way that the input state is transformed, while constraining its value estimate to remain unchanged. During distillation, augment every teacher-student pair with several symmetry-transformed copies and penalize disagreement after transforming the student action back to the original frame.
Useful7/10
Difficulty5/10
Novelty4/10
✗ Failed on benchmark
2026
Initialize each row of a neural weight matrix as a stationary correlated Gaussian process instead of using independent entries, but constrain its correlation tail to remain on the finite-fourth-moment side of the transition. This creates controllable structured spectra while avoiding the heavy-edge regime predicted for correlations slower than \(t^{-1/2}\).
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a large linear map acting on a Cartesian 3D grid and multiple physical channels as a TT-matrix, while retaining separate TT blocks for channel couplings that have different semantics. Apply the layer by sequential contractions with TT cores rather than materializing a dense matrix or a full 3D convolution kernel. Rank truncation provides an explicit accuracy-versus-memory knob and can be applied after optimizer updates.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
For a neural network with a trainable linear head or low-rank adapter, store feature vectors from recent minibatches and select a finite set that is sufficiently independent. Apply Modified Gram-Schmidt to obtain orthonormalized memory directions, then add residual corrections along these directions so the local parameter-error dynamics have an identity coefficient matrix rather than a poorly conditioned empirical Gramian. The method predicts a sharp transition after the buffer first contains…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained neural ODE or recurrent update field with the negative gradient of a learned scalar energy \(E_\theta(z,t)\). The resulting hidden-state dynamics have an exact Lyapunov certificate: energy decreases continuously, bounded trajectories cannot exhibit nonstationary recurrence, and the Łojasiewicz mechanism predicts convergence to a single equilibrium rather than persistent oscillation or chaos.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train a low-width network by repeatedly selecting a normalized neuron that is maximally correlated with the current residual, then refit all output coefficients jointly. This gives a constructive alternative to random initialization of all hidden units and exposes an empirical width-versus-error curve that can guide early stopping or architecture selection.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace a trainable shallow MLP hidden layer by a frozen bank of smooth sigmoid ridge functions and train only a linear output head. Choose the feature count and parameter sampling regime using the theorem's explicit dependence on input dimension d, target regularity k, evaluation norm m, and confidence delta. The construction is especially appropriate for smooth regression, scientific surrogate models, and PINNs, where derivatives of the network output are part of the loss.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a single smooth neural vector field with a finite collection of smooth subnetworks selected by learned affine hyperplanes. The architecture exposes switching geometry directly, allowing it to represent friction-like or threshold dynamics without approximating discontinuities using excessively steep activations.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a dense Haar or Gaussian random projection with a streamed product of random two-coordinate rotations followed by coordinate subsampling. The transform is exactly orthogonal before subsampling, requires only a list of rotation triples, and the paper's pseudo-mixing result predicts that degree-two statistics relevant to norm preservation and Johnson–Lindenstrauss embeddings become Haar-like after only O(n polylog(n)) rotations.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the Euclidean Polyak step in an optimizer with a mirror-descent step whose length is chosen by projecting onto the current affine lower-bound halfspace in Bregman geometry. This permits entropy geometry for simplex-valued router probabilities, log geometry for positive parameters, and other mirror maps without reducing the method to a norm-based learning-rate rule.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train a fixed-rank neural weight update Y=USV^T with a projector-splitting Runge–Kutta step instead of independently applying Adam or gradient descent to U, S, and V. The update evolves the full low-rank matrix using the neural gradient but performs QR-based factor updates, avoiding S^{-1} and remaining stable when adapter singular values collapse or cross zero. Use a common-base midpoint construction so every internal stage starts from the same U,V basis and remains rank r.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace the final layer of a neural predictor with Bayesian linear regression over deterministic trigonometric features, retaining a computable posterior variance and a high-probability confidence envelope over the full bounded input domain. Use this envelope to reject unsafe actions, downweight uncertain training targets, or restrict optimizer updates in regions where the network is extrapolating.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Make a neural network predict a positive Gaussian-mixture representation of the distribution function rather than independent values on a momentum grid. Use the mixture parameters inside a differentiable Boltzmann collision operator, so training directly enforces the interaction mechanism and exposes the relaxation spectrum responsible for ballistic-to-hydrodynamic crossover.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a Bloch-conditioned neural model whose periodic-factor representation transforms covariantly when the supplied Bloch wavenumber is shifted by a reciprocal lattice vector. Either canonicalize q to the first Brillouin zone or augment training with mathematically paired examples whose outputs differ by the exact phase gauge. This prevents the network from learning inconsistent predictions for physically identical Bloch modes.
Useful7/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace a stack of independently parameterized residual or MLP blocks with a small latent grid or vector repeatedly updated by one shared transition rule. Let the number of updates depend on the current latent state, so easy examples terminate early while hard examples receive more computation, potentially improving parameter efficiency and extrapolation.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Insert a linear Johnson–Lindenstrauss bottleneck around a set of jointly processed representations, choosing its width from the sharp finite-set dimension bound rather than from the model's nominal hidden size. The projection should preserve pairwise distances between tokens, patches, or retrieved items, allowing a downstream attention or MLP block to operate at lower width while retaining the geometry relevant to similarity computations.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a dense degree-m tensor interaction layer by a symmetric orbit-parameterized layer with one parameter per exponent vector and explicit multinomial scaling. This preserves the contribution of all ordered tensor entries represented by one orbit, while reducing parameter count and avoiding the amplitude distortion of unweighted monomial compression.
Useful7/10
Difficulty4/10
Novelty7/10