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
Use a transport map \(Q_\theta\) from a fixed latent reference distribution to a data distribution, but expose only its locally averaged version \(\bar Q_{\theta,\sigma}(z)=\mathbb E_{u\sim K_\sigma(\cdot-z)}Q_\theta(u)\). Latent-space mollification integrates the pole-type influence singularity instead of allowing one training sample near \(Q_\theta(z)\) to dominate the quantile feature or its gradient.
Useful6/10
Difficulty4/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
Augment diffusion score matching with a penalty on the exponential moment of the score residual, targeting the sub-Gaussian error regime identified as necessary for tractable sampling. This penalizes rare, catastrophic score errors much more strongly than an L2 loss and should improve robustness of reverse-time sampling in low-density regions.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace the explicit Euler, Heun, or fixed-step midpoint update used for a neural ODE or diffusion probability-flow trajectory with a two-stage randomized SDIRK step. Draw one random scalar per time step, use it in both implicit stage equations, and solve each stage with Newton or damped fixed-point iteration. The randomness targets quadrature error caused by nonsmooth score networks, while the singly diagonal structure permits reuse of the same Jacobian preconditioner for both stage solves.
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Replace one-shot spatial feature activation with an iterative bistable reaction-diffusion layer whose pixels or tokens settle into two metastable states while diffusive coupling removes small domains. Keep the dynamics near the pinned-to-cascade regime so inference proceeds through a small number of collective flips instead of many expensive smooth updates. This is especially suitable for segmentation, denoising, cellular neural networks, and binary latent representations.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the ordinary combinatorial Hodge propagation in a simplicial neural network with a geometry-induced weighted Hodge Laplacian built from Euclidean simplex volumes. The operator preserves the harmonic/topological subspace while changing the positive spectrum according to the shape and scale of the simplices, allowing message passing to distinguish geometrically meaningful cells that have identical incidence patterns.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Implement a neural controlled differential equation update using a truncated planar-binary-tree expansion rather than a first-order Euler step. Select the truncation order from driver regularity and the observed magnitudes of elementary differentials, while using a cancellation-aware remainder monitor to avoid computing unnecessarily high-order terms.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a scalar competence state to a tool-augmented neural agent and let it control the probability of calling an external tool. Competence rises after autonomous success and decays when the agent offloads work, while tool reliance rises when competence is low; this creates a deliberate hysteresis loop that avoids both excessive tool calls and irreversible dependence. The router should be tested by temporarily removing the tool and measuring whether autonomous performance recovers.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use multiple oscillator modes with weak phase coupling and regularize their active amplitudes toward a common squared amplitude. This transfers the paper's conclusion that coupled nonzero modes satisfy $A_j^2=A_k^2$ or that a mode collapses to zero, producing a controllable mixture of synchronized persistent modes and suppressed modes.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unsigned two-hop cyclic mixer by the paper's alternating signed circulant. The sign pattern preserves one-step and two-step interactions while reducing the exact spectral radius from 4 to 2√2, allowing a larger raw mixing coefficient under the same operator-norm stability constraint.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Apply the paper's nested coupling between path distributions at two Krasnosel'skii–Mann depths to an iterative neural block. Penalize discrepancies between intermediate representations using the coupling mass, so that the short unroll learns to approximate the long unroll while preserving the block's actual computational-path geometry. At inference, use the resulting coupled discrepancy as an early-exit criterion.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment a residual neural layer with a Fourier-domain scale-selective flow containing a learned second-order term and a fourth-order stabilizer. The block permits controlled low-frequency amplification, as required by the KS infrared mechanism, while damping high-frequency feature noise and preventing unbounded spectral growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a statistical-complexity maximization term to attention rows or MoE routing distributions so that each probability vector is encouraged to contain a small dominant core and a nearly uniform low-probability halo. Unlike ordinary entropy regularization, this explicitly favors an intermediate concentration regime and predicts a two-level structure: one or a few large probabilities and all remaining probabilities close to one another. The regularizer should use a small coefficient because its…
Useful6/10
Difficulty4/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
Insert a learnable semigroup layer that evolves features according to a positive operator combining frequency damping and spatially varying confinement. Unlike isotropic Gaussian smoothing, the layer can damp selected frequencies differently along different axes and can suppress activations in learned spatial regions, while the positive-semigroup construction prevents amplification.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Require the calibrated state posterior to remain unchanged when evidence is presented through information-equivalent prompt templates. Compare state distributions after semantic aggregation rather than raw token probabilities, and add a total-variation consistency penalty during calibration or fine-tuning.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace the unsigned adjacency used by a deep message-passing network with a signing selected from an affine family that makes designated short even cycles unbalanced. Search this family for a small even-power trace, which acts as a proxy for a smaller spectral radius and suppresses explosive long-range propagation. The signing can be fixed before training, so the method adds no per-example inference cost.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary random draws of auxiliary variables in an expectation-based neural loss by a transformed digital-net batch. For each coordinate, use the first p digital-net bits to select one of 2^p equal-weight quadrature nodes, preserving high-dimensional digital-net structure while making smooth low-dimensional projections behave like product cubature. This should reduce minibatch gradient variance when the loss depends smoothly on a few augmentation, noise, or latent coordinates.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a second-order recurrent cell with an odd high-degree restoring force and lower-degree state-dependent velocity feedback, while representing time-dependent coefficients as a finite Fourier series. At each training or inference window, retain and normalize only Fourier modes below K = c_* log A, where A is the current hidden-state amplitude; apply bounded corrections to nonresonant low modes and leave the analytically small high-frequency tail untouched. The predicted benefit is…
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a continuation-value correction and an explicit positive margin to routing or adaptive-computation decisions that consume a stateful resource. The margin prevents the degeneracy in which learned rent exactly cancels immediate surplus, making the network highly sensitive to noise, quantization, or small state-estimation errors.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a causal gate to a neural safe-RL controller that distinguishes between evidence observed before a potentially irreversible action and evidence generated by that action itself. The policy may switch from a conservative controller to a model-specific aggressive controller only when the precommitment likelihood ratio against every dangerous alternative exceeds a threshold; otherwise it must choose an action with a verified safe continuation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the paper’s sharply different scaling laws to decide whether additional data should be spent on more test-time views or on retraining and refining the dictionary. Extra test replication is useful for separating active coordinates, but cannot overcome unresolved dictionary orientation when Ns⁶ remains small.
Useful6/10
Difficulty4/10
Novelty8/10