Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Use the calibrated compact-support maximum-entropy law as a latent prior or representation regularizer in a VAE or autoencoder. Unlike a Gaussian prior, it prevents latent codes from drifting arbitrarily far while retaining explicitly controlled mean and covariance.
Build a single-hidden-layer network whose hidden weights and biases are sampled from a non-continuous distribution supported on a dense subset of parameter space, then train only the output coefficients. The result motivates discrete or mixed-precision hidden parameters without requiring a continuous Gaussian initialization; finite-width experiments can test whether this retains accuracy while reducing hidden-layer storage and arithmetic cost.
Use the one-edit Hamiltonian walk as an explicit state machine for counters in autoregressive models or world models. Instead of regenerating and re-embedding an entire numeric string after every increment, update only the digit that changes, or append the single leading digit at a block transition.
Store quantized neural-network weights in ReRAM using GF(4)- or GF(8)-based constrained blocks rather than writing raw symbols. The encoder selects codewords whose local patterns cannot create the most damaging short rectangular sneak paths, while a decoder reconstructs the original quantized symbols after sensing. This targets persistent edge-model storage and memristor crossbar weight loading, where reducing read errors may be more valuable than the coding-rate loss.
Replace a dense or irregular binary interaction matrix in a value-aggregation layer with a signed sum of blocky masks. Each blocky mask groups a set of query rows with a disjoint set of key columns, allowing all queries in a group to reuse one summed value vector. This is most suitable for linear attention, graph message passing, or any layer where the interaction matrix is applied directly to values rather than passed through a row-wise softmax.
Replace independent categorical sampling calls with a shared exact sampler carrying a reusable uniform integer state. After sampling category X from a distribution with CDF F, retain the unused portion of the underlying random interval as a new state (Z', M'), so later samples consume residual randomness instead of requesting fresh random bits. The expected random-bit cost should approach the sequence entropy rather than paying a fixed word or byte cost per sample.
Learn or select sparse cyclic convolution or relative-attention offsets whose pairwise differences collide less often modulo the sequence length. The paper's Fourier fourth-power identity turns this combinatorial objective into an FFT-computable differentiable loss, enabling fixed-K sparse patterns with lower aliasing and interference than random offsets.
Add a structural positional channel formed from the Krylov sequence generated by the graph adjacency matrix and the all-ones vector. For graphs with k main eigenvalues, this sequence has rank k, so a GNN can retain all information obtainable from global walk counts using only k node features rather than storing many adjacency powers.
Add a bounded phase variable and a bank of local affine transport maps to an RNN or state-space model. The phase follows an irrational rotation, while the hidden state is transported through cells whose widths determine local gains, giving a controllable memory mechanism with analytically known distortion rather than an unconstrained recurrent Jacobian.
Build a deterministic complex-valued embedding for discrete IDs by evaluating finite-field polynomials through an additive character, but learn coefficients only for one representative of each Frobenius or cyclotomic orbit. The quotient removes parameters that generate exactly the same feature function after the trace map, avoiding flat optimization directions and reducing the size of the embedding layer.
Replace independent top-k expert or attention-edge selection with a gate vector constrained by hierarchical path budgets modeled on the paper's extended-Dyck-path polytope. Ordinary interactions receive continuous nonnegative capacities, while a designated class of cross-group interactions receives binary or clipped-to-one gates, producing structured sparsity and preventing many correlated paths from consuming the same routing budget.
Construct a sparse message-passing graph from a tree backbone by subdividing every backbone edge and attaching leaves so that 2d_T1(x_i)+f_i is constant across backbone vertices. Use this graph as a fixed communication skeleton, with propagation weights calibrated by the predicted spectral radius. The same construction can be compressed into an effective backbone operator by eliminating subdivision and leaf nodes.
Replace a learned recurrent transition with a sparse binary reservoir compiled from prime-count gates. Three permanently active control vertices implement copy and XNOR transitions, allowing the signal state to realize an affine feedback register over \(\mathbb F_2\) with period \(2^m-1\) using only \(O(m)\) edges and bounded in-degree. Train only an input projection and readout, or use straight-through estimators if end-to-end adaptation is required.
Store quantized magnitudes as finite golden-ratio digit strings satisfying the no-adjacent-ones constraint, rather than as unconstrained binary words. A local rewrite pass converts equivalent but invalid patterns such as 011 into 100, making illegal adjacent-one patterns detectable after memory faults while preserving the represented scalar. This is a storage-integrity and decoding scheme, not a claim that canonicalization alone can correct arbitrary bit flips.
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.
Replace one-hot node IDs or large positional encodings in a GNN with coordinates from a compact abelian Cayley graph. The coordinates preserve graph-shortest-path geometry exactly, while Fourier characters of cyclic factors provide smooth neural features with fewer channels.
Represent many related sparse graph or attention patterns inside one fixed host connectivity pattern and activate each target instance with binary directional masks. The learned edge transformation and sparse-kernel layout are shared across instances, while the mask selects the target graph, enabling one compiled operator to process heterogeneous structures.
Construct a candidate feature for every edge pair or structured token pair, then retain a numerically independent subset under a feature-Jacobian matroid. The neural layer computes only the selected interactions, preserving directions that add new information rather than pruning solely by magnitude or attention score.
Build an implicit layer from a piecewise-linear maximal monotone operator on visible variables z_* and auxiliary variables z_**, then eliminate the auxiliary block rather than exposing it in the network output. Compute the layer through a fixed point of the eliminated component of a nonexpansive resolvent, with damping when the auxiliary map is not strictly contractive.
Use the paper's one-bit compressed-sensing lower bound to choose the number of binary latent measurements and to set a nonzero achievable-error floor during training. A sign bottleneck should not be given an unrealistically small bit budget: for approximately sparse latents, the target reconstruction error scales no faster than a power of effective sparsity divided by the number of sign measurements.
Add a topology-aware lower bound to point-cloud or graph token pruning: at each geometric scale, retain at least as many latent representatives as the persistent-homology rank between that scale and a larger scale. The method prevents the pruning module from collapsing independent connected components or cycles that remain persistent, while still allowing compression in topologically redundant regions.
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.
Replace step-by-step hidden-state storage in a latent ODE, state-space model, or world model with a polynomial trajectory represented independently on short time blocks. At the end of each block, pass the next hidden state by summing temporal coefficients, allowing training and inference to discard the completed block while retaining a mathematically exact block interface.
Replace a dense token or channel mixing matrix by a fixed sparse directed graph whose states are ordered pairs of symbols and whose transitions advance through a cyclic phase. Each state has exactly two allowed successors, obtained by appending a symbol different from the previous two, producing a strongly connected, vertex-transitive sparse mixer with shared local dynamics. The prescribed phase structure prevents arbitrary short-cycle routing and can act as an anti-collapse inductive bias in…