Unverified
2026
Augment a causal sequence model with a small hierarchy of prefix summaries weighted by powers of the logarithmic rank of each preceding token. The summaries retain order-sensitive deviations from a baseline representation while costing O(KNd) for sequence length N, hierarchy width K, and hidden dimension d, instead of O(N^2d) dense attention.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace isotropic input or hidden-state adversarial noise with an adversary that chooses a whole perturbation path in the Gaussian process's Cameron–Martin space. Penalizing the perturbation by its quadratic RKHS energy produces a risk-sensitive objective that attacks temporally coherent failure modes while avoiding unrealistic independent per-token noise.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Model each expert as a cell with occupancy q_i, vacancy n_i = 1 − q_i, and a nonzero localization floor Δ_i. Add a free-volume potential whose derivative becomes strong when an expert is poorly utilized, but remains finite because of Δ_i. Unlike ordinary entropy balancing, this mechanism predicts a quantitative inverse-vacancy regime and a measurable crossover to saturation.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a generic recurrent transition with a finite spectral approximation of the paper's augmented generator: one state block represents ordinary latent dynamics and another represents delayed or refractory history. Inject the input through two learned channels, analogous to bulk forcing and boundary-condition forcing, so the model can represent abrupt events and delayed consequences without requiring a large delay buffer. Parameterize selected mode pairs as stable real Jordan blocks or…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a dense tensor-product positional encoding or first MLP layer with a hierarchical sparse-grid B-spline feature map. The network evaluates only localized basis functions indexed by multi-levels with bounded total level, reducing feature count while retaining high-order approximation for functions with mixed derivative regularity. The basis can initially be fixed and later fine-tuned jointly with the downstream network.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Initialize a coordinate-network feature bank with the leading eigenfunctions of a bandlimited concentration operator instead of random Fourier features. For a desired spatial region E, these features maximize the fraction of their L2 energy inside E among all functions with frequency support in Omega, giving a principled basis for localized signals.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a single Laplacian or fixed diffusion regularizer in a CNN with a finite positive mixture of fractional Laplacians at several orders. The resulting module separately controls short-range smoothing and long-range spatial coupling, while positivity preserves a dissipative energy and avoids the unstable behavior of arbitrary signed mixtures.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a sampled multi-point barycentric nonexpansiveness penalty to a neural map instead of enforcing only pairwise Lipschitz bounds. For sampled points and convex weights, penalize output deviation from the corresponding convex combination whenever it exceeds the input deviation. This encourages stable behavior on unseen convex combinations and can constrain a fine-tuned representation to remain geometrically close to a reference map.
Useful6/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent or deep-equilibrium update with a stochastic approximation step whose learned map is contractive in a selected norm. Use the paper's affine multiplicative-noise viewpoint to calibrate the update rate from observed minibatch noise and a desired failure probability, targeting uniformly bounded iterates rather than only good average behavior. This is especially appropriate for equilibrium layers, recurrent state updates, target-network tracking, and iterative…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Parameterize a recurrent or state-space layer by a matrix-valued Blaschke lift instead of an unconstrained transition matrix. The resulting causal filter is contractive for inputs inside the unit disk and energy-preserving on the unit circle, while its value at z=0 is a freely learned strict contraction.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Constrain the transition matrix of an RNN or linear state-space model to the paper's class Cρ instead of controlling only its spectral radius or spectral norm. The resulting transition has an explicit dilation certificate and satisfies ∥T^n∥ ≤ ρ for every time horizon, preventing exploding hidden states while retaining nonnormal dynamics that ordinary spectral normalization may remove.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense learned linear operator on continuous or image features by a truncated Hermite projection expansion whose coefficients are directly regularized in a Schatten-p norm. The layer becomes a structured low-rank operator, while the radial Hermite-Laguerre correspondence provides an analytically tractable parameterization and an exact spectral penalty.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense token-mixing matrix in a sequence model with a fixed or learnable SBP derivative operator D=P^{-1}Q. The discrete integration-by-parts identity makes the interior mixing energy-neutral or boundary-dissipative, reducing exploding activations in deep residual stacks while preserving directional information along the sequence.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a positive completely monotone memory branch to an optimizer or recurrent state update, but retain an explicitly calibrated instantaneous gradient or input branch. Estimate the memory branch's finite-horizon coercivity and prevent the system from entering regimes where memory suppresses high-frequency corrections and causes slow or unstable training.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace a dense spatial parameter field in a neural field or convolutional adapter by a truncated squared-exponential KL expansion with analytic Gaussian-Hermite modes. The amplitude and correlation length remain trainable, but changing them only rescales coefficients and basis parameters instead of triggering a numerical eigensolve.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the feedbacked control-to-state norm as a conditioning diagnostic to adapt the optimizer step applied to recurrent residual outputs. When the estimated horizon amplification is large, reduce or precondition the residual-control update; when feedback makes it small, permit larger updates.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a wide activation vector or spatial feature field by a small set of weighted coordinates that preserves the p-norm of every activation in a learned low-dimensional subspace. Unlike ordinary pruning, the selection objective is uniform over the whole coefficient sphere, so the compressed representation is designed to preserve unseen linear combinations and not merely the training examples.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a feature transformation that approximates the derivative of a fractional diffusion operator with respect to its order. Instead of only smoothing features with one fractional order, the layer exposes whether a feature changes rapidly across spatial scales, which can help with textures, edges, and multiscale patterns.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a mixture-of-experts layer whose experts compete for a normalized routing resource, and regularize the router so that every expert can grow when introduced at low abundance into the equilibrium dominated by any other expert. The ecological mutual-invasibility criterion becomes a quantitative anti-collapse condition: if expert B has positive invasion growth against expert A's equilibrium and A has positive invasion growth against B, neither single-expert state is locally stable against…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Treat a stochastic optimizer as a Markov transition kernel and monitor its contraction on mean-zero observables using singular values, which remains meaningful for non-reversible momentum dynamics. Adapt optimizer hyperparameters online to maximize an empirical singular-value gap, suppressing oscillatory modes that can have small eigenvalue gap but poor transient relaxation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a functional-calculus regularizer to the transition operator of an RNN, linear state-space model, or deep-equilibrium layer. The regularizer uses polynomial probes to detect non-normal transient amplification that ordinary eigenvalue-radius penalties can miss.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a differentiable regularizer to neural networks that learn sparse Fourier coefficients or trainable Fourier-feature frequencies. It penalizes predicted energy just outside the training interval when that energy exceeds the theorem-shaped envelope relative to observed in-domain L2 energy, discouraging cancellation patterns that fit the observed interval but explode nearby.
Useful6/10
Difficulty3/10
Novelty8/10
Unverified
2026
Replace an unconstrained Fourier-feature block in an implicit neural representation or coordinate MLP with a sparsity-aware layer whose output gain is normalized according to the distance outside the training interval. The normalization uses the paper's endpoint law, preventing a small in-domain Fourier representation from producing arbitrarily large outputs just beyond the observed coordinate range.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single smooth inverse predictor near detected ambiguity boundaries with multiple prediction branches and a soft gate. The gate is trained to preserve distinct decompositions rather than forcing the network to interpolate through a thin high-curvature transition layer, while a Jacobian or curvature penalty identifies unresolved ambiguity regions.
Useful6/10
Difficulty6/10
Novelty6/10