Unverified
2026
Use the Bregman objective's exact residual-dependent curvature to build a positive-semidefinite Gauss-Newton preconditioner for a neural network's scalar regression head. Negative curvature weights are clipped or damped before solving the update, preserving the original gradient while preventing residual patterns from producing unstable parameter steps.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Train a finite-element surrogate by minimizing the assembled discrete potential energy rather than a loss against solved displacement labels. The objective uses only the sparse stiffness matrix and load vector, while its exact energy-gap identity makes it equivalent to supervised regression in the stiffness norm.
Useful6/10
Difficulty3/10
Novelty5/10
Unverified
2026
Replace a fixed global learning-rate estimate in an accelerated optimizer with a curvature envelope that depends on the current estimated optimality gap. Use phase restarts and a descent backtracking test so that the method remains safe when the gap or \(H_1\) estimate is inaccurate. The expected benefit is faster progress on objectives whose curvature is large early in training but decreases substantially near a good solution.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a periodic coarse optimization phase to SGD or Adam that operates on a compressed parameterization and returns a prolongated correction to the full network. Retain nonsmooth constraints or regularizers explicitly through a primal-dual update instead of relying on penalty smoothing. Accept the correction only when it improves a cheap fine-batch merit test, making the method useful even when the coarse objective is only approximately coherent with the fine objective.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use enumerated weighing matrices as sparse orthogonal channel-mixing operators inside MLPs or residual blocks. Their ternary entries reduce multiplication to signed additions, while exact orthogonality prevents amplification or attenuation of feature norms; a trainable fixed-support version can recover expressivity without giving up computational sparsity.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a standard diagonal optimizer preconditioner with a small Riccati-derived feedback controller for a block of neural parameters. The controller explicitly accounts for update-dependent stochasticity, potentially preventing unstable steps in noisy or strongly coupled training dynamics while permitting larger effective learning rates.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace Euclidean projection onto a smooth convex parameter constraint by a local tangent-halfspace linear minimization step. The method is particularly suitable for convex softmax heads or low-dimensional adapter parameters constrained to an ellipsoid, where projections require matrix solves or expensive nonlinear routines but membership and boundary-normal queries are cheap.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace fixed momentum with an online controller that selects the momentum coefficient from an upper bound on the next-step momentum second moment. The controller lowers momentum when minibatch noise dominates and permits higher momentum when the gradient estimate is stable.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace exhaustive optimization of N binary gates by the geometrically admissible sign patterns induced by projections onto a common direction. For two-dimensional gate vectors, enumerate angular cells exactly; for higher-dimensional vectors, sample directions and evaluate only the induced configurations.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an explicit gradient step by an implicit correction using the trajectory derivative \(Dg(\theta)g(\theta)=H(\theta)g(\theta)\), where \(g=\nabla f\) and \(H=\nabla^2 f\). The update should strongly damp high-curvature or stiff modes while preserving fourth-order matching of the local linearized dynamics. Start with a self-contained fourth-order L-stable rational prototype, then compare it with the paper's exact two-stage coefficients after recovering those coefficients from the full…
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace ordinary reverse-mode differentiation through a long sequence of stiff relaxation updates with a projected adjoint that separates slow conserved features from rapidly relaxing residual features. The neural layer can use large outer time steps even when its internal relaxation time is very small, while reconstructing only the microscopic gradient component required by the preceding layer.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace communicated floating-point gradients in synchronous federated or data-parallel training with one-bit threshold queries whose thresholds are sampled publicly before gradients are observed. Use several fixed geometric amplitude scales so the same protocol handles unknown gradient means and heavy-tailed client updates without an interactive localization round. Decode each coordinate from the scale whose neighboring estimates are statistically consistent, then apply the decoded aggregate…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace heuristic magnitude pruning in a layerwise convex reconstruction problem with safe screening based on a perspective relaxation of the cardinality constraint. A channel is removed only when a lower bound for every solution containing that channel exceeds the loss of a feasible incumbent; conversely, a channel is forced to remain when every solution excluding it is provably worse.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an ordinary dense or floating-point eigendecomposition of small Hessian or Fisher blocks with a sequence of rational Jacobi rotations. The rotations preserve Euclidean norms and can be stored using fixed-point coefficients, while approximately diagonalizing curvature so the optimizer can use separate coordinate-wise step sizes. This is especially relevant to low-precision training and blocks with mixed-sign curvature.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use a small population of neural parameter vectors and replace isotropic random perturbations with the paper's masked affine move toward the current best candidate. Select the mask probability and migration distance from the closed-form expected step-length and active-dimensionality formulas, allowing large exploratory moves early and progressively focused moves later.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Run several independent copies of an optimizer with geometrically increasing training budgets so that at least one copy is close to the unknown budget required by the problem. Allocate workers using staggered schedules rather than launching a full hyperparameter sweep, and periodically select or promote the best checkpoint using a held-out minibatch stream. This targets training regimes where the required number of updates is unknown because smoothness, gradient variance, or noise level is…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the decision diagram as an exact optimizer over feasible binary gate paths to separate strong inequalities at the current fractional architecture. Add only violated cuts to the LP or MILP relaxation, rather than enumerating all gate configurations or relying on weak pairwise product constraints.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Use the slow-mode content of a neural network's local optimization dynamics to choose between a near restart and a deliberately larger restart concentrated in fast-curvature directions. The larger perturbation is predicted to recover faster when it has substantially smaller overlap with the slowest Hessian modes, producing an explicit Mpemba crossover in loss or validation recovery.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a sparse expert cascade whose router uses empirical progress, uncertainty, and compute cost to construct an efficient frontier of experts. Instead of always choosing the expert with the largest immediate gain per FLOP, route different confidence states through an ordered sequence of frontier experts, allowing cheap high-variance experts early and safer or more cost-effective experts near the final decision.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a conventional momentum update by a second-order optimization state with an adaptive robust correction. An online disturbance observer estimates the difference between intended gradient-driven dynamics and observed optimizer dynamics, while an adaptive sliding gain compensates for the remaining bounded disturbance. This is intended for minibatch noise, stale gradients, curvature variation, or gradient compression that produces intermittent optimizer instability.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace direct source-to-target attention connectivity by two sparse incidence relations through a set of latent witness tokens. A source token attends only to a small set of witnesses, and each witness attends only to a small set of target tokens; the composed relation is trained to contain exactly one witness for desired pairs and no witnesses for undesired pairs. This produces a controllable sparse attention pattern whose errors can be measured entrywise against a dense teacher or known mask.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace uniform or random landmark selection in low-rank attention with approximate greedy pivoted QR selection on the attention matrix. At each step, select the key whose residual attention column has the largest norm, orthogonalize it against previously selected columns, and stop when the residual energy falls below a target tolerance. Use the selected columns as an adaptive attention basis and reconstruct the full attention output through a small coefficient matrix.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace a costly full-data conjugate-gradient solve for a neural-network linearized least-squares step with a sequence of progressively larger sketched solves. Each solve starts from the previous solution, so early iterations cheaply identify the useful update direction and only the final few iterations use the full training batch.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary momentum SGD with a two-state position/velocity update whose damping and gradient coupling are explicitly constrained by the discrete Schur-stability region identified for the paper's linearized PSO dynamics. Estimate a conservative local maximum curvature and choose the effective gradient step so that the largest Hessian mode remains inside the stability triangle, allowing more aggressive steps without the loss spikes commonly caused by momentum overshoot.
Useful6/10
Difficulty5/10
Novelty5/10