Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Build a recurrent or state-space layer whose transition matrix depends on a scalar pooled from the current hidden state. Estimate the local derivative of the scalar closure and penalize feedback gains that approach the fold threshold, preventing abrupt branch changes and excessive sensitivity.
Replace an unconstrained input-dependent multiplier on a recurrent fast-weight state with a sign-preserving tanh gate. The new state retains an additive low-rank update and optionally a separately modulated innovation term, but the accumulated-memory branch can never be amplified by a factor whose magnitude exceeds one.
Replace a single shared quadratic stability constraint in a routed state-space model with a path-complete family of quadratic certificates indexed by a small graph. During architecture search or training, identify bottleneck certificate nodes whose transition inequalities are nearly tight, split only those nodes, and re-solve the certificate problem. This should permit larger per-mode state transitions than a common Lyapunov matrix while retaining bounded hidden-state dynamics for arbitrary…
Use the paper's inverse-temperature parameter to initialize networks containing m parallel depth-N branches. Choose branch count, depth, or an explicit aggregation scale so that beta = sqrt(2(N-1)/(n log m)) stays below the critical value sqrt(2), preventing the largest random branch from dominating the aggregate. This is applicable to residual multi-branch MLPs and other architectures whose block Jacobian is a sum of products.
Replace independent per-action distributional value heads with a critic whose shared latent particle produces a vector of return samples for all actions simultaneously. Train the predicted joint return vector against a Bellman target vector formed from coupled counterfactual reward-transition samples, using a sliced Wasserstein loss. The greedy action is selected by the mean of the corresponding marginal particles, while shared particles retain cross-action dependence for learning and…
Represent Q-values using latent coefficients and a convex reconstruction operator rather than an unconstrained linear head. Enforce that reconstruction and compression are sup-norm nonexpansive, so the approximate Bellman operator remains a gamma-contraction and cannot exhibit the usual linear-function-approximation divergence.
Replace ordinary momentum with a semi-implicit velocity update containing viscous damping and a proximal dry-friction step, while evaluating the gradient at a look-ahead parameter point. The dry-friction proximal operator exactly zeros sufficiently small velocities, which may suppress late-training oscillations and create finite-time stationarity instead of merely asymptotic velocity decay.
Regularize a recurrent or state-space model using finite-time Lyapunov exponents of its actual hidden-state transition products. Penalize collapsed adjacent exponents while also controlling the largest exponent, encouraging several useful state directions instead of one dominant direction or universal contraction.
Replace an explicit Euler residual update for a skew-coupled hidden state with a five-stage palindromic composition of exact shear maps. Use a=1/4, the unique real coefficient maximizing the analyzed spectral CFL interval, and adapt the step size from an estimate of the learned coupling operator's spectral norm.
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.
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.
Build a recurrent or state-space model with latent coordinates split into tangent variables that carry the modeled dynamics and transverse variables that contract toward a learned invariant manifold. Penalize violations of invariance and enforce a spectral gap between tangent and transverse Jacobian dynamics, preserving useful noncontracting behavior while suppressing off-manifold drift during long rollouts.
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…
Replace a single residual feature field with two nonnegative streams: a primary representation A and a mutant or corrective representation B. A produces B through a one-way source term, while B suppresses A, creating an explicitly tunable competition mechanism that can prevent feature collapse and encourage complementary representations.
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.
Add calibrated multiplicative noise to a binary energy-based model, Hopfield network, or discrete recurrent attractor system so that its effective coupling follows a chosen distance from the collective critical point. Unlike ordinary temperature annealing, the controller distinguishes microscopic channel noise from Gibbs or sampling noise and predicts when ordered attractors should disappear through a measurable susceptibility peak.
Treat the correlation decay exponent and Hermite rank as explicit hyperparameters controlling the roughness of the depth-wise residual trajectory. Use smoother long-memory drivers for stable deep propagation and less correlated drivers when optimization needs more layer-wise diversity, while retaining critical scaling so the network does not collapse to the identity.
Build a recurrent or state-space layer with fixed, spatially heterogeneous relaxation rates and measure its steady response to positive versus negative input offsets. Unlike a homogeneous linear state-space model, an individual heterogeneous realization can generate a controlled even response, allowing directional transport, asymmetric temporal context, or hysteresis-like sequence transformations without inserting an explicit quadratic input feature.
Add a separately identified constant or slowly varying force channel to a neural dynamics model, analogous to the paper's online gravity-trim and mass adaptation. This isolates persistent low-frequency prediction bias from state-dependent dynamics, reducing repeated corrective action by the planner and avoiding expensive network retraining after a systematic shift.
Attach a small, online-adapted Taylor-polynomial residual model to a neural dynamics model instead of adapting all network weights. Construct the dictionary from the local Taylor structure, remove monomials forbidden by known joint-odd symmetry, and update its coefficients with recursive least squares. This yields fast adaptation with an interpretable parameter count and a direct test of whether the assumed symmetry is valid.
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.
Replace unconstrained momentum updates for selected neural-network parameter blocks by damped second-order motion on a unit sphere. The update learns directions while preserving the block norm exactly, and includes the centripetal term required for a valid acceleration constrained to the sphere rather than merely projecting gradients after an unconstrained step.
Represent an intermediate hidden-state matrix as a low-rank factorization and replace a dense residual update by a repeated contractive step followed by hard SVD truncation. Increase or decrease the rank automatically so that the discarded Frobenius-norm tail is below a specified tolerance, providing an explicit accuracy-memory tradeoff instead of fixing the rank in advance.
Regularize a recurrent or continuous-time state model according to the response residues of its slow Jacobian modes, rather than penalizing every small eigenvalue equally. A mode is penalized only when it is both dynamically slow and strongly coupled to the chosen output, loss, or input perturbation, preserving useful slow memory while suppressing dangerous amplification.