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 binary neural connectivity mask by independent Bernoulli edge probabilities and optimize a deterministic expected message-passing objective before discretization. The resulting module can search sparse GNN edges or expert-to-token routes without repeatedly sampling many discrete architectures during training.
Construct a sparse attention mask from a fixed regular candidate graph and one scalar random label per token, retaining edge $(u,v)$ when $x_u+x_v\geq\tau$. Unlike independent random pruning, this produces correlated neighborhoods and a controllable distribution of token degrees, potentially giving some tokens broad receptive fields while retaining a fixed sparse budget.
Construct a sparse attention or message-passing mask by sampling edges with preferential weights (d_u+alpha)(d_v+alpha), while keeping the edge count below the predicted connectivity threshold. This creates hub-like local communication patterns but prevents one giant component from forcing dense information mixing, reducing attention cost and potentially mitigating oversmoothing.
Add a graph-derived conditional moment penalty to a neural representation or predictor. For each nested Markov constraint represented after fixing variables in R, residualize functions of (X,Z) with respect to Z under the post-fixing distribution and penalize their weighted correlation with functions of (Y,Z). This directly targets the equality constraint and can be more informative than an unconditional decorrelation penalty.
Construct metric-graph Laplacian positional encodings only at frequencies whose empirical eigenvalues are statistically stable under the paper’s $(n v_\mu(h))^{-1/2}$ law. Use local ball-mass estimates and empirical eigengaps to gate or downweight unreliable eigenvectors, preventing small-sample spectral noise from entering a GNN or graph transformer.
Add a learned stochastic pair-interaction layer to a particle graph neural network, with a conditional normalizing flow generating the post-interaction relative state. Parameterize the update in center-of-mass and invariant relative coordinates so every sampled interaction preserves pair momentum and kinetic energy exactly. The flow learns the transition law directly from observed scattering or trajectory data, replacing repeated numerical collision solves or unconstrained message-passing…