Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
For z neural branches that share a target, state, or routing observation, add a penalty on fluctuations in the branch direction visible to that shared signal. This implements the paper's centered-square conditioning mechanism: branches remain locally independent in hidden directions, while collective deviations that would produce inconsistent shared outputs are suppressed.
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.
Represent binary nuisance variables or augmentation bits as coordinates of a Hamming cube and penalize the model response that remains predictable from a random k-coordinate subset. Use the theorem's derivative-plus-global-norm certificate as the regularizer, retaining its p/log p dependence instead of using an arbitrary masking penalty. Random coordinate permutations provide a cheap stochastic approximation to the subset average.
Replace a dense directional feature map with a finite stable-zonotope layer: a small set of large random vectors creates a hyperplane arrangement over the input sphere, while a cheaper small-jump residual gives continuous features inside each cell. The layer exposes an explicit compute-versus-resolution knob through the jump cutoff and can be used either as an embedding before an MLP or as a lightweight router for mixture-of-experts blocks.
Add a response-sensitive regularizer to networks whose outputs should react predictably to a control input, using the stationary Markov sensitivity equation as a certificate. Instead of only penalizing large neural gradients, the method attributes amplification to the generator resolvent and can distinguish amplification caused by a nearly slow latent mode from amplification caused by uncontrolled parameter growth.
Use the paper's singular stopping-gain term to explicitly measure how much learned feature covariance crosses a max or routing boundary. Penalize excessive covariance in the normal direction to the switching surface, rather than pretending that the max operation has an ordinary Hessian.
Replace one deterministic residual update with a short cyclic composition of learned vector fields evaluated for randomized, short run times. Because finite compositions of noncommuting flows generate directional-derivative and Lie-bracket terms, changing the cycle order gives the network an explicit, low-cost way to learn drift directions that are unavailable from the individual vector fields alone.
Replace ordinary additive or multiplicative activation noise with a nonnegative count-valued perturbation generated by the Hermite operator kernel. For a nonnegative feature x, sample an integer N whose distribution is exactly the operator's weight sequence and feed N/n to the next layer; the parameter alpha controls an additional even-jump component and therefore changes the noise geometry independently of the ordinary Poisson component.