Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Pair a neural latent dynamical system with a reference latent system driven by the same external input, and train a coupling or controller so that a synchrony residual converges to zero. The target is transverse stabilization of a behavior-equivalence manifold rather than pointwise tracking of one selected trajectory or equilibrium.
Use a neural policy only to generate a nominal action, then project that action onto the set satisfying a high-order control-barrier inequality derived from a smooth obstacle-distance function. This preserves the policy's behavior away from obstacles while enforcing a forward-invariant safety region near obstacles, and it can be used either as an inference-time shield or as a differentiable training layer.
Certify during or after RL training that a neural policy keeps the closed-loop state inside a prescribed safe set under bounded disturbances and observation errors. Use spectral normalization or a Lipschitz penalty to reduce policy gain, then compute a conservative one-step safety margin that must remain positive over reachable states.
Train a latent world model with a conditional-mutual-information lower-bound constraint instead of using a fixed curiosity or information-gain coefficient. The dual multiplier increases only when predicted observations contain less information about latent states and model parameters than the goal prior demands, and decreases when the target is exceeded; this produces an adaptive epistemic-pressure schedule with explicit inactive and saturated regimes.
Train a neural value or latent-dynamics model with temporal-difference targets before enforcing a stiff differential-equation residual, and ramp the physics weight only after the critic has become predictive. For a stochastic dynamical model, the residual is computed using the infinitesimal generator, while terminal, safe, and failure boundary conditions are imposed through separate penalties.
Use the estimated task relevance of each latent coordinate to allocate corruption, precision, or redundancy non-uniformly rather than applying uniform dropout or quantization noise. Coordinates with larger mutual-information sensitivity receive lower noise or more bits, while low-relevance coordinates are compressed or corrupted more aggressively.
Add an observability regularizer to a recurrent state-space model or world model so that short sequences of predicted multimodal observations identify the latent state. The regularizer penalizes poorly conditioned Fisher information, preventing the model from storing important state variables in directions that its available observations cannot distinguish.
Use the paper's self-normalized martingale bound to monitor cumulative stochastic gradient noise in covariance-whitened coordinates. Convert its time-uniform confidence boundary into a trust-region multiplier: retain the normal optimizer update while the observed noise is within the boundary, and shrink or clip the update after an exceedance.
Replace a conventional whitening transform with a constrained whitening layer that minimizes cross-channel covariance while requiring every output channel to remain correlated with its designated input channel by at least a threshold \(\rho_{\min}\). The layer exploits the orthogonal freedom in whitening to find a rotation that preserves channel identity instead of arbitrarily mixing features. It can be inserted before an MLP, convolution, or attention projection and compared directly against…
Add a weighted reflection symmetry to an attention or graph-propagation matrix instead of requiring ordinary permutation equivariance. For paired positions or graph nodes related by an involution, penalize the failure of the propagation operator to commute with the weighted reflection; this makes all geometric multi-step propagations symmetry-compatible. The method is suitable for data with mirror, reversal, paired-agent, or left/right structure where the two sides have unequal importance…
Augment each recurrent or state-space hidden channel with a two-dimensional oscillatory state and periodically compute a pseudo-phase from its Cartesian coordinates. Use sparse event-triggered feedback to reduce the squared phase order parameter, preventing hidden channels from synchronising while avoiding the computation and communication cost of continuously recomputing the control signal. The controller acts as a tangent rotation of each two-dimensional hidden state, changing phase diversity…
Distill a teacher's attention into a student by matching sink mass and the normalized content distribution as separate targets rather than applying one KL divergence to the entire attention row. Use the Aitchison distance on the content composition, which compares relative token allocation and prevents a large common sink probability from overwhelming differences between content tokens.
Make directed edge weights trainable while constraining optimization to remain away from eigenvalue collisions of the graph Laplacian. The network can learn task-specific interaction strengths while preserving a measurable diagonalizability margin and avoiding ill-conditioned modal dynamics.
Build a Bloch-conditioned neural model whose periodic-factor representation transforms covariantly when the supplied Bloch wavenumber is shifted by a reciprocal lattice vector. Either canonicalize q to the first Brillouin zone or augment training with mathematically paired examples whose outputs differ by the exact phase gauge. This prevents the network from learning inconsistent predictions for physically identical Bloch modes.
Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.
Replace a dense degree-m tensor interaction layer by a symmetric orbit-parameterized layer with one parameter per exponent vector and explicit multinomial scaling. This preserves the contribution of all ordered tensor entries represented by one orbit, while reducing parameter count and avoiding the amplitude distortion of unweighted monomial compression.
Replace pointwise hidden-state distance penalties with a trajectory metric that measures the largest discrepancy over a short rollout. This directly controls transient amplification: two nearly identical states are considered unstable if their predicted trajectories separate at any intermediate time, even when they happen to reconverge at the final step.
Use the learned variational functional's second functional derivative as a consistency mechanism: equilibrium susceptibility, forces, and phase stability must all be computed from the same Hessian rather than from independently trained predictors. Penalize negative or excessively ill-conditioned Hessian modes during training, while retaining soft negative modes as a detectable phase-transition signal.
Parameterize an entropic OT cost only in directions that can change the transport plan, removing row-plus-column potential directions that are invisible because of OT gauge invariance. Whiten the remaining feature coordinates using their empirical covariance, producing an OT layer whose identifiable parameters have substantially more uniform sensitivity.
Use the theta-SRG of each residual-block Jacobian to regularize its gain and phase spread, rather than constraining only its spectral norm. For an implicit or deeply unrolled residual network, maintain a positive distance between the SRG enclosure of the block composition and the critical feedback point -1, giving a directly testable invertibility margin for long-horizon propagation.
Train a continuous-depth or latent-state neural ODE to be robust not only to spatial perturbations but also to small distortions of elapsed time. Compare nominal trajectories with perturbed pseudo-trajectories under reparametrizations whose secant slopes lie in [1-epsilon,1+epsilon], and penalize failures of a single near-identity time map to track the perturbed path. This targets the paper's distinction between oriented and standard shadowing, which becomes important when the vector field…
Add a topology-aware loss to a segmentation or implicit-shape network by computing radial extended persistence on the predicted boundary rather than on the full predicted mask. Match signed persistence intervals of the prediction to those of the target, penalizing missing, extra, or incorrectly ordered radial components and holes. This should provide a compact shape prior that is sensitive to anatomy-specific radial organization while avoiding volumetric homology computation.
Represent a graph, set, or attributed network as a measurable Z-valued kernel and train on lifted representatives while explicitly minimizing over node couplings. The quotient objective is invariant to relabeling by construction, while the lifted loss gives a dense correspondence signal that can stabilize graph attention and relational encoders.
Use the robust safety interval width as a training signal and activate conservative control before the neural policy reaches an infeasible state. The network is trained to preserve a positive reserve between competing constraints, reducing abrupt projection corrections and making the closed loop less sensitive to model and disturbance errors.