Unverified
2026
Treat a two-player neural game as a stochastic monotone operator problem and add an anchor regularizer that makes the current game strongly monotone during early training. Use stochastic extragradient steps inside geometrically decreasing regularization stages, retaining the accumulated anchor rather than resetting it; this should suppress rotational GAN dynamics while avoiding a permanent bias toward the initialization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace dense token attention with K asynchronous local nonlinear consensus updates on a sparse token graph. Each selected token is moved to the unique incident p-mean of its neighbors, producing a tunable message-passing operator that is averaging for p=2 and nonlinear for other p.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a finite-horizon momentum schedule and its coefficient-reversed counterpart, then use the reversed schedule when the desired endpoint criterion is gradient norm rather than function-value decrease. Optimize the schedule on extremal-curvature quadratic proxies, where the dynamics reduce to an exactly simulable scalar recurrence; this creates a cheap, falsifiable optimizer-design procedure without changing the neural-network architecture.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a small ensemble of parameter vectors or a low-dimensional projection of parameters as a periodically driven probability distribution, and optimize the learning-rate/control waveform so that the distribution translates through successive optimization phases at approximately constant speed without unnecessary reshaping. The method adds a dissipation penalty based on probability-current mismatch and uses automatic differentiation through the particle or density dynamics to learn a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Normalize a learned symplectic recurrent transition using the paper's explicit positive-definite factor instead of projecting the entire matrix onto an orthogonal group. Retain the compact unitary dynamics as the stable transport component and separately damp only the noncompact factor, providing a tunable stability mechanism that preserves symplectic structure.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace an unconstrained third-order stationarity update by a Chebyshev root step on a one-dimensional restriction of the neural loss, while monitoring the images of the update map's free critical points. Shrink the trust radius or damping parameter whenever the maximum critical-value gain exceeds one, because the paper's mechanism predicts that critical-orbit expansion marks loss of a safe attracting basin.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct a sparse directed attention mask over ordered tokens by treating token pairs as edges labeled by time or position. Apply a recursive three-hop spanner construction so that every dense temporal route has a sparse route using at most three times as many hops. Run attention only on the selected edges and use three sparse message-passing layers, or a small learned hop-composition block, to approximate dense causal attention.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Convert the paper's second-order forward-backward dynamics into a two-lag optimizer for neural-network parameters. The update combines an anchor-controlled Halpern step with two inertial differences, allowing the optimizer to use both recent velocity and an older velocity while retaining a tunable contraction toward a reference point.
Useful6/10
Difficulty5/10
Novelty5/10
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
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
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 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
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
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
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
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
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
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 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
Split a neural controller into a slow model-based planner and a fast policy instead of requiring either component to perform the entire control task. The MPC output provides a slowly varying nominal action or operating envelope, while the neural policy generates high-frequency residual corrections. This should preserve constraint handling while reducing the frequency of expensive online optimization.
Useful6/10
Difficulty5/10
Novelty6/10