Unverified
2026
Add a low-dimensional spectral regularizer to an encoder or transformer representation by estimating the first N nonconstant modes of its Gaussian-weighted diffusion operator. Penalize excessive reciprocal spectral mass and unequal low-frequency eigenvalues, using a Gaussian-ball reference calibrated to the representation's effective mass; this discourages latent directions from becoming weak, collapsed, or strongly anisotropic.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace continuously fluctuating conditional-computation decisions with a fixed-charge (s,S) controller for the number of active experts or channel groups. If the currently provisioned capacity falls below s, activate capacity up to S; otherwise retain the current capacity, preventing repeated small routing or kernel-launch decisions. Binomial thinning models the random subset of provisioned experts or channels that are actually available after token load, dropout, failures, or admission limits.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add an integer-lattice feasibility layer after ordinary top-1 or top-2 MoE routing. The router first produces its usual expert assignments, then minimally changes a small number of low-confidence assignments so the batch count vector lies in a prescribed lattice or desired coset, eliminating persistent modular load imbalance that ordinary auxiliary losses may not detect.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add randomized orthogonal frame mixing and an incoherence penalty to tensorized neural layers so that predictions and gradients are less controlled by a small coordinate block. The goal is to retain the bulk, approximately Gaussian behavior of tensor contractions while preventing rare coherent directions from dominating training.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace raw hyperbolic embedding-radius regularization with a dimension-aware effective-radius target. For embeddings concentrated near hyperbolic radius rho in an n-dimensional hyperbolic space, regulate s times log(sinh(rho) / sqrt(n)) rather than rho itself, and use the same quantity to calibrate distance-logit temperature. This should make hyperbolic metric-learning behavior more invariant when embedding dimension, curvature, or model scale changes.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Regularize the Gram spectrum of selected neural layers so that its low-order moments match the spectral moments generated by a truncated q-boson Jacobi operator. Unlike a simple Frobenius or spectral-norm penalty, this controls several parts of the singular-value distribution simultaneously and can discourage harmful spectral tails without forcing all singular values to be equal.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Initialize a neural layer with singular values taken from the finite spectral measure of the paper's q-boson Jacobi operator instead of using Xavier or ordinary orthogonal initialization. The resulting layer has a deliberately shaped singular-value distribution and an explicit finite-size spectral edge, allowing initialization to target stable signal propagation while retaining spectral diversity.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Insert a short gKdV-inspired spectral flow between neural blocks to regularize rough feature maps without using an isotropic low-pass filter. The module applies a Fourier dispersive phase and derivative-coupled polynomial residual updates, with an optional finite factorial dilation penalty to encourage analytic-looking features.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a curvature-aware regularizer to a neural scalar field whose level set represents a shape, occupancy boundary, signed distance function, or decision surface. Instead of differentiating a noisy explicit surface or requiring a mesh, evaluate the tangential divergence of ambient test vector fields directly and penalize its deviation from a target weak relation.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Build a continuous-time neural dynamics module from scalar potential networks and their iterated Lie brackets instead of directly predicting an unrestricted vector field. Gradient primitives provide structured vector fields, while commutators add non-conservative and rotational directions; the paper proves that finite spans of such objects generate every smooth vector field on the stated compact manifold.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent each token or graph node by an anti-Hermitian matrix latent state and replace a standard residual transformation with a discretized Lie-algebra vortex flow. The commutator nonlinearities are equivariant under global unitary conjugation, so the block can learn interactions without selecting a basis and preserves the anti-Hermitian state space when initialized there.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace repeated evaluations of a Gaussian tail or Mills ratio in a neural loss or sampler with a short shifted-Hermite expansion. Choose a positive reference threshold x and represent the actual threshold as x+t; the same expansion then handles a whole batch of different shifts t using recursively generated Hermite coefficients.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Construct a nested sequence of representations in which each coarser representation is obtained from the previous one by a 1-Lipschitz projection. Train prediction heads at multiple scales so coarse predictions remain stable and approximately recoverable from the finer representation, enabling early exit, token pooling, and controlled multiresolution inference.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an empirically chosen momentum or learning-rate modulation by a forcing amplitude calibrated to the homoclinic energy balance of a reduced optimizer mode. The controller deliberately operates below the separatrix-crossing threshold when stable refinement is desired, or slightly above it when the optimizer must escape a basin. This creates a falsifiable transition prediction rather than merely adding noise or tuning a schedule.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace selected ReLU or sigmoid units with a stochastic binary crossing activation that fires only when exactly one of two independent noise thresholds is crossed. The resulting expected activation is low for inputs far below or far above the noise distribution and maximal near its median, creating an analytically controlled band-pass and potentially reducing saturation-driven instability.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Train a linear adapter between two representation spaces so that it preserves not only feature values but also the relative sparsity of sampled directions in the source representation subspace. Penalize the logarithmic spread between the largest and smallest support-size expansion ratios, preventing the adapter from making some directions dense while collapsing others. This is useful for transferring sparse features between checkpoints, aligning sparse autoencoders, or inserting a…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a filtration from learned directed edge or transition weights, compute persistent path homology, and feed compact persistence features into a graph or sequence neural network. Because the paper proves stability under network-distance perturbations, these features should be less sensitive to small changes in edge scores than raw adjacency statistics, while retaining orientation-sensitive information that ordinary undirected topology loses.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Insert a fixed or learnable complex coordinate stretch outside the region where a neural operator models the physical interaction, so outgoing waves are damped and resonant states become ordinary discrete eigenmodes on a finite grid. Train the network with eigenvalue or resolvent losses computed after the stretch, while preserving the physical field in the interior region.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a finite neural prototype dictionary from solutions of Mα = α⁻¹, where the inverse is coordinatewise, and assign positive weights so the dictionary obeys the isotropy identity Σᵢ cᵢαᵢαᵢᵀ = I. Use the resulting frame as the initialization or fixed geometry for embedding prototypes, attention directions, or MoE router experts instead of initializing those vectors independently. The isotropy guarantee should reduce directional collapse and make early optimization…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct p shared neural replicas of the same token or feature set, quotient their outputs by the cyclic group C_p, and train a power head to agree with the representation obtained from a jointly processed p-fold input. Add a filtration score whose value is nondecreasing under the power map and strictly increases on deliberately nontrivial replica combinations. The experiment tests whether this algebraically structured consistency signal is better than ordinary pairwise augmentation…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unrestricted collection of nested dyadic attention windows on a 2D token grid by a sparse antichain: no selected window may contain another selected window. Use the paper's exponential occupancy guarantee to control how many attention blocks reuse the same token, and add a differentiable log-moment penalty during training when exact antichain selection is relaxed. The expected benefit is bounded peak KV reuse and more predictable sparse-attention cost without discarding multiscale…
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Introduce a small auxiliary certificate state for selected attention or message-passing edges, analogous to the dg generator z, whose decoded value is trained to equal the composition of two neighboring transformations. Penalize violations of this differential relation and use the certificate residual to gate unstable two-hop paths. This creates an algebraically checkable regularizer for multi-step reasoning rather than another generic consistency loss.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use relaxed affine-projection layers as a stable iterative stack with an explicit perturbation monitor. The monitor estimates approximation error from quantization, dropout, stochastic evaluation, or low-rank projection and reduces the relaxation parameter when accumulated perturbations become large.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the paper's marginally irrelevant RG flow to schedule communication between two neural feature streams. A fast stream, such as transformer attention, can interact with a slower or more persistent stream, such as an SSM or low-frequency convolutional branch, through a gate that decreases like \(1/(1+a y_0 \ell)\) instead of remaining fixed across depth or training time. A learnable initial amplitude preserves adaptability while the inverse-logarithmic envelope suppresses harmful long-range…
Useful5/10
Difficulty4/10
Novelty7/10