✓ Mechanism works
2026
Search for a compact symbolic optimizer instead of selecting among fixed AdamW-like formulas. Encode optimizer programs as token sequences, learn a continuous variational representation of those sequences, and use a Gaussian-process Bayesian optimizer to propose promising update rules based on short neural-network training rollouts.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Use the activation singular-value spectrum to allocate a fixed zeroth-order parameter budget across layers instead of assigning the same rank everywhere. Layers with a large discarded singular-value tail receive more coefficient directions, while spectrally compressible layers use smaller adapters, preserving the gradient-relevant subspace under a global memory and query budget.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Train a two-dimensional neural deformation map with the paper's Lp conformal-distortion energy instead of using only a determinant or smoothness penalty. The resulting barrier penalizes near-folds and directional collapse while permitting useful nonrigid deformation, making it suitable for spatial transformers, image registration, and learned coordinate warps.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace magnitude-based channel or expert pruning with a subset-selection objective that maximizes the weakest direction in the candidates' activation span. Relax the binary mask to continuous gates, optimize an entropic soft minimum eigenvalue, and round the gates to retain a fixed number of channels or experts. This should preserve diverse representations and reduce redundant feature directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a latent mode bank whose coordinates are learned by neural power iteration on observed state transitions rather than by jointly fitting an unconstrained latent dynamics model. Each mode is repeatedly regressed toward its one-step pushforward, normalized under the data distribution, and deflated against previously learned modes. The resulting latent coordinates are constrained to have approximately linear, diagonal dynamics, which should improve long-horizon prediction and make the…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a network to predict the context-dependent observation matrix rather than the latent inverse parameters themselves, then compute the latent parameters with a differentiable ridge-regression solve. This gives one model that can assimilate arbitrary observation vectors, exposes the conditioning of the inverse problem, and avoids forcing an MLP to learn the entire map from observations to parameters.
Useful7/10
Difficulty5/10
Novelty7/10
Audited (legacy)
2026
Replace uniform embedding dimensions with a globally budgeted allocation based on the estimated spectral complexity of each categorical feature. Tables whose category representations have large leading singular-value energy receive more dimensions, while high-cardinality tables are penalized because each extra dimension consumes more parameters.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace conventional nested bilevel optimization with simultaneous primal-dual updates that enforce inner-model stationarity through a Lagrange multiplier. Add quadratic dual regularization and projection onto a bounded ball, while estimating all Hessian-vector terms using finite differences of ordinary gradients.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace independent top-k expert selection with a decision-diagram router that optimizes a quadratic surrogate over binary expert activations and continuous assignment weights. When expert redundancy or communication costs form a tree, partial routing decisions are merged whenever they have the same separator state, turning exponentially many candidate masks into a dynamic program over a small number of graph cuts.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Replace ordinary momentum with a semi-implicit velocity update containing viscous damping and a proximal dry-friction step, while evaluating the gradient at a look-ahead parameter point. The dry-friction proximal operator exactly zeros sufficiently small velocities, which may suppress late-training oscillations and create finite-time stationarity instead of merely asymptotic velocity decay.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Use Adam normally, but periodically estimate the spectrum of the Adam-preconditioned Hessian and add a damped low-rank Newton correction when the preconditioned curvature is strongly ill-conditioned or the gradient is concentrated in flat directions. The correction is computed only in a small Lanczos subspace, so the method targets cross-coupled ill-conditioning without materializing or inverting the full Hessian.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace an opaque MLP vector field with a stack of trainable symbolic primitives that can express linear terms, monomials, products, and related analytic operations. Apply an L1 penalty and prune small primitive coefficients after rollout training, yielding a compact dynamics module that is cheaper to evaluate and easier to inspect.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace a fixed ridge coefficient in a neural network's final head with a controller driven by inverse spectral mass and hard-edge mass. The head can remain weakly regularized when the feature spectrum is healthy, but automatically increases ridge strength when small eigenvalues signal a high-risk interpolation regime.
Useful6/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
For risk-sensitive or recursive objectives, add a separate network that predicts the conditional certainty equivalent of the next-state continuation value, rather than forcing the value network to approximate a nested nonlinear expectation directly. Train the value, policy, and certainty-equivalent heads with Bellman and first-order residuals jointly.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Modify learning-rate or annealing schedules so that local improvement is not mistaken for convergence when different parameter blocks occupy incompatible global modes. Measure a local-consistency score and a global-coherence score separately; slow training whenever local consistency is high but global coherence remains low, allowing competing parameter domains to merge before cooling further.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the M phase-aligned parameterizations produced by cyclic reformulation as an empirical ensemble of neural dynamics rather than selecting one phase or averaging only predictions. Their centroid supplies a nominal model, while their convex hull defines a low-dimensional uncertainty set used for robust rollout training and uncertainty-aware inference.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add an online low-rank reconstruction layer before a recommender or ranking MLP. It estimates a latent action-feature subspace from masked candidate vectors, freezes that subspace for an epoch, reconstructs each partially observed candidate in the latent coordinates, and feeds only those coordinates to the predictor. The method is most promising when the ambient candidate dimension d is large but the effective rank m is small and missingness is not too severe.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Before training on labels generated by an LLM, estimate the probability that the frozen supervisor admits multiple labels for each input. Use this pointwise ambiguity to gate the learner's loss: train normally on certified-unambiguous examples, but abstain, downweight, or train against a soft label distribution on ambiguous examples. The certificate also gives a falsifiable lower bound on the residual 0-1 error that no target-blind learner can eliminate by collecting more labels from the same…
Useful6/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Use the paper's certificate-sparsification procedure to search for a small Lyapunov proof of an optimizer's contraction on local strongly convex quadratic models. The active interpolation inequalities and resulting sparse Lyapunov coefficients become a data-driven rule for limiting learning rate and momentum per layer or parameter block, instead of relying only on global heuristics.
Useful6/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's scattering energy balance as a measurable regularizer for an existing recurrent or state-space model instead of replacing its architecture. Penalize positive violations of the per-step energy inequality and, for paired examples, penalize violations of incremental passivity so that the model learns not to amplify perturbations over long sequences.
Useful6/10
Difficulty3/10
Novelty6/10
✗ Mechanism failed
2026
Use a teacher and student with comparable hierarchical layers, first matching their representations through a learned affine map and then explicitly encouraging one-to-one coordinate correspondence up to permutation and positive rescaling. This operationalizes the paper's weak-to-strong alignment mechanism for representation distillation, model merging, or stabilizing independently trained replicas.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a standard proximal-gradient or Adam-style update for a composite neural-network objective with a golden-ratio primal-dual iteration. The optimizer separates a nonsmooth regularizer from a locally smooth loss, estimates local curvature from successive gradients, and uses dual variables for explicit constraints instead of forcing all structure into penalty coefficients. The experiment is falsifiable: at equal gradient evaluations, the method should tolerate larger initial steps and show…
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a noisy or expensive per-layer spectral-norm estimate with a sharp upper bound obtained by maximizing the largest squared singular value subject to several layer spectral moments. The bound uses the paper's few-distinct-values structure, so the optimization scales with the number of moments rather than the width of the layer.
Useful6/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build the diffusion drift as a contractive linear term plus a spectrally controlled residual, so trajectories are pulled toward a state-dependent center while retaining nonlinear expressivity. This directly targets the paper's sharper one-sided dissipative regime rather than hoping that ordinary weight decay produces dissipativity.
Useful6/10
Difficulty5/10
Novelty6/10