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 conventional deep neural operator with repeated applications of one learned one-step operator whose parameters are shared across time. Train the block at a small step size and require its short-horizon compositions to match observed finite-time evolution, making depth correspond to physical or algorithmic time rather than an arbitrary number of layers.
Replace independently injected federated-learning noise with communication noise whose variance increases with disagreement between a client update and a server or neighboring-client reference. Combine this with a contractive server update so that the sensitivity of later communicated updates decays geometrically, reducing cumulative privacy loss relative to naive composition. The method is suitable for decentralized SGD, FedAvg, or distributed fine-tuning.
Combine the very-weak residual with step activations and one-bit weights, so the deployed PDE solver uses threshold and binary operations while training still optimizes a differentiable surrogate. The weak objective only needs values of the trial function and therefore does not require differentiating discontinuous activations with respect to spatial coordinates.
Replace periodic client-to-server updates for an online neural-network head with event-triggered transmissions based only on local feature regressors and sufficient statistics, not on the current global parameter estimate. Each client transmits when its local Gram matrix or feature-response statistic changes enough that using the previously transmitted value would violate a prescribed perturbation bound. This should preserve exponential convergence in the strongly excited linear-head regime…
Replace an unconstrained input-dependent multiplier on a recurrent fast-weight state with a sign-preserving tanh gate. The new state retains an additive low-rank update and optionally a separately modulated innovation term, but the accumulated-memory branch can never be amplified by a factor whose magnitude exceeds one.
Replace the dense decoder of an overcomplete activation autoencoder with a fixed left-d-regular expander mask and learn only the nonzero decoder values. Tie the encoder to the transpose of this sparse decoder, preserving the activation dimension m, latent width n, and TopK sparsity k while reducing learned dictionary parameters from mn to dn.
Build a sequence or graph module whose state is a canonical set of affine tropical pieces rather than an opaque hidden vector. Compose consecutive segments by Minkowski addition of their lifted supports, merge alternatives by union followed by lower-hull reduction, and evaluate the resulting piecewise-linear function with a minimum.
Replace a large dense layer whose input and output dimensions factor into multiple modes by a TT-matrix whose parameters are stored as a chain of small cores. Periodically apply TT-SVD rounding to remove weak singular directions and keep the representation within a prescribed approximation error. This transfers the paper's central computational principle—perform tensor-product contractions directly in compressed form—to neural network layers.
Replace an unpreconditioned conjugate-gradient solve for a damped Gauss–Newton step with a two-level algebraic preconditioner derived from local Jacobian-row supports. Use overlapping local parameter blocks as Schwarz subdomains and a coarse basis containing low-energy local modes, so the optimizer can correct both localized and globally coupled parameter errors.
Represent every mesh interface degree of freedom by one feature copy per incident cell, and apply local neural blocks directly to these cell tensors. Enforce inter-cell consistency with valence-weighted averaging only after selected layers or hierarchy transitions, avoiding repeated construction of a global sparse graph or assembled feature vector. This is suited to adaptive quadtrees, octrees, and finite-element neural operators.
Replace scalar neural activations by pairs of nonnegative channels whose ratio represents the signed or unsigned activation. Implement multiplication and addition through pair algebra, and renormalize each pair because the representation is invariant under multiplying both rails by the same positive scalar. This creates an explicitly bounded, cancellation-aware arithmetic layer for deep multiplicative MLPs, rational networks, and neural fields.