Unverified
2026
Replace Euclidean momentum updates on simplex-valued neural variables with entropy mirror descent when the variable dimension is large and the loss is naturally smooth relative to negative entropy. The lower bound predicts that Nesterov-style acceleration cannot guarantee an asymptotic improvement in this geometry, while the geometry-matched update preserves positivity and can reduce boundary instability.
Useful6/10
Difficulty4/10
Novelty4/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 unconstrained output coordinates with a neural parameterization whose outputs are valid monotone profiles by construction, analogous to representing a Young diagram through nonnegative ordered row increments. Train the network against an explicit energy or negative log-probability while preserving the feasible geometry, rather than relying on penalties that permit invalid intermediate states.
Useful6/10
Difficulty4/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 single recurrent transition with a finite bank of candidate positive linear transitions and use a minimax controller to choose the feedback action at every time step. The controller evaluates candidate successors, selects the action whose worst-case predicted cost is smallest, and clips the action to preserve nonnegative hidden states. This should make an SSM or RNN less sensitive to transition-matrix mismatch and long-horizon disturbances.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When the Schrödinger generator is learned, regularize its spectrum and eigenvectors so that the magnitude trajectory remains well-conditioned for recovering hidden complex states. Penalize small singular values of the squared-eigenvector matrix and near-colliding eigenvalue pair sums, preventing a learned dynamical layer from becoming spectrally invisible or phase-ambiguous.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a constant learning rate by an adaptive prescribed-time gain calibrated to a user-specified deadline. Apply the mechanism to a nonnegative training Lyapunov error such as the loss under a local Polyak-Lojasiewicz condition, or to disagreement errors in distributed training, so that the error reaches a target tolerance by time T without using a singular learning rate.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Compute one-dimensional persistent homology and minimum-norm harmonic representatives, then use their absolute edge coefficients as topology-aware saliency in a graph transformer. Add the saliency to attention logits or use it as a soft regularizer so the model preferentially propagates information along edges that are essential to persistent cycles.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
When clients optimize the same publicly known pair of losses but have private trade-offs, protect only the ratio of objective weights rather than the complete weight vector. Communicate a ratio-conditioned mixed gradient or controller statistic, with sensitivity defined over bounded ratio changes. This can reduce the required privacy noise when common rescaling of all objective weights carries no meaningful private information.
Useful6/10
Difficulty5/10
Novelty8/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 node-restricted graph prototypes by centers that may lie at arbitrary coordinates on graph edges. For each prototype, hold its assigned points and shortest-path branches fixed, then update its edge coordinate by an exact clipped weighted least-squares formula; recompute branch changes only at arc bottleneck points. This creates a graph-aware vector-quantization or retrieval module that can represent semantic locations between existing nodes.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual mean performance objective for a policy or predictor with a positive-margin CVaR objective over sampled deployment perturbations. The network is rewarded only when the mean of the worst perturbation tail remains above a chosen margin, which should suppress brittle solutions that perform well nominally but fail under a small subset of adverse conditions.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Represent an attention or routing state as a symmetric projector or fixed-spectrum positive semidefinite matrix and refine it using the paper's double-bracket flow instead of unconstrained gradient steps. The update rotates the state toward a task-derived Hermitian cost matrix while preserving its eigenvalues, so rank, trace, and spectral diversity remain fixed by construction.
Useful6/10
Difficulty5/10
Novelty7/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
Unverified
2026
Replace ordinary sign-gradient or fixed-range gradient quantization in distributed training with a non-adaptive one-bit refinement block. Workers generate all localization and multiscale residue bits using public randomness before the server knows the current aggregate gradient; after decoding a coarse center, the server chooses which stored phase and scale interpretation to use. This should reduce clipping and variance for heavy-tailed gradients without requiring a second communication round.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a coordinate MLP or neural operator using locations selected by an ordinary-kriging estimate of the unresolved field rather than by uniform random sampling. At each acquisition round, estimate the local reconstruction variance from the current labeled set and query points with the largest variance, optionally weighted by their application importance.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Build a low-rank trilinear attention module in which query, key, and value factors are constrained to the unit sphere and refined through a few proximal alternating sweeps. The proximal terms suppress factor oscillation and make each sweep improve a well-defined tensor interaction objective, offering a stable alternative to unconstrained tensor-power iterations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Cast minibatch parameter optimization as a finite-horizon stochastic control problem and let a positive-semidefinite task matrix determine the covariance and control penalty of artificial parameter-space dynamics. At each adaptation interval, evaluate several candidate task matrices on the same perturbation trajectories using importance weights, then select the candidate with the smallest estimated path-integral upper bound instead of hand-tuning a fixed optimizer preconditioner.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a primal neural PDE solver and a separate physical-adjoint neural solver, then use their first-order-system residuals to adaptively allocate collocation points toward regions that control a chosen quantity of interest. Instead of minimizing only the primal residual uniformly, prioritize points according to a balanced combination of primal and adjoint local residuals, because the target-output error is controlled by their global product.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual independently normalized MoE router scores with a small system of tropical inequalities controlling expert load, score margins, and capacity slack. Each inequality induces a local max-plus policy selecting its currently dominant expert or constraint; policy improvement detects positive-weight cycles that would cause oscillatory routing and applies the smallest bias correction that removes them. This provides a non-differentiable but cheap controller around the router…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's mode decomposition to choose between ordinary DIGing and augmented ATC-DIGing/AugDGM according to the communication spectrum and curvature. The augmented scheme changes the disagreement feedback gain mode by mode, which can reduce the dominant pole radius on well-connected graphs without changing the neural-network architecture.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the small dielectric-anisotropy estimate to replace expensive nonlocal electrostatic solves with a local field-energy surrogate during most neural-network updates. Periodically evaluate the exact field, estimate the approximation constant, and trigger correction solves only when the observed error exceeds the predicted quadratic scale.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Model a checkpointed validation metric as a finite asymptotic expansion in known decay features, such as powers of training step, and estimate its limiting value using sliding least squares. Use a ridge-stabilized fit and require agreement across multiple windows before stopping, preventing the controller from reacting to transient non-asymptotic behavior.
Useful6/10
Difficulty4/10
Novelty7/10