Unverified
2026
Generate memory slots or attention keys by applying learned unitary transformations to one seed vector instead of storing every slot independently. Select transformations sequentially when they add a sufficiently new direction and reject phase-equivalent or highly coherent candidates, targeting a well-conditioned near-Parseval frame.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a multiscale penalty to transformer token-mixing activations when they are simultaneously concentrated on a spatial or token subset and on a separated, irregular frequency subset. The penalty uses the fractal uncertainty scaling law to discourage hidden states from collapsing onto narrow token patterns and narrow spectral bands, potentially improving robustness to token masking and frequency-corrupted inputs.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a fixed or learnable multiresolution transform before a CNN or vision-transformer block and penalize its coefficients with the paper's local tent-space square function. The penalty couples coefficients belonging to the same spatial dyadic region and can remove localized multiscale feature packets, potentially producing structured sparsity and better denoising than independent l_1 shrinkage.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace Euclidean momentum with a kinetic process on a parameter manifold: parameters are positions, momentum is a tangent vector, and noise is injected only into momentum. Add a cross-covariance correction based on the imbalance between position-gradient and momentum-gradient energies, mirroring the paper's hypocoercive Lyapunov functional. The testable claim is faster escape from badly conditioned valleys and less sensitivity to parameter rescaling than SGD with momentum at matched gradient…
Useful6/10
Difficulty5/10
Novelty4/10
Unverified
2026
Given a learned recurrent dynamics map, estimate a state-dependent invariant measure from each trajectory and use integration against that measure as a projection onto long-term invariant features. Penalize discontinuities of this projection between nearby states and assign zero mass to trajectories whose feature norms escape, producing a principled distinction between convergent attractors and divergent rollouts.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Separate low-support monomials, which involve only a few distinct input coordinates, from high-support monomials in a high-degree symmetric interaction layer. Compute the low-support orbit features exactly and prune, sample, or factorize the high-support tail, using the paper's cutoff scale as the initial sparsity rule.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained deep residual recurrence by a discretized diffusion system over feature or token positions, with trainable source terms and analytically constrained boundary feedback. The state remains nonnegative under nonnegative inputs, while negative boundary gains enforce exponential decay of perturbations and prevent exploding activations in very deep stacks.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize neural features indexed by a compact transformation group using the three conditions from the vector-valued Pego theorem: nearby group transformations should produce nearby features, high group-Fourier coefficients should have small energy, and feature energy should remain concentrated in a fixed low-dimensional value-space subspace. The third term is important for large or effectively infinite-dimensional feature spaces, because translation and Fourier smoothness alone do not…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add an asymmetric distillation loss that requires target or teacher observables to be approximable by source or student observables on only a 1-epsilon mass subset of a coupling. Unlike symmetric feature alignment, the student is penalized only for failing to reproduce target functions on well-matched mass, making the objective robust to outliers, label noise, and partial domain mismatch. The inner minimization allows each target observable to select its best source probe rather than forcing a…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained q-way polynomial or tensorized feature layer with separate decomposable and primitive interaction channels. The decomposable channel models interactions explainable as products of lower physical-weight feature blocks, while the primitive channel captures residual factors that cannot be represented by those products. This should reduce redundant high-order parameters and provide a controllable inductive bias for compositional or disentangled representations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper's explicit approximation bound to select the output-head regularization strength as a function of measurement resolution. Rather than applying fixed weight decay across meshes, increase or decrease regularization so that discretization error and shrinkage error remain balanced.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Treat a minibatch of nonnegative neural features as a smoothed density f in an embedding space and compute its Riesz potential E_alpha f. Add a hinge penalty whenever the observed potential norm falls below the reverse-HLS lower bound determined by the batch mass and its L^q quasi-norm. This directly discourages feature collapse while preserving the theorem's scale-sensitive interpolation structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a tensor-product network over a low-dimensional state and a large distribution embedding with a neural operator that consumes the distribution vector once and outputs values on a finite-difference grid in the low-dimensional state. Train it with the governing PDE residual, explicit boundary residuals, and optional signed shape constraints, allowing the network to preserve numerical structure that a generic MLP would learn only implicitly.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a freely learned finite impulse-response mixing kernel with a matrix polynomial whose roots are constrained to the unit circle. The resulting block-Toeplitz operator has an explicitly positive semidefinite spectral construction, while increasing the polynomial degree gives a systematic capacity knob for approximating matrix-valued frequency responses.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Regularize a recurrent or state-space transition matrix using numerical ranges after bounded-condition-number similarity transforms, rather than only penalizing eigenvalues or the raw spectral norm. The resulting penalty targets nonnormal transient amplification and can certify bounds on powers or other polynomial functions of the transition matrix.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a strict spectral-radius or per-step activation constraint in a linear recurrent/state-space transition with a density-of-spikes constraint. Penalize the fraction of rollout times whose hidden-state norm exceeds a threshold, making the model tolerant of occasional useful transients while suppressing persistent or frequent amplification.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace generic cross-scale mixing with a fixed-shape or lightly parameterized Erdelyi-Kober fractional convolution over logarithmic scale. The fractional order controls how strongly nearby scales are emphasized, while the exponential tail parameter controls the receptive field over distant scales, providing an interpretable alternative to dense cross-scale attention.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Regularize a network by requiring augmented views or independently perturbed feature filtrations to have nearby persistence landscapes. This replaces an expensive or nondifferentiable diagram matching penalty with an \(L^2\) loss on fixed-grid landscape tensors while retaining an upper bound in terms of the underlying Wasserstein diagram discrepancy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace raw polynomial or Fourier-like features in a small MLP with basis functions orthonormal under a Sobolev inner product that jointly measures feature magnitude and input derivative magnitude. This explicitly controls feature smoothness while preserving decorrelation, potentially improving conditioning and reducing the need for large derivative-regularization coefficients.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the Osgood transform as a controller for adaptive residual-layer step sizes. Instead of choosing a fixed residual scale or requiring every block to have a small operator norm, reduce the step only when the predicted transformed pairwise distance consumes too much regularity budget.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a conventional feature-pyramid sum by a bounded multiscale differential transform. At each scale, subtract a blockwise conditional expectation from a local average, then combine these residuals with bounded coefficients. Add a penalty on the largest interval response so that contributions from adjacent scales cannot accumulate destructively or explosively.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a neural coefficient-recovery model with an additional loss that rewards observation sensitivity in every learnable coefficient direction. Instead of only minimizing the reconstruction error of the observed trajectory, explicitly discourage a nearly singular parameter-to-observation Jacobian, which should reduce ambiguous reconstructions and improve robustness to noise.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the network-space inverse inequality to choose derivative order, collocation resolution, and feature separation jointly instead of enforcing arbitrarily high-order residuals on an under-resolved network. This creates an anti-aliasing rule: a network whose parameters are separated by \(\underline h\) cannot represent high Sobolev frequencies without a factor \(\underline h^{-(r-s)}\), so derivative penalties above the resolvable order should be disabled or accompanied by refinement.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace eigenvalue-only stability checks for a continuous-time recurrent or state-space layer with an explicit finite-horizon transient-growth test. Penalize state matrices that have small spectral decay but large induced norms of exp(tA), exp(tA^{-1}), or their discretized transition operators. This targets the paper's phenomenon in which a system is exponentially stable in continuous time yet numerically and inversely unstable because its eigenbasis is highly conditional.
Useful6/10
Difficulty6/10
Novelty6/10