Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Construct a block of gradient, preconditioned-gradient, or Hessian-vector-product directions without performing full-dimensional Gram-Schmidt. Use a random sketch to orthogonalize the block cheaply, then solve a small generalized eigenproblem using the true parameter-space overlap matrix so the extracted curvature modes are accurate for the generated subspace. Use the selected curvature modes to form a damped or trust-region optimizer step.
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Split a recurrent state into two blocks and initialize their variances and cross-correlation according to the stationary projective energy distribution induced by the transition. This places the initial hidden state near the typical invariant direction of the dynamics instead of forcing a long transient from zero or isotropic noise.
Use the complex-conjugate palindromic coefficient that cancels the leading temporal phase defect of oscillatory modes. Implement complex arithmetic directly or use an exactly equivalent doubled-real state, then project the final state to its real component for real-valued prediction tasks.
Replace an unconstrained linear residual adapter by an operator \(T\) satisfying a polynomial relation in the commutator operator \(\Delta_A(X)=AX-XA\). Choose the polynomial roots in a stable half-plane so that repeated commutators become nilpotent, making repeated adapter application terminate algebraically and permitting a finite-polynomial inverse of \(I+T\).
Add a structured boundary-like operation to an MoE router that rapidly mixes expert probabilities toward a learned distribution while preserving predefined expert groups. The operation is a rank-one stochastic kernel, so it costs linear rather than quadratic work in the number of experts and can act as a controlled reset when routing becomes concentrated.
Exploit the paper's nested obstruction hierarchy by applying cheap low-order Hankel tests to every example and evaluating larger matrices only for outputs near the current feasibility boundary. This turns higher-order structural validation into an adaptive curriculum rather than an always-on expensive eigendecomposition.