Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Use the cluster-state construction to schedule which groups of trainable parameters receive an expensive update at each optimizer micro-step. Instead of updating every LoRA block, expert group, or layer uniformly, select the block whose local error histogram predicts the largest loss reduction per unit compute.
Use a two-gradient predictor-corrector average as the gradient supplied to Adam, retaining trajectory smoothing while avoiding the three or four gradient evaluations required by full RK3. Vary the mixing coefficient to test whether the reported regularization comes from gradient averaging itself rather than from high-order integration.
Replace a dense or irregular binary interaction matrix in a value-aggregation layer with a signed sum of blocky masks. Each blocky mask groups a set of query rows with a disjoint set of key columns, allowing all queries in a group to reuse one summed value vector. This is most suitable for linear attention, graph message passing, or any layer where the interaction matrix is applied directly to values rather than passed through a row-wise softmax.
Use the paper's affine variation law to warm-start training across nearby constraint or conditioning levels. Instead of independently learning models for every level parameter, predict the change in the relative representation or loss from a structured Chern-form slope and optimize only the correction.
Replace a neural layer's dense parameters by a real parameter tensor and a binary activity mask, then update the mask using importance scores measured across multiple perturbation intervals. Gates that repeatedly occur in non-dominated accuracy–cost configurations receive larger scores and are more likely to be retained or activated, avoiding uniformly random sparse rewiring.
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.
Monitor a smoothed training signal and test whether at least one sufficiently long recent interval has remained within a prescribed tolerance. Use the infimum-over-windows functional instead of a pointwise patience counter, and trigger early stopping or learning-rate decay only when a stable interval is statistically supported under dependent, non-stationary noise.