Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Replace additive neural state updates for rotations or rigid poses with a learned forced dynamical system whose configuration is updated by Lie-group multiplication. The network predicts body-frame force or acceleration in the Lie algebra, while the exponential map guarantees that every predicted configuration remains on SO(3) or SE(3).
Augment a neural policy with differentiable environment or data-generation parameters and optimize both using the environment-parameter policy-gradient theorem. The current transition is differentiated with respect to the design parameter, while the continuation value is evaluated under a frozen copy of that parameter; this isolates the local causal effect and avoids repeatedly differentiating through arbitrarily long rollouts. Suitable applications include learnable domain randomization…
Construct a periodic neural integral layer whose fixed singular kernel behaves like |y|^{-s} near the origin, but whose samples on the uniform grid are replaced on a small symmetric stencil by SinCoTrap correction weights. The correction cancels low-order Taylor errors caused by sampling the singularity, while all nonlocal grid points remain unchanged. Increasing the correction order from p=0 to p=1 or p=2 should reduce discretization error without increasing global grid resolution.
Add a learnable cyclic-coordinate mechanism to latent dynamics so that selected latent coordinates do not enter the Hamiltonian and their conjugate momenta become conserved. This provides an explicit dimensionality-discovery and invariance bias, encouraging the model to represent nuisance or symmetry directions compactly instead of spending independent dynamics capacity on them.
Replace a fully connected neural SDE drift with coordinate-wise functions that can read only the paths of graph parents. Learn soft edge gates and penalize violations of the paper's pathwise Lipschitz condition, so the model remains stable during long rollouts and supports explicit interventions on selected coordinates.
Insert a small continuous-time Markov latent module between a neural encoder and decoder, with input-dependent transition rates and a fixed library of graph topologies such as directed cycles, reversible chains, and branching motifs. The output is an observable of the stationary distribution, while a learned convex mixture over topology-specific response curves constrains the network to represent responses as combinations of interpretable nonequilibrium mechanisms.
Modify deterministic actor-critic training so the critic receives an empirical joint state-action distribution and the actor gradient includes both the usual action derivative and the effect of the actor on that distribution. This targets multi-agent or population environments with crowding, consensus, congestion, or mean-field rewards where ignoring distribution dependence creates a systematically biased policy gradient.
Insert a differentiable discrete-time control-barrier correction into the reverse diffusion process for action or trajectory generation. At each denoising step, roll out the candidate trajectory through a learned or known dynamics model, compute the minimum collision margin against all obstacles, and modify the denoising output toward trajectories satisfying one-step barrier inequalities. Unlike rejection sampling, this uses barrier gradients to repair unsafe samples before the final action is…
Initialize a recurrent or state-space transition matrix with weak Wigner noise plus a shared cumulative-sum correlation structure. Increasing the correlation strength produces recurrent eigenmodes one at a time at analytically predicted BBP thresholds, yielding a controllable hierarchy of short- and long-memory modes. The matrix should then be globally rescaled or constrained so that all active modes remain inside the desired stability radius.
Replace the Euclidean hidden-state update of a recurrent or state-space neural network with a mixed manifold state containing a rotation component and Euclidean features. Propagate uncertainty with sigma points in tangent error coordinates, retract rotational perturbations through the exponential map, and compute the training loss from the predicted covariance. This avoids invalid rotations and captures second-order curvature effects that a first-order EKF-style recurrent cell misses at large…
Train a policy network and separate multiplier networks to minimize Bellman, stationarity, feasibility, and complementarity residuals instead of relying on fixed penalties for constrained actions. The multipliers can turn on only when an inequality constraint binds, allowing one actor to learn both interior and boundary behavior without manually tuning penalty weights.
Build a neural PDE surrogate that predicts changes in equilibrium variables rather than changes in conservative state variables. The network receives the local state and geometry, predicts an equilibrium-coordinate increment, and subtracts the network output evaluated at a reference equilibrium, forcing the reference state to have exactly zero learned residual.
Replace interpolation of heterogeneous sensor streams by a phase-indexed recurrent or state-space network with period M, where M is the least common multiple of the sensor sampling periods. The network applies a distinct transition for each phase while using a fixed cyclic phase update, preserving timing structure and allowing missing observations to enter only when their phase-specific sensor is available.
Train a neural state-space model using all replayed transitions, but assign larger weights to samples near the current operating context rather than discarding distant samples. Add a strictly positive weight floor so local adaptation cannot eliminate global coverage or make the regression problem rank-deficient. This should improve prediction across nonlinear regimes while retaining the numerical robustness of full-data training.
Equip a neural policy or learned world model with an MPPI-style rollout planner whose perturbation covariance is conditioned on a discretized latent-state cell and updated from observed transition residuals. Apply spatial diffusion to neighboring covariance estimates using a kernel matched to the empirical visitation distribution, so covariance adaptation is smoothing rather than an unstable independent estimate at every state.
Construct a finite-range, translation-equivariant recurrent convolutional module with an absorbing inactive state, then train its local dynamics so that seeded activity crosses coarse-grained space-time blocks with probability above an oriented-percolation threshold. This should produce reliable long-range propagation without dense global attention while remaining robust to non-monotone local updates and perturbations. Block statistics also provide a diagnostic for vanishing propagation or…
Replace the unconstrained transition of a recurrent or state-space neural network with a DMDc-initialized linear latent transition plus a learned nonlinear residual. Estimate the transition from a short warm-up dataset using Hankel delay coordinates, retain eigenmodes with decay rates near the unit circle for long-term memory, and let the neural residual model dynamics not explained by the linear backbone. This should make long-horizon prediction and slowly varying signals easier to learn while…
Make a diffusion policy or MPPI-style action-sequence sampler less committed to model-predicted cost rankings when the learned world model is inaccurate. Estimate a normalized prediction residual or ensemble disagreement, increase the sampling temperature with that residual, and retain ordinary low-temperature exploitation when the model is accurate.
Separate a pretrained sequence model's passive prediction from the causal effect of an action, and learn only the latter with a compact monotone adapter. The adapter receives the current latent state and an action deviation, but its action-to-output Jacobian is constrained to have the physically correct sign, preventing intervention predictions that move opposite to the applied control.
Attach a finite-state monitor to a neural policy and allow only actions whose successor remains in the simultaneous backward-reachable winning set for all active modes. Modes may encode safety, hardware configuration, and independent task goals. This gives a hard runtime constraint rather than relying on a reward penalty to teach the policy not to enter irreversible dead ends.
Replace an unconstrained recurrent or neural-ODE vector field with a Lie-algebra-valued connection depending on time, input position, and an auxiliary spectral parameter. Train the model both for prediction and for approximate zero curvature, so evolution along different discretized paths is compatible rather than accumulating arbitrary noncommutative drift.
Train an encoder and decoder whose latent observables evolve through one shared linear Koopman matrix, while directly penalizing the empirical invariance residual of the learned observable subspace. This discourages latent coordinates that fit one-step transitions but continually leave the representational subspace, improving long-horizon rollout stability.
Add a safety projection step to every or selected Euler updates of a flow-matching action sampler. Instead of correcting only the first action, differentiate a collision-risk function through the predicted full action chunk, construct local linear inequality constraints, and apply the smallest correction that makes the future trajectory safe.
Attach a sampling-based rollout correction head to a neural policy or learned world model, and adapt its temperature and number of rollouts so that approximation error stays within the contraction margin of a nominal policy. The controller should spend samples only when the local state-dependent error gain is close to violating the small-gain condition, instead of using a fixed MPPI sample count everywhere.