Unverified
2026
Split the optimizer state into a passive descent sector and an explicitly nonequilibrium current-like sector, then constrain the local update Jacobian to be block triangular. The active sector may perturb the passive update, but passive perturbations cannot feed back into the active sector at first order, making its decay rate measurable and preventing uncontrolled oscillatory feedback. A second design objective tunes the two decay rates to reproduce the paper's slow-mode splitting and uses the…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace dense attention weights with a compactly supported anisotropic bump derived from the obstacle solution, using one learnable ellipsoid per attention head or feature group. Tokens outside the learned ellipsoid receive exactly zero weight, while tokens inside receive smoothly decaying weights according to a fractional exponent. The learned positive-definite matrix represents orientation, scale, and correlations between feature dimensions.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Treat discrete training events such as gradient-norm spikes, curvature changes, rejected steps, or minibatch outliers as jump channels and apply an event-specific parameter update map. The optimizer should be evaluated using both progress and the information cost of selecting the feedback map, because feedback may reduce loss fluctuations or improve adaptation without changing the average update magnitude.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace unconstrained token-to-expert routing with a nonnegative mixture of a small set of feasible routing or communication patterns. Enforce resource limits using the paper's one-sided positive-contribution bound, which gives a conservative certificate without enumerating all joint token activation scenarios. Expand the pattern set only when a separation procedure finds a routing pattern that improves the router objective while adding useful capacity information.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace pointwise high-order derivative residuals in an eigenvalue PINN by an assembled dynamic-stiffness residual \(\mathbf W(\omega)q_\theta\), where each element matrix is obtained from homogeneous PDE solutions. The network predicts nodal degrees of freedom or element boundary traces, while the exact frequency-domain operator enforces the physics without differentiating the network multiple times with respect to coordinates.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a sparse heavy-tailed nonlocal mixing operator into a residual sequence, graph, or spatial network so that information can traverse distant positions without stacking many local layers. Use the critical tail exponent s = 1/2, whose truncated first moment grows logarithmically and predicts an effective propagation distance proportional to depth times log depth rather than merely depth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the noisy Hutchinson estimate of a neural-network Hessian trace with a variance-reduced Hutch++ estimate computed only from Hessian-vector products. Use the estimated normalized curvature to cap or rescale the optimizer step, so learning-rate reductions occur when the loss landscape becomes globally sharp rather than when an individual minibatch gradient happens to be large.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the momentum update in a gradient optimizer by inertial motion plus a gradient-difference term, which discretely approximates Hessian-driven damping. Choose the damping coefficient and step size using the paper's refined stability inequality instead of the older restrictive bound, and adapt them whenever the estimated smoothness changes.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Parameterize an orthogonal or semi-orthogonal neural weight matrix directly on the Stiefel manifold and update it with a Cayley retraction instead of unconstrained SGD plus a penalty or QR projection. The update preserves orthogonality exactly, is second-order accurate for the appropriate metric, and avoids the cubic QR factorization at every optimizer step.
Useful6/10
Difficulty5/10
Novelty5/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