✗ 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
Unverified
2026
Use two bounded self-adjoint transition operators in a recurrent or state-space block and penalize their normalized Hilbert--Schmidt commutator. When the penalty is small, the paper guarantees that the pair is close to exactly commuting operators, suggesting a controlled path to a shared eigenbasis and cheaper coordinate-wise dynamics. Add an optional numerical repair step that projects the learned pair toward a simultaneously diagonalizable pair.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the dense output of selected linear projections with a two-sided magnitude threshold that emits zero for small values but preserves signed large values. Learn one positive threshold per projection, or optionally one threshold per output channel, so the network discovers where sparse events can be removed while retaining outlier information.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a single global preconditioner for a multi-penalty neural objective with additive corrections adapted to the joint kernels of the penalty Jacobians. The optimizer is designed to remain effective when individual penalty weights change independently, avoiding the severe conditioning degradation that occurs when a correction space misses a singleton or partial joint kernel.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use cumulative control measures as the input to a neural surrogate instead of the full sequence of control values. For a quasi-static free-boundary system satisfying the paper's average-pressure path-independence assumption, two nonnegative control histories with identical integrals up to time t should produce the same state at t, allowing a smaller training input and fewer distinct control trajectories in the dataset.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use two points with approximately equal minibatch loss to construct an ellipcenter: the intersection of the normal lines through the two points, where the normals are their gradients. The resulting update uses local curvature information in the span of two gradients and can be relaxed toward the current parameters or combined with momentum.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a deliberately nonconservative, antisymmetric parameter-space force to ordinary gradient descent, with its amplitude controlled by an empirically estimated stability margin. The force should move parameters around elongated loss valleys instead of repeatedly descending and stopping along the same local gradient direction, while damping preserves convergence. The method directly tests whether nonzero circulation can improve traversal of flat or ill-conditioned regions without destabilizing…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a sparse graph layer's separate edge transformations with one joint low-rank factorization of all transformations entering each target node. For target node i, concatenate the neighbor matrices horizontally, project all neighbor features into a shared low-dimensional receiving basis, and reconstruct one output; retain the self transformation exactly. This can reduce edge-parameter storage and message-passing FLOPs when the incoming block row has rapidly decaying singular values.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a fixed learned energy or score network but search over inference protocols with different mobility, temperature, and duration. Select the shortest protocol that reaches a target accuracy without exceeding a prescribed entropy-production budget, exploiting the paper's observation that computational accuracy does not uniquely determine the thermodynamic path.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's MBM-GP construction to predict input-dependent big-M constants for ReLU disjunctions during neural-network verification. Exact activation-bound optimization is performed only at a small subset of input points, while a Gaussian-process upper confidence bound supplies conservative bounds elsewhere, reducing verifier preprocessing and potentially tightening the MILP compared with one global worst-case constant.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace random node or token subsampling by a subset selected to preserve the averages of low-frequency graph signals exactly or approximately. Build a graph over nodes or tokens, compute its Laplacian eigenspace, and choose a fixed-cardinality subset whose eigenvector moments match those of the full graph; use the retained subset for graph pooling or downstream attention.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace recursive adaptive coordinate traversal in a CPPN-based architecture generator with one static multiresolution candidate tensor and an active boolean mask. Evaluate all candidate coordinates in parallel, compute local CPPN-output variance over each parent cell's children, and retain only children whose parent is active and whose predicted variation exceeds a threshold. This preserves adaptive refinement while enabling population batching, JIT compilation, GPU vectorization, and…
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a conventional optimizer step by a three-phase cyclic update in which successive parameter blocks or gradient components are exposed to two low-noise phases and one high-noise, chemically driven phase. Treat the loss decrease as mechanical work, phase-dependent gradient-noise scales as reservoir temperatures, and an auxiliary drive as chemical free energy. Adapt the drive toward a target positive cycle affinity rather than increasing the learning rate indefinitely, creating a measurable…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the usual momentum state in an optimizer with a persistent Ornstein-Uhlenbeck-driven velocity subject to a dry-friction threshold. Correlated forcing can help traverse shallow noisy regions, while the friction term suppresses parameter motion when the effective force is small, potentially reducing update noise and improving late-stage stability.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Augment an optimizer with two slowly and periodically modulated controls, such as learning rate and momentum or learning rate and gradient-noise scale. The optimizer state then traces a loop in control space; nonzero curvature can create a net parameter displacement that depends on loop orientation, even when the controls return to their initial values. Use curvature estimates to select loops that produce useful descent while penalizing loops with excessive dissipation.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the corruption channel's information-loss rate to choose diffusion training weights rather than relying only on signal-to-noise heuristics. The conditional-score floor measures where the noisy observation still carries recoverable information about the clean data, allowing training compute to be concentrated on informative time regions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace fixed-budget token or patch pruning with greedy selection that combines a teacher-derived relevance score and Gaussian-process mutual information. Select an item when it is both relevant and non-redundant, and stop when the largest remaining information gain falls below a calibrated threshold instead of retaining a fixed number of items.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Augment SGD or Adam with a short-window estimate of optimizer trajectory entropy production obtained from forward and reverse minibatch or noise paths. Reduce the learning rate when estimated dissipation rises sharply, and increase it only when dissipation remains controlled, avoiding the rare-event sensitivity of exponential work estimators.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace online enumeration over a finite action set with a classifier or lookup map whose regions directly return the action minimizing a one-step predictive-control cost. For affine dynamics and quadratic tracking loss, exact action regions are separated by pairwise cost boundaries, so the approximation can be audited against exhaustive predictive control rather than treated as an unconstrained policy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a uniformly time-stepped neural ODE or state-space layer with a finite set of neural dynamical modes and an event scheduler. The hidden state follows the smooth flow of the current mode until a learned guard function crosses zero, at which point the solver evaluates the state at the event, switches mode, and continues with the new dynamics; this avoids numerical smearing of hard routing, thresholding, and switching behavior.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace projected or retracted updates for constrained spherical parameter blocks with a geodesic Frank–Wolfe update and an iteration-only step size \(\eta_k=a/(k+a)\). The method moves along a minimizing geodesic toward a feasible linear-oracle point, avoiding repeated projection and eliminating line-search or gap-feedback overhead. On locally error-bounded objectives, the paper predicts accelerated polynomial convergence, including \(O(k^{-2})\) for strongly geodesically convex objectives…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Approximate an expensive neural objective as a local second-order Hermite polynomial over a symmetric action stencil, then optimize the fitted polynomial rather than repeatedly evaluating the original objective. Unlike a Taylor model, the coefficients are obtained from function values and do not require reliable action derivatives through a simulator or learned environment.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Model dynamic routing as a multitype branching process: an active token of type d probabilistically creates child activations of type d'. Estimate the corresponding mean offspring operator and regulate its Perron root to a target reproduction rate, typically near one. This should make adaptive-depth or recursively routed networks use sparse computation without producing either rapidly vanishing paths or uncontrolled activation explosions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Before or during graph-neural-network inference, use a tree dynamic program to choose a limited set of active computation nodes and upgraded message-passing edges. A node receives an embedding from an active landmark only when the selected path has enough residual communication radius, so the planner directly optimizes weighted coverage under a joint node-and-edge budget. The resulting active subgraph is then used by a sparse GNN or graph transformer.
Useful6/10
Difficulty5/10
Novelty7/10