Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Attach a dynamic space-time barrier filter to a neural policy instead of directly imposing a noisy, memoryless CBF constraint on its action. The filter state integrates recent barrier residuals with a proper low-pass kernel, while the online safety QP continues to depend affinely on the policy correction, so high-frequency observation noise is attenuated without removing control authority.
Combine a learned dynamics model or neural policy with a short-horizon robust MPC wrapper. Instead of tightening every future constraint by one stationary worst-case radius, propagate uncertainty using the actual neural closed-loop Jacobians and explicitly fall back when the tightened optimization problem is infeasible, making envelope violations observable rather than silently unsafe.
Replace a single optimizer trajectory by N parameter particles and optimize the time until the first particle reaches a target loss or reward threshold. Use distinct interaction regimes: bounded normalized interactions should provide only the usual logarithmic extreme-search improvement, whereas unnormalized coherent force accumulation and stochastic pairwise kicks should produce distinct 1/N and 1/(N ln N) first-hit laws.
Replace a neural controller's pointwise action outputs over a finite horizon with Bernstein control points whose convex hull satisfies actuator and trajectory constraints. The network predicts the control points, while a robust margin accounts for bounded tracking or model-prediction error, making continuous-time actuator feasibility checkable from finitely many inequalities.
Use cumulative control measures as the input to a neural surrogate instead of the full sequence of control values. For a quasi-static free-boundary system satisfying the paper's average-pressure path-independence assumption, two nonnegative control histories with identical integrals up to time t should produce the same state at t, allowing a smaller training input and fewer distinct control trajectories in the dataset.
Wrap a nominal gradient-based optimizer with a diagonal sign matrix that flips updates independently for parameter blocks, while a scheduler tests candidate sign configurations using short-horizon decrease of a Lyapunov-like training energy. The wrapper never changes the magnitude of the nominal update, and when the effective sign pattern is constant, it should recover the behavior of the correctly oriented nominal optimizer after a finite search period.
Use nested parameter-confidence sets to control how far a neural optimizer may move when its local loss dynamics are uncertain. Estimate a local linear model of parameter or gradient evolution, propagate a homothetic tube for possible next iterates, and impose a trust-region radius that shrinks when the estimated contraction margin is insufficient. This gives a model-based alternative to heuristic gradient clipping and predicts a sharp learning-rate boundary tied to the largest uncertain…