Unverified
2026
Use the paper's norm-regularized conic dualization to impose PSD or SOS-style certificate constraints during neural-network training without forming Schur-complement or second-order-cone liftings. A neural dynamics model can be trained jointly with a polynomial Lyapunov or energy certificate, while the certificate subproblem is solved through accelerated updates in equality-constraint dual variables.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace expensive global spectral diagnostics of a cyclic or block-circulant neural layer by exact small Fourier-block calculations. Add a scale-normalized fourth-moment penalty, or directly cap the largest eigenvalue of each frequency block, to suppress frequency-specific amplification and reduce unstable training in long cyclic convolutions and structured attention.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use deadline objectives to train or control a router that explicitly trades off completion probability against completed work by a fixed horizon. Begin with fair allocation for robust exploration, then anneal toward a feedback-greedy rule once per-item difficulty estimates have sufficient evidence.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a regularizer to a recurrent or state-space transition that makes its expansion along a learned one-dimensional direction approximately constant across hidden states. A learned potential can absorb state-dependent terms, implementing the paper's cohomology mechanism rather than forcing the raw Jacobian to be constant.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add an entropy-Lyapunov consistency term to a recurrent or state-space model whose learned dynamics are intended to reproduce a chaotic invariant distribution. The regularizer targets the equality condition h_mu(f) = sum_i max(lambda_i, 0), while a dominated-splitting diagnostic determines whether the theorem assumptions are approximately plausible instead of blindly forcing equality.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the linear state transition in a small recurrent or state-space module by a circulant matrix acting on a vector over a finite field. The hidden state then has only finitely many possible values and follows an exactly periodic orbit after at most \(q^n\) states, eliminating numerical drift on modular-counting and symbolic-memory tasks. A learned real-valued encoder and decoder can surround the discrete core, while the transition itself is fixed, searched, or trained with a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the memoryless parameter update with a discrete generalized Langevin update whose friction kernel is a positive mixture of decaying modes generated or scheduled by a Loewner driving process. Inject correlated gradient noise using the same kernel, implementing the paper's fluctuation-dissipation mechanism instead of choosing momentum and noise independently. The method is intended for noisy minibatch training, where controlled colored noise can preserve exploration while suppressing…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace or augment an RNN or state-space model hidden state with coordinates on a bounded 3-step nilpotent group. The first layer stores ordinary features, the second layer stores pairwise commutator memory, and the third layer stores nested commutators that can preserve three-time dependencies invisible to first- and second-order summaries. Layered reduction keeps the state bounded while retaining the algebraic interaction structure.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Treat consecutive optimizer updates as a discrete dynamical system and monitor the dominant local multiplier of the parameter-update map. When an estimated real multiplier approaches -1, apply damping or reduce the learning rate, because the paper's mechanism predicts the onset of an alternating period-2 orbit before ordinary divergence is visible.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace generic projected-gradient iterations for equality-plus-bilateral constraints with an active-set semismooth Newton layer. Each iteration fixes currently active lower and upper bounds and solves one structured saddle-point system, potentially converging in a few iterations when only a small subset of constraints is active.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Train a neural predictor using an explicit primal-dual gap instead of only a constraint residual. The gap measures objective suboptimality and constraint violation together, and can provide a principled per-example stopping rule for inner optimization or test-time refinement.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense token-mixing matrix in a sequence model with a fixed or learnable SBP derivative operator D=P^{-1}Q. The discrete integration-by-parts identity makes the interior mixing energy-neutral or boundary-dissipative, reducing exploding activations in deep residual stacks while preserving directional information along the sequence.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a profile-preserving exchange layer that mixes representations through pairwise state swaps, with weights shared over all positions. Unlike ordinary token-wise MLP mixing, the layer explicitly models interactions between two categorical states while respecting the symmetry of position permutations.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Equip multiple recurrent agents with a shared spatial or token-level trail field whose influence is a bounded function of accumulated visitation, rather than an unbounded additive memory. Use the paper's simultaneous/sequential invariance as a falsifiable design target: parallel and randomly ordered asynchronous agent updates should produce nearly identical predictions when trail occupancy is saturated, while deliberately nonsaturating controls should show order dependence. This can enable…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's attribution converse to calibrate watermark strength and sequence length for a registry of N users, rather than tuning detection and attribution thresholds independently. A dual controller allocates a per-token information and KL budget so that the learned key information approaches the minimum required for reliable attribution, avoiding both underpowered marks and unnecessarily visible perturbations.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace Langevin or random-walk sampling for a strongly log-concave neural subproblem with randomized Hamiltonian trajectories. Each iteration draws a fresh Gaussian velocity, integrates position and velocity for a random triangular or exponential duration, and discards the terminal velocity before the next refresh. The target is a regularized posterior over a convex neural-network head, where the paper's accelerated dependence on the strong-convexity parameter is applicable.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
When a chosen sparse support is geometrically incompatible with exact orthogonality, temporarily optimize on a nearby off-diagonally perturbed Stiefel constraint rather than forcing a singular Newton system. Anneal the perturbation to zero after the active support has stabilized, using the paper's O(||Delta||_F) KKT guarantee to control the residual of the original orthogonality-constrained problem.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the usual unconstrained PINN output u_theta(x) with a latent field w_theta(x), and reconstruct the physical solution as u_theta(x) = -2 log cosh(w_theta(x)). Train w_theta to be convex while enforcing the Liouville or real two-Hessian PDE residual and the boundary condition u = 0. The transformation automatically gives u less than or equal to zero, matching the target solutions, while convexity supplies a strong global shape prior.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Split a recurrent or state-space model into a persistent slow state and a fast internal state. Every r recurrent steps, preserve the slow state but reset or contract the fast state toward a learned reference, reproducing selective restart rather than a destructive global reset. The expected benefit is suppression of long-range oscillatory and error correlations while retaining trajectory-level information.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a Lanczos chain for the neural-network vector field or hidden-state evolution, separately within bins of approximately constant loss, energy, or activation norm. Use the resulting Krylov complexity and Lanczos-coefficient growth as an early-warning signal for unstable training or long-horizon hidden-state amplification, then reduce the learning rate or recurrent integration step only in the unstable shells.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use one or a few explicit Coulomb transport steps on generated particles as a differentiable or detached corrector, then train the generator to imitate the corrected particles. This separates global distribution matching from the generator parameterization and can reduce adversarial-gradient noise and mode collapse.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a positive completely monotone memory branch to an optimizer or recurrent state update, but retain an explicitly calibrated instantaneous gradient or input branch. Estimate the memory branch's finite-horizon coercivity and prevent the system from entering regimes where memory suppresses high-frequency corrections and causes slow or unstable training.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a fixed learning-rate schedule with a BB curvature step projected onto an adaptively estimated stable interval. Use the enlarged gradient-descent stability range, approximately below 2/L for an L-smooth objective, but verify every aggressive proposal with a sufficient-decrease test and fall back to a smaller step when the local curvature estimate is unreliable.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.
Useful6/10
Difficulty5/10
Novelty6/10