Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Estimate the largest certified input perturbation radius for a neural network using nested reduced primal and dual linear programs rather than solving the complete verification LP immediately. The primal sequence gives certified feasible robustness reserves, while the dual sequence gives valid upper bounds; verification may stop as soon as the interval width is below a prescribed tolerance.
Replace a first-order optimizer update by an extrapolation point followed by one damped Newton or Newton-CG solve, while selecting the acceleration weight from an explicit cubic Hessian-Lipschitz budget. Use a displacement-based safeguard in place of the unavailable distance to the optimum, turning the proof condition into a practical trust-region-like rule that limits unstable momentum.
Estimate the irreducible rejection caused by missing within-block information, then use it to choose the block's conditioning order instead of tuning block length blindly. If the estimated floor is high, expose one or more realized tokens before continuing; if the floor is low but observed rejection is high, spend compute on improving the drafter.
Replace a fixed momentum and learning-rate schedule with a batch-aware stability controller derived from the paper's critical-learning-rate scalings. Polyak learning rates should scale approximately with B(1-rho), whereas Nesterov learning rates can scale as B^beta(1-rho) until reaching the base stability ceiling; this may allow larger batches without crossing the instability boundary.
Replace ordinary token merging or graph pooling with a learned block map whose output preserves information about a remote target conditioned on the surrounding coarse representation. The paper's majority-spin counterexample gives a concrete failure mode: two microscopic configurations mapped to the same pooled token can imply different predictions for distant variables.
Constrain a student policy to transform its action in the same way that the input state is transformed, while constraining its value estimate to remain unchanged. During distillation, augment every teacher-student pair with several symmetry-transformed copies and penalize disagreement after transforming the student action back to the original frame.
Attach a deterministic supervisory automaton to a neural policy or sequence model and mask every event disabled by the current supervisor state. Use a short receding-horizon planner over admissible events to resolve conflicts between neural preferences and shared-resource constraints. The network scores useful actions, while the automaton supplies an exact safety layer.
Train a small encoder and latent Koopman predictor to forecast whether a neural sequence model will enter a high-error or high-instability region, then execute an expensive refinement block only when the forecasted risk exceeds a threshold. The base model remains active at every step, so the learned preview model controls computation rather than directly replacing the main predictor. Add a bounded-rate interpolation when the gate switches off, preventing abrupt changes in recurrent state or…
Replace a globally chosen constant learning rate with a blockwise rate calibrated to the local flatness exponent of the objective. If the local Hessian decays like \(\|x-x_\star\|^{m-2}\), choose the rate so that the predicted stationary parameter radius \(\alpha^{1/m}\) matches a prescribed exploration or optimization radius, rather than incorrectly using the quadratic rule \(\sqrt{\alpha}\).
Use the activation singular-value spectrum to allocate a fixed zeroth-order parameter budget across layers instead of assigning the same rank everywhere. Layers with a large discarded singular-value tail receive more coefficient directions, while spectrally compressible layers use smaller adapters, preserving the gradient-relevant subspace under a global memory and query budget.
Attach an RNCOA-inspired collision loss to a neural trajectory or control-policy head that predicts the pose of a rigid vehicle over time. For each obstacle and time step, aggregate the signed obstacle coordinates of all body vertices using max/min operators, and introduce two nonnegative side slacks whose sum is constrained to at most one. This models the disjunctive fact that the complete body should lie on one admissible side of an obstacle rather than independently penalizing every vertex.
Bootstrap the optimizer curvature scale from a deliberately nondegenerate pair of gradient queries, then perform steepest descent in lp geometry with a local secant backtracking rule. The method does not require a supplied learning rate, smoothness constant L, initial distance R, or optimum value f*, and it automatically uses the dual norm associated with p.