Unverified
2026
Use Fisher width as a branch coordinate in addition to training loss. During a short reference run with SGD, fit the expected Fisher-width curve as a function of loss, then add a soft penalty to Adam or another optimizer when its width at the same loss deviates from that reference branch. This directly tests whether optimizer-induced geometric displacement is responsible for differences in training dynamics or generalization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a normalized neural quantum state with a natural-gradient preconditioner computed from the Fisher geometry of its labeled Pauli spectrum. Instead of estimating the usual wavefunction quantum Fisher matrix from state derivatives and overlap covariances, estimate Pauli expectations, differentiate their squared values, and use one half of the resulting classical Fisher matrix as the metric.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Model dynamic routing as a multitype branching process: an active token of type d probabilistically creates child activations of type d'. Estimate the corresponding mean offspring operator and regulate its Perron root to a target reproduction rate, typically near one. This should make adaptive-depth or recursively routed networks use sparse computation without producing either rapidly vanishing paths or uncontrolled activation explosions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Split a neural controller into a slow model-based planner and a fast policy instead of requiring either component to perform the entire control task. The MPC output provides a slowly varying nominal action or operating envelope, while the neural policy generates high-frequency residual corrections. This should preserve constraint handling while reducing the frequency of expensive online optimization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace unrestricted global attention or purely local convolution by a sparse distance-dependent interaction graph on a two-dimensional feature map. The edge probability or attention prior decays as \(r^{-(2+\sigma)}\), and \(\sigma\) becomes an explicit architectural control knob: small \(\sigma\) supplies mean-field-like global mixing, intermediate \(\sigma\) supplies long-range Wilson–Fisher behavior, and \(\sigma>2\) approaches a short-range model. The architecture should be evaluated not…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the single backpropagated subgradient of a piecewise-smooth network loss by a minimum-norm convex combination of gradients evaluated at nearby parameter perturbations. Shrink the perturbation radius geometrically and restart the schedule when the sampled Goldstein direction becomes small, following the paper's INGD motivation.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use a learned dividing surface between two modes or basins of a neural energy model, and regulate Langevin or diffusion noise using the measured one-way crossing flux. The surface should be aligned with an estimated saddle direction and should reject immediate recrossings, so the controller responds to genuine mode transitions rather than local oscillations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train an energy-based or probabilistic classifier with inverse temperature \(\beta\) matched to the precision \(\Delta\) of injected observation or label noise, following the exact higher Nishimori condition \(\beta=\Delta\). Use two independently sampled network replicas to measure an Edwards-Anderson-style parameter and detect whether training is entering a paramagnetic, ordered, or replica-disagreement regime rather than tuning regularization only by validation loss.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add two scalar adaptive gains to a neural controller or learned dynamical model: one estimates the unknown norm of the ideal neural approximation weights, and the other estimates the combined approximation, friction, and disturbance envelope. Sigma modification prevents unbounded gain growth, while the robust residual correction uses only these scalar estimates, independent of the number of neural features.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a small controller to choose the next integration step size in a learned dynamical model using only deviations of conserved or slowly varying quantities. Unlike standard local adaptive solvers, optimize the complete rollout objective, allowing a later coarse step to compensate for an earlier discretization error. The controller can reduce the number of model evaluations while preserving long-horizon behavior.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Convert a neural operator block into a shared-weight iterative fixed-point refinement scheme that exploits repeated smoothing while avoiding repeated low-resolution projections. Compute all refinement steps at an overresolved latent bandwidth and apply the target-bandwidth projection only at the end, reducing the opportunity for unresolved frequencies to alias into retained channels.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained spatial residual block by a discretized transport evolution whose generator is skew-adjoint. Symmetric channel matrices and divergence-free spatial coefficients make the continuous operator energy-preserving, while a matrix exponential or Cayley transform gives an exactly norm-preserving discrete layer.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the bipartite equation-variable matching to turn a large neural equilibrium system into independently or weakly coupled mechanism blocks before applying Newton updates. Within each matched endogenous cluster, solve the coupled variables jointly; across clusters, apply causal-order updates on the partially oriented graph. This can reduce the cost and instability of generic dense Jacobian solves in implicit neural networks.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a stable linear latent state-space block whose controllability Gramian is trained toward a chosen positive-definite target using squared Bures–Wasserstein distance. Direction-specific semidefinite constraints can suppress disturbance amplification in nuisance coordinates while preserving controllability in coordinates needed for prediction.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach a low-dimensional reachable-set monitor to an RNN or state-space model and propagate the set of hidden states allowed by bounded inputs, parameter uncertainty, and process noise. Penalize or reset hidden states that leave the predicted tube, turning the paper's instantaneous set-membership fault test into a robust neural-state validity test.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained multiscale residual block by the sum of a fractional diffusion branch and a drift or transport branch whose strength follows the PDE scaling law. At finer spatial scales, the drift coefficient is multiplied by R^{2s-1}; this suppresses unstable transport when s>1/2 while preserving equal-strength diffusion and drift at the critical value s=1/2.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Track the variance of information content in a neural representation or routing distribution and use its interior maximum as a data-driven transition signal. The monitor distinguishes collapse, where nearly all probability occupies one state, from unstructured noise, where all states are equiprobable; both have low complexity, while structured intermediate distributions have high complexity.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a Renyi divergence penalty between the current network output distribution and a frozen reference distribution representing the pretrained model, a teacher, or a retained-data equilibrium. The Renyi order k becomes a control parameter: k greater than 1 strongly penalizes examples on which the new model assigns disproportionately more probability than the reference, while orders below 1 emphasize support mismatch and low-probability regions. Sweep or anneal k and detect a transition between…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Constrain a recurrent latent state to the unit disk and learn an auxiliary Koenigs coordinate in which the recurrent transition is a scalar dilation. The nonlinear transition is trained to satisfy the conjugacy equation, so repeated application has a prescribed asymptotic rate instead of accumulating uncontrolled Jacobian errors.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a Jacobian cone-field regularizer to recurrent dynamics so that tangent directions expand and remain aligned with an unstable cone outside a designated critical neighborhood. The network is not forced to be uniformly expanding: the regularizer is disabled near the critical set, allowing controlled bifurcation-like behavior while exposing where long-horizon sensitivity changes.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Treat the component of minibatch-gradient noise that is coherent across iterations as an unknown periodic disturbance, estimate its phase and frequency with a latent oscillator, and subtract an anti-phase update from the optimizer step. Unlike fixed momentum or a fixed low-pass filter, the oscillator estimates the disturbance frequency online and therefore does not require prior knowledge of the data period, sequence period, or model-specific time scale.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Treat the router state as a symbolic base process and expert transformations as nonstationary expanding fiber maps. Add a relative entropy/free-energy constraint so that the router's conditional entropy is calibrated against the empirically measured growth rate of distinguishable expert trajectories, preventing premature expert collapse while retaining useful specialization.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a stochastic pairwise regularizer that penalizes only coordinate pairs whose normalized neural-field difference exceeds a threshold. Unlike a conventional fractional Sobolev penalty, the weak-type functional uses an indicator and a distance weight, and its Gamma-limit guarantees convergence toward a local gradient energy as the threshold grows.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use active-basis changes as a cheap, solver-derived indicator that a policy update has crossed a nonsmooth decision boundary. Adapt the neural optimizer’s step size and gradient confidence using the fraction of trajectory decisions whose bases disagree between the current and proposed policy, preserving large steps in locally affine regions and damping updates near combinatorial switches.
Useful6/10
Difficulty4/10
Novelty7/10