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 arithmetic averaging of local latent means or covariances by diffusion of Gaussian natural parameters. Each asynchronous encoder contributes its local observation information, while graph diffusion combines complementary information from agents that individually observe only subsets of the latent state. The fused latent posterior can then drive a recurrent world model, graph neural network, or decentralized multi-view predictor.
Train a cheap neural surrogate globally, then use an ensemble or bootstrap covariance to identify inputs near the estimated upper-tail boundary and inputs where high-fidelity correction is uncertain. Fit a Tikhonov-regularized residual model on the acquired expensive labels and use the corrected predictor for CVaR estimation or risk-constrained optimization. The acquisition policy deliberately ignores easy central-region samples unless they influence the tail threshold.
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
For a neural dynamical predictor, train or maintain several independently initialized models and aggregate their multi-step states using the signed displacement along the locally unstable forecast direction. The key mechanism is cancellation of opposite unstable-manifold errors: ordinary averaging should reduce this component at rate N^{-1/2} when errors are independent and centered, while robust aggregation should be activated when validation residuals show heavy tails or persistent bias.
Replace an O(N^2) kernel-density interaction in a particle neural SDE or diffusion sampler with a clipped, randomly shifted histogram density estimate. Feed the local estimated density into the particle drift as a multiplicative gain, preserving density-dependent dynamics while evaluating all particles through occupied-cell hashing in expected O(N) time for fixed dimension and number of shifts.