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 a standard recurrent update with a two-state absolute-value cell whose local dynamics are exactly piecewise affine. Train the coupling parameters while enforcing discrete-time Schur inequalities inside each activation quadrant, preventing exploding recurrent trajectories while retaining nonsmooth gating and richer dynamics than a globally contractive linear cell.
Partition a neural network into independently trained or independently monitored modules and constrain their cross-module interaction gain using a compositional contraction certificate. This enables stable deep modular MLPs, graph blocks, or recurrent modules without estimating the full network Jacobian, while providing an explicit coupling threshold for when the architecture loses contraction.
Paper: Contraction Certification from Streaming Data: Wasserstein Robustness and Compositional Stability for Interconnected Nonlinear SystemarXiv:2607.11982
Replace ordinary graph message passing by diffusion over a simplicial complex or hypergraph, using incidence matrices to propagate information through nodes, edges, and higher-order faces. Mix the local higher-order walk with a teleportation operator so that the layer remains globally connected and avoids the slow mixing or oversmoothing caused by poorly connected complexes.
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
Replace repeated full-curvature factorizations when evaluating many Bayesian neural-network hyperparameter settings with one shared low-rank approximation of the data-induced precision update. Reuse the same curvature subspace while changing prior precision, observation-noise precision, or layerwise regularization, evaluating each candidate through a small rank-r matrix and Woodbury solves.