Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Distill the expensive inner minimization over state-estimation errors into a neural correction term that predicts the robust barrier drift, then fine-tune the correction using differentiable closed-loop rollouts. This retains the robustness mechanism while reducing the repeated optimization cost and allowing less conservative behavior than fixed analytic uncertainty bounds.
Replace an EKF or a large particle ensemble inside a neural world model with a fixed-order polynomial chaos representation of the latent state distribution. The transition network is evaluated under quadrature or sampled chaos variables, and Galerkin projection produces the next uncertainty coefficients directly; a coefficient-wise LMMSE update then assimilates observations without backpropagating through resampling.
Replace recurrence or nearest-neighbour analogue lookup with a learned delay-coordinate observer that continuously corrects a latent state using the current observation. Constrain the observer's closed-loop Jacobian or linear state matrix to have spectral radius below one, so prediction error contracts geometrically and required burn-in grows logarithmically with target accuracy.
Augment a flow-matching or diffusion sampler with a dual variable for each equality constraint and integrate the sample and dual variables as one coupled ODE. The learned generative velocity is corrected in the constraint-normal direction using the transpose Jacobian of the constraint, while the dual state accumulates residual violations; this replaces per-step projection or nonlinear optimization.
Turn constrained-flow generation efficiency into an online diagnostic and controller for neural sampling. When the target ensemble changes faster than the flow can track or becomes internally complex, automatically shorten the training window, increase flow updates, or fall back to local MCMC instead of silently accepting biased or highly correlated samples.
Use the renewal Age of Information model to schedule refreshes from heterogeneous federated clients, sensors, retrieval indexes, or world-model observation streams. Sources with high downstream importance and reliable, cheap updates receive shorter refresh periods, while unreliable or expensive sources are refreshed less often. Pack the resulting requests into a non-overlapping communication schedule.
Represent a rotation-dependent scalar or feature field by truncated Wigner-D coefficients and apply Lie derivatives, gradients, and divergence using fixed generator matrices in frequency space. This replaces noisy coordinate-space finite differences and gives an exactly band-limited rotational differential layer with predictable computational cost.
Replace the naive pseudospectral evaluation of a quadratic neural-operator nonlinearity with a two-point split-form product. Use the entropy-stable (alpha, beta) = (1/3, 2/3) split as the default, or learn alpha under the consistency constraint alpha + beta = 1 while monitoring energy growth. The goal is to suppress weakly underresolved aliasing and prevent long-horizon rollout blow-up without full 2/3-rule zero-padding.
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.