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 ordinary modality-specific residual fusion with a switched observer whose latent correction depends on the currently available channel. The individual channels are allowed to be insufficient to reconstruct the latent state; stability is enforced over the full switching cycle, so complementary intermittent observations can jointly maintain a stable representation.
Parameterize an entropic OT cost only in directions that can change the transport plan, removing row-plus-column potential directions that are invisible because of OT gauge invariance. Whiten the remaining feature coordinates using their empirical covariance, producing an OT layer whose identifiable parameters have substantially more uniform sensitivity.
Paper: Sinkhorn Linearization and the Spectral Proxy: Unifying the Statistical and Algorithmic Theory of Feature-Parameterized Inverse Optimal Transport via a Single Spectral SandwicharXiv:2608.13201
Augment every graph node with a vector of rooted walk and motif densities rather than relying only on degree or Laplacian positional encodings. This should distinguish nodes or communities with identical expected degree but different connectivity profiles, especially in equal-degree stochastic block models and graphs with locally heterogeneous structure.
Replace ordinary absolute positional embeddings with coordinates on a learned flat torus and use dual-lattice Fourier characters as positional features. Control the covariance of the coordinate fundamental domain so that the paper's inequality guarantees a lower bound on the smallest nonzero positional frequency, preventing the learned periodic coordinate system from developing arbitrarily weak or nearly constant modes.
Replace unconstrained attention score vectors by normalized SU(2) coherent-state responses of a positive operator on an (N+1)-dimensional spin space. Each query produces a smooth bounded response over a fixed spherical grid, while values are aggregated normally. The coherent-state kernel imposes geometric structure and exposes a controllable concentration parameter N.
Replace the usual top-eigenvector positional encoding in a graph neural network with a density-selected spectral subspace. The selector explicitly searches below the leading eigenvectors, where community information may survive after latent geometric modes have consumed the largest eigenvalues. The selected coordinates can be concatenated to node features or used as a bias in graph attention.
Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.
Build a graph diffusion or neural-operator encoder whose sparse-observation loss is weighted according to graph distance from the observed nodes. For early diffusion times, suppress supervision or cross-attention demands that are geometrically impossible because signals at distance \(d\) are attenuated like \(e^{-d^2/(2t)}\); gradually release those constraints as diffusion time grows.
Add a fixed or weakly learned interface-localized branch to a sequence model. Set the critical mass term to zero and make the transport coefficient change sign across a learnable interface, producing a localized mode that pools information near a detected transition rather than averaging uniformly over the sequence.