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
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
Unverified
2026
Train Fourier or state-space neural models by eliminating well-conditioned spectral modes first and retaining near-resonant modes until a later stage. The schedule is determined by the small-divisor geometry of a reference transport vector, with a cumulative Brjuno-like budget controlling how aggressively spectral corrections may be applied. This should prevent rare nearly resonant modes from producing disproportionately large gradients or unstable long-horizon rollouts.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace penalty-based equality-constrained training with a two-timescale optimizer. A fast variable tracks the normal correction that drives constraint residuals toward zero, while the slow parameter update follows the task gradient projected onto the local constraint tangent space. This should reduce sensitivity to very large penalty weights and preserve feasibility more accurately during training.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the resolvent trace as a differentiable statistic that controls how strongly a learned routing or recurrent transition matrix returns to short cycles. Penalizing this quantity suppresses accidental short feedback loops, while matching a target trace can impose a desired memory profile in recurrent, graph, or mixture-of-experts architectures.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use a Christoffel word as a periodic binary gate for an expensive training operation: activate the operation exactly r times in every N-step period, but distribute those activations as uniformly as possible rather than in blocks or independent Bernoulli trials. Candidate operations include SAM perturbation steps, Hessian-vector preconditioning, gradient clipping, EMA teacher refreshes, or an auxiliary MoE expert. The intended benefit is lower burst-induced gradient variance at the same average…
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Insert a distribution-free rank warp before selected MLP or attention projections. For each scalar activation, replace its empirical rank u by the cumulative interval map induced by the Type-III derangetropy kernel, optionally followed by Gaussian or affine output calibration. The transform is invariant to strictly increasing reparameterizations of the feature and contracts the marginal toward central ranks, potentially reducing sensitivity to heavy tails and outliers.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize the hidden-state trajectory of a sequence model so that the distance between states at positions i and j follows a controlled power-law profile in |i-j|. This explicitly prevents representation collapse over long contexts while avoiding the requirement that all distant states be maximally separated. Use alpha as a tunable geometry parameter and compare alpha against the effective hidden dimension using the paper's Euclidean realizability threshold.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Replace a single recurrent transition with K mode-specific neural transitions and train them using mode-aware normalization derived from the effective sample size T p_i. The model explicitly preserves the distinction between frequent and rare dynamical regimes, preventing frequent modes from dominating the shared training objective while avoiding unstable updates for poorly observed experts.
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Implement \(\log(1+u)\) through the bounded residual \(\rho(u)\), refining the argument by repeated square roots and propagating the residual backward with a rational recurrence. Use this table-free approximation in softplus and log-sum-exp kernels, where millions of logarithms are evaluated and predictable arithmetic can outperform general-purpose library calls on vectorized hardware.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Treat each recurrent update or inference block as a time-dependent map F_n and regularize it toward a limiting autonomous map F whose long-horizon dynamics are easier to analyze. In addition to penalizing one-step map differences, impose a quotient-consistency loss so that pairs of hidden states that are asymptotically indistinguishable under F remain indistinguishable under every time-dependent generator F_n.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace ordinary projected-gradient updates for a convex neural subproblem with a homogeneous perspective formulation and Douglas-Rachford splitting. The additional scale variable makes the update less sensitive to large variations in loss or parameter scale and can expose infeasible combinations of constraints instead of producing unstable iterates.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained residual block by a four-field feature dynamics containing a primary feature T, flux-like auxiliary features J, curl-cleaning features psi, and a scalar cleaning feature phi. Couple these fields with learned skew-adjoint spatial operators so that the reversible block preserves the squared feature norm, while a separately controlled relaxation term can remove high-frequency or constraint-violating components. Use an exact Cayley update rather than explicit Euler to…
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use the paper's effective operator 𝒢 = (I + K⁻¹L)⁻¹ as a learned, geometry-aware preconditioner for momentum or latent-state updates. The coupling matrix L changes the response of momentum variables without changing coordinate components, providing a controlled mechanism for mixing fast and slow latent channels.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the paper's three rank-two graph families as a small, analytically understood library of propagation topologies. Select or mix figure-eight, theta, and dumbbell edge-routing motifs to obtain different effective receptive-field growth rates while retaining an exact spectral-radius target for normalization and architecture search.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a neural stochastic layer in which each particle's drift and diffusion are selected from a convex set depending on the current particle distribution. Instead of committing to one learned vector field, the layer chooses a task-useful admissible coefficient using differentiable simplex weights, providing controlled stochastic diversity and distribution-aware dynamics.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace part of a sequence or spatiotemporal model's unconstrained recurrence with a bank of stable second-order filters whose poles are a frequency-shifted precession pole and a diffusion pole. The chemical-potential parameter produces oscillatory memory, while the diffusion parameter produces scale-dependent decay; a learned residual branch preserves expressivity when the prior is imperfect.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an eigendecomposition-based spectral controller in a small recurrent or state-space transition layer with explicit polynomial projectors. Each hidden state is split into invariant modes, and each mode receives a separately constrained recurrent multiplier, enabling direct suppression of unstable modes or selective retention of long-memory modes using only matrix-polynomial evaluations.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use local split-fusion rewrites as a structured alternative to globally recomputing token clusters. A model proposes a small number of neighboring tree edits per input, accepts only valid edits that reduce a learned energy, and retains the previous hierarchy across layers or decoding steps.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Introduce an auxiliary matrix-valued optimizer state whose update is a Lie–Poisson flow discretized by similarity transforms rather than additive Euler steps. Because similarity transforms preserve $\operatorname{tr}(Z^k)$ and the full eigenvalue multiset, long training runs avoid spectral drift in the optimizer state; the state can then generate a preconditioned update for ordinary neural-network parameters.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a Fourier-domain anti-concentration penalty to normalized embeddings or latent codes. For random one-dimensional projections, penalize empirical characteristic functions that exceed a power-law envelope whose exponent is determined by the estimated effective fractal dimension, discouraging collapsed, lattice-like, or overly periodic representations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Train a neural scalar field with a singular energy that becomes infinite as the input gradient approaches a prescribed threshold, then increase the barrier strength through a monotonic continuation schedule. Unlike ordinary squared gradient penalties, the barrier strongly prevents late-training boundary violations and targets a strict margin rather than merely minimizing average gradient magnitude.
Useful5/10
Difficulty4/10
Novelty4/10
Unverified
2026
Replace an unconstrained simplex router or differentiable mixture layer with a resource-cost-aware router whose learned costs satisfy the paper's monotonicity curvature condition. Use a Euclidean-regularized Frank–Wolfe oracle to update routing probabilities, which should reduce cycling and sensitivity when several examples or agents compete for the same experts.
Useful5/10
Difficulty5/10
Novelty5/10