Unverified
2026
Build a neural sampler whose deterministic probability-flow dynamics implement the nonlinear Fokker–Planck equation rather than the usual linear Langevin flow. For a selected monotone diffusion law \(P\), use the associated entropy derivative \(\phi'(r)=P'(r)/r\) to define the chemical potential and train a neural velocity field to approximate its descent direction.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Build a differentiable assignment layer whose rows represent tokens and whose columns represent experts, memory slots, or attention slots. Each row has unit probability mass, but no column receives positive mass from two rows; maintaining at least one vacant column makes assignments continuously deformable through elementary vacancy moves instead of abrupt softmax switches.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Construct a filtered cell complex from neural activations or a learned token/feature graph and track its persistence barcode incrementally as model activations change. Replace full persistent-homology recomputation at every checkpoint by maintaining homology bases and applying local transpositions when filtration blocks split or merge; use barcode drift as a training monitor or a weak regularization signal.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Apply the paper's extremal tail bound to independently sampled nonnegative neural-network contributions, such as stochastic-depth branch activations, independently gated expert loads, or separately allocated memory chunks. Penalize the analytic worst-case probability that their sum exceeds a budget, using the fact that the worst admissible distribution is a sparse Bernoulli spike at the threshold.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace the direct nonlinear loss step by a scalar-auxiliary-variable discretization of a gradient flow. The optimizer maintains an auxiliary value representing the square root of the nonlinear energy, so the coupled update has a discrete modified-energy decrease even when the step size is not restricted by the local curvature of the loss.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Initialize and train a linear recurrent or state-space transition using the stochastic Lyapunov operator rather than only constraining the drift matrix to be Hurwitz. Start from a controller that stabilizes the drift-only dynamics, then continuously increase the multiplicative-noise coefficient and update the controller while enforcing a positive-definite Lyapunov certificate. The resulting module should avoid exploding hidden states when process noise depends on the hidden state or input.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Drive the optimizer periodically around a baseline learning rate, but scale the modulation amplitude and period through a single dimensionless control variable rather than tuning them independently. The neural analogue predicts that normalized loss, gradient norm, and parameter-displacement trajectories should approximately collapse across schedules with equal \(aP^{\kappa}\), while sufficiently large values should reveal a measurable transition from weak tracking to strongly oscillatory or…
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Equip a latent transition model with a near-identity polynomial coordinate transform that conjugates the nonlinear transition to a linear latent operator, at least locally around a reference state. Train the transform jointly with the dynamics using both the usual prediction loss and the paper's splitting/intertwining residual, so that multi-step prediction is performed partly in approximately linearised coordinates.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the paper's exponential dressing of an activity coupling as an adaptive gate on a neural network's nonlinear residual branch. The branch is strongly suppressed when the local activation fluctuation variance is high, producing an automatically linearized and more stable update, while low-variance representations preserve the learned nonlinear interaction.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Build a parameter-free spectral channel mixer whose channels are arranged as components of an l-form and whose multiplier is the trace-free Beurling--Ahlfors transform. At every nonzero spatial frequency it mixes the exact and coexact channel subspaces with opposite signs, preventing a uniform channel-direction bias and preserving a structured cancellation property. Insert it as a residual branch before a convolution, MLP, or attention block, with one learned scalar gate controlling its…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace pointwise validation tests or infinite-horizon confidence sequences with a confidence horizon covering exactly the next H validation checks. Use the resulting simultaneous band to stop evaluating or stop training once the probability of further improvement falls below a target threshold, while spending less statistical slack than an anytime-valid method.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Regularize a neural predictor so that its temporal partial averages remain stable when evaluated over shrinking neighborhoods of nearby inputs. The paper's mechanism suggests controlling a temporal maximal envelope in an Orlicz space, rather than controlling only pointwise variance or an L2 norm; the expected threshold is logarithmic, with L log L for ordinary consecutive averages and L log^(q+1) L for q-logarithmically normalized averages.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a positive multiplicative perturbation to the node or token measure of a symmetric neural operator and use the paper's eigenvalue-response matrix to identify nearly degenerate eigenspaces. Train the perturbation or its scale so that repeated eigenvalues split with a controlled minimum gap, making spectral positional encodings and eigenvector-based message passing more stable.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the explicit parameter update \(\theta_{k+1}=\theta_k-\eta\nabla L(\theta_k)\) with an approximate generalized proximal step defined by a simple map \(v\). The map is chosen so that the gradient operator and v satisfy an empirical pair-monotonicity condition, allowing larger stable outer steps and reducing oscillations in stiff or highly curved neural-network training.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent or state-space transition with a complex-orthogonal flow generated by a skew-transpose matrix. The transition preserves a bilinear quadratic quantity exactly, preventing repeated application across long sequences from causing norm explosion or decay in the linear dynamics.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Treat a quantized recurrent network as a finite deterministic state-transition system and distinguish absorption from latent periodic behavior during inference or training. Use the observed extinction threshold to adapt the activation threshold or recurrent gain, stopping once all tested trajectories reach the zero state and increasing the threshold when trajectories enter nontrivial cycles.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace a uniformly discretized recurrent or continuous-depth model with hybrid hidden-state dynamics: integrate a learned drift between event times, then apply a one-sided reflection update at each irregular observation or constraint event. The reflection prevents the hidden state from violating a lower obstacle, while the explicit jump decomposition avoids smearing abrupt information changes across many small residual steps.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Use a tanh MLP with an explicitly tracked Pfaffian-chain complexity and select its width and input sparsity using the paper's zero-count bound. The bound limits the number of regular decision-boundary crossings along one-dimensional data-space restrictions, so it provides a principled way to discourage excessively oscillatory fits beyond ordinary weight decay.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace or augment a singular scalar activation \(\sigma\) with a distributionally regularized activation \(g\) whose Fourier transform is multiplied by \((i\rho)^\alpha\). This suppresses the problematic low-frequency singular component and can produce better-conditioned random-feature or first-layer representations, while a residual raw-activation branch prevents loss of standard approximation behavior.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use differential evolution over adapter or prompt parameters, combining attraction to the current best parameter vector with a population-difference direction. Binomial crossover supplies coordinate-level exploration, while the operator-selection separation makes it possible to measure raw proposal geometry independently from parameter repair and noisy fitness selection.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Build a two-dimensional local metric from the neural-network loss along a pair of controlled parameter directions, such as the optimizer velocity and a stochastic-gradient fluctuation direction. Compute both scalar curvature R and curvature density mathcal R = sqrt(|g|) R, then use their different peaks or scaling laws to detect sharp optimization transitions and trigger learning-rate or regularization changes.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace independent softmax expert choices with a collision-free Markov router whose particles occupy expert positions on a one-dimensional or circular index lattice. A particle can move only to an empty neighboring expert, and the move rate contains a product of sine ratios that globally repels nearby assignments; this should reduce expert collapse and produce more evenly spread routing without requiring a separate pairwise diversity loss.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Build a neural feature-mixing layer from a truncated shift S and a diagonal phase operator T satisfying TS=qST, with |q|=1. The relation forces moving one position in the graded feature basis to multiply the phase operator by q, providing a compact inductive bias for periodic, phase-sensitive, or cyclic data.
Useful5/10
Difficulty4/10
Novelty7/10