Unverified
2026
Replace a fixed-cubic-regularized Newton step with an adaptive cubic model whose coefficient is increased when the observed loss violates the local Taylor model. The regularizer becomes stronger automatically in regions with large gradients, reflecting the paper's generalized smoothness law, while shrinking near stationary points so that Newton curvature is used more aggressively.
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Replace independent top-k MoE routing with a submodular polyhedral allocation over experts. A learned set function assigns a marginal gain to each additional expert allocation, so the router exhibits diminishing returns and can enforce global capacity constraints rather than making unrelated per-token choices. The allocation is obtained by sorting marginal gains, giving a fast greedy router with piecewise-linear routing regions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Decompose tensor-valued hidden states into invariant symmetric, alternating, and higher Young-symmetry channels before applying learned maps. This removes redundant tensor coordinates and prevents a neural layer from mixing incompatible representation types, yielding smaller equivariant modules with a cleaner inductive bias.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Construct a reusable ReLU trunk that emits approximate univariate powers or Legendre-polynomial features for each input coordinate, then combine them with a linear or low-rank polynomial head. This gives a compact explicit basis for smooth functions and can replace a large generic MLP in low-dimensional scientific regression or serve as a frozen or partially trainable front-end.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
For smooth coordinate-based regression, replace a width-heavy MLP with a deliberately narrow but deeper ReLU network and choose depth and width using the paper's analytic-function approximation law. The hypothesis is that, at fixed parameter count, increasing depth gives a larger reduction in approximation error than increasing width when the target is close to analytic.
Useful6/10
Difficulty4/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 independent coordinate rounding of a fixed-sum vector with nearest-point quantization in the projected integer lattice A_n^*. The quantized vector preserves the zero-sum constraint exactly, while the globally optimal rounding correction accounts for the aggregate residual induced by projection.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a hybrid neural ODE from several smooth vector-field branches and select the active branch using a learned Hamiltonian-like score. Track a positive-definite matrix representing local tangent sensitivity and force its discrete evolution to be positive semidefinite, adapting the paper's monotone Jacobi-curve condition to neural dynamics.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a polynomial graph filter or repeated matrix multiplications in a graph neural network with a small rational filter evaluated at several shifts. Treat the incoming feature matrix as a block of probes rather than processing scalar probe vectors independently, allowing one set of shifted solves to expose multiple spectral directions simultaneously. The expected gain is higher approximation quality at the same number of operator applications, especially when the target filter has sharp or…
Useful6/10
Difficulty6/10
Novelty6/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
Unverified
2026
Represent input or parameter uncertainty locally by a low-order polynomial expansion of the network output, and compute only task-relevant directional third- and fourth-order moments. Add a penalty that calibrates or controls projected skewness and kurtosis, allowing the model to represent bent or elongated confidence regions without constructing a full dense moment tensor.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's cycle-gain criterion to repair an approximate bipartite matching produced by greedy matching, truncated Sinkhorn, or a neural router. A directed edge from matched red item i to red item j represents replacing i's current blue partner with j's partner; any positive-gain directed cycle is a guaranteed improving, feasibility-preserving reassignment.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the conservation-law density to weight diffusion training examples by noise level instead of relying on uniform, cosine, or manually selected SNR weighting. This emphasizes noise regions whose local information contribution is largest while clipping the weights to prevent rare regions from destabilizing optimization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a coordinate-aware long-range aggregation branch whose singular low-frequency component is explicitly centered before it is mixed into token representations. The centering acts as a neural counterterm: constant or slowly varying value fields cannot accumulate an activation contribution that grows with context size, while local and higher-frequency interactions remain available through an ordinary attention residual branch.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn a recurrent or state-space memory into a constrained hereditary state: the latent state remains in a learned convex domain, and only input motion that reaches the boundary changes the plastic component. This creates a nonexpansive, rate-independent memory that should suppress unstable state growth and make the representation depend on meaningful cumulative changes rather than arbitrary update frequency.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a targeted barrier or hinge loss to an existing attention or graph-mixing matrix that penalizes violations of signed circular-minor inequalities. Instead of enforcing only generic entrywise positivity, constrain higher-order noncrossing interactions encoded by determinants. This can suppress pathological oscillatory mixing while still allowing individual entries to be negative when the global structured sign pattern permits them.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use midpoint or running ergodic averages of adversarial iterates for evaluation and checkpointing instead of exposing a single phase-dependent iterate. The mathematical attenuation factor suppresses rotational error, especially for modes with large step-size-times-frequency product.
Useful6/10
Difficulty2/10
Novelty4/10
Unverified
2026
Augment each token or graph node with a periodic latent position x_i and phase θ_i, then evolve these variables before attention or message passing. Tokens with similar phase attract in x, while tokens with similar position synchronize in θ, producing self-organized groups without an externally specified clustering objective. The coupling strengths J and K provide interpretable controls for aggregation and synchronization, and their sweep should expose the paper's four collective regimes and…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace independent uncertainty heads in a branching neural network with a structured variational posterior whose non-root node distributions condition on jointly sampled latent states of all parents. This allows collider evidence to explain away upstream uncertainty: evidence at a child can alter the posterior over several parent branches instead of leaving their uncertainties artificially independent. The approach can be implemented as a stochastic DAG network and trained with an evidence…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a standard permutation-invariant object pool with a latent state on an unordered configuration together with a fiber vector transported along the observed object trajectories. The instantaneous state remains invariant to reordering, but loops and exchanges of objects act through learned monodromy matrices, allowing the network to represent path-dependent interactions without assigning arbitrary permanent object indices.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a conventional leaky recurrent update with a population of stochastic membrane potentials that evolve only while subthreshold, emit an event at threshold, undergo a delayed reset, and receive feedback from a filtered population firing rate. Add a shared noise source alongside independent neuron noise to regularize the layer while preserving coordinated population-level dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace or augment geometric attention on spatial or point-cloud tokens with a positive fractional kernel containing the paper's inverse-square origin factor. This gives tokens near a designated singular center a controlled increase in receptive-field influence while preserving a scale-invariant distance decay, which may help models represent cusp-like fields, radial singularities, and multiscale spatial interactions.
Useful6/10
Difficulty5/10
Novelty7/10