Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Construct a branching residual network whose active computational paths reproduce according to a fixed offspring/connectivity law, while a controller can only remove paths using an age- or depth-dependent hazard \(u(a)\). Use the resulting bound as a diagnostic and gating schedule: removal can suppress unstable activity and reduce compute, but it should not be expected to cross the reproduction-driven propagation barrier unless the network's expansion operator is also changed.
Use the paper's marginally irrelevant RG flow to schedule communication between two neural feature streams. A fast stream, such as transformer attention, can interact with a slower or more persistent stream, such as an SSM or low-frequency convolutional branch, through a gate that decreases like \(1/(1+a y_0 \ell)\) instead of remaining fixed across depth or training time. A learnable initial amplitude preserves adaptability while the inverse-logarithmic envelope suppresses harmful long-range…
Use the paper's effective operator 𝒢 = (I + K⁻¹L)⁻¹ as a learned, geometry-aware preconditioner for momentum or latent-state updates. The coupling matrix L changes the response of momentum variables without changing coordinate components, providing a controlled mechanism for mixing fast and slow latent channels.
Use a CFL-like step-size controller for neural simulators or neural ODE rollouts, shrinking the integration step when the predicted state changes rapidly and relaxing it when dynamics are smooth. The controller uses the smallest spatial resolution and maximum predicted velocity, rather than a fixed global step chosen for the worst case.
Use low precision only for repeated neural-function evaluations and intermediate stage vectors of an explicit ODE solver, while keeping the current state, timestep scaling, and final weighted accumulation in higher precision. This targets neural ODEs and diffusion probability-flow samplers, where function evaluations dominate runtime but accumulated integration error can destabilize long trajectories.
Insert a two-mode residual mixer whose mode is selected by a delayed sign variable rather than an instantaneous sign or sigmoid. The delayed mode creates a hysteresis-like effect that prevents high-frequency switching when the latent state is close to the decision surface, while the paper's reduced equations provide a constraint for choosing the delay and mixing strength so the latent energy contracts.