Unverified
2026
Train multiple neural-network parameter particles with a deterministic Stein interaction plus Langevin noise instead of using independent SGD or SGLD chains. The Stein term repels nearby particles while moving the ensemble toward high target probability, and the Langevin term supplies diffusion that improves exploration and prevents particle collapse.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Represent a block of candidate neural updates or adapter components by symmetric influence matrices and select one sign for each component so their aggregate spectral effect is small. This imports matrix discrepancy into low-rank adapters, expert aggregation, or structured quantization, where controlling the worst direction of interference may be more useful than minimizing entrywise error.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an ordinary group-L1 penalty on structured neural components with a powered ratio-of-norms penalty applied to their nonnegative importance magnitudes. The ratio encourages importance to concentrate on a small number of heads, channels, or experts while being less sensitive to arbitrary rescaling of the underlying weights. After training, components with small importance can be physically removed and the model can be fine-tuned.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Parameterize a complex linear layer as a product of sparse triangular network factors whose positive modulus version is totally nonnegative. The layer can use phase cancellation for expressive transformations, while selected minors remain bounded by explicitly computable positive minors, giving a structured alternative to unconstrained dense complex weights.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a Maximum Entropy on the Mean penalty to an inverse-model output or neural latent code using an empirical prior library of plausible vectors. The penalty selects the least-KL distribution over prior samples whose mean equals the network prediction, encouraging reconstructions to lie in statistically plausible regions without requiring a differentiable density estimator.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's MBM-GP construction to predict input-dependent big-M constants for ReLU disjunctions during neural-network verification. Exact activation-bound optimization is performed only at a small subset of input points, while a Gaussian-process upper confidence bound supplies conservative bounds elsewhere, reducing verifier preprocessing and potentially tightening the MILP compared with one global worst-case constant.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace constant friction and optimizer noise with a velocity-dependent friction gamma(u) and noise amplitude tied by a fluctuation-dissipation relation. High-speed momentum states can be damped and randomized differently from low-speed states, creating controlled transient exploration while preserving a known equilibrium momentum distribution.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a local Jacobian spectral regularizer and an initialization sweep to steer a looped transformer away from uncontrolled near-unit dynamics. The goal is to prevent examples from entering a fold-critical regime with very long relaxation times, or alternatively to deliberately target a controlled critical regime when adaptive test-time compute is useful.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Treat a slowly varying block of neural-network parameters as a coarse-grained stochastic process and continuously estimate both its covariance spectrum and its linear response to small artificial perturbations. Use the fluctuation–response mismatch as a feedback signal to tune injected parameter noise or minibatch size; the thermal Einstein relation is imposed only when a calibrated equilibrium-like regime is desired, while antisymmetric response components are retained as admissible…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the usual momentum state in an optimizer with a persistent Ornstein-Uhlenbeck-driven velocity subject to a dry-friction threshold. Correlated forcing can help traverse shallow noisy regions, while the friction term suppresses parameter motion when the effective force is small, potentially reducing update noise and improving late-stage stability.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Model the integer token loads of a mixture-of-experts layer as a canonical occupancy system with a fixed total number of tokens. A distributed routing phase persists while the normalized load is below a critical value; beyond that point, the excess load is either allowed to condense into a designated overflow expert or penalized if expert collapse is undesirable. The key benefit is an explicit transition criterion and finite-batch fluctuation diagnostic for routing collapse.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat groups of neural-network states or experts as metastable sectors and estimate both sector imbalance and inter-sector connectivity from minibatch routing or trajectory transitions. At balanced sector usage, the effective two-sector spectral splitting becomes a direct estimate of connectivity: a large splitting indicates that the sectors are still strongly communicating, whereas a small splitting indicates genuine specialization or incipient collapse into disconnected modes.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a temperature-response constraint to stochastic neural predictors so that changes in inverse temperature cannot produce disproportionately large changes in expected loss or energy. This converts the nonequilibrium fluctuation-response inequality into a measurable robustness monitor and a regularizer for beta-conditioned stochastic representations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
For a learned control-affine latent dynamics model, replace the ordinary reciprocal barrier 1/h₀(z) with B(z) = s(z)/h₀(z), where h₀ is the physical safety margin and s is positive but depends on a velocity-like quantity whose derivative is directly affected by the action. This preserves the singularity at h₀ = 0 while giving the policy or safety projection layer first-order action authority over the barrier derivative.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a persistent two-state force to a locally stable optimizer while retaining Gaussian minibatch or Langevin noise. In a locally quadratic basin, the parameter-error distribution should be the convolution of a compact-support run-and-tumble stationary law and an Ornstein-Uhlenbeck Gaussian. This supplies an explicit persistence and noise calibration rule instead of treating all optimizer noise as white and Gaussian.
Useful6/10
Difficulty5/10
Novelty7/10
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
Use a pseudorandom sparse interaction graph as the measurement pattern for latent node coordinates. Add a loss on edgewise latent distances and train on an automatically selected large induced subset, so that coordinates are constrained by many distributed measurements rather than local neighborhoods alone. The target is to eliminate non-global geometric ambiguities and reduce drift in geometric GNN or transformer representations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a cone-aware score to a latent representation by projecting each latent vector onto a closed convex cone K and using the norm of the projection as an order-sensitive energy. If K is subdual, any latent displacement in the cone order is guaranteed not to reduce this energy, providing a mathematically certified monotone feature rather than merely penalizing observed violations.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Represent each token value in an attention head as a bounded three-dimensional Lie-algebra vector and impose a weighted polygon-closure condition on the aggregate value vectors. The module is invariant to a common \(SU(2)\simeq SO(3)\) rotation of all token vectors, preventing the head from spending capacity on an arbitrary global orientation. A soft closure penalty gives a drop-in experiment, while projection onto the zero-sum manifold provides a harder constrained variant.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Train a graph neural network with a learnable fractional graph mask constrained toward the tree-double-matching polytope. This gives the model a global connectivity constraint while penalizing attention patterns that concentrate too many incident edges on individual vertices.
Useful6/10
Difficulty5/10
Novelty6/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
Augment a neural field or neural operator with a bank of localized, divergence-free moving packets whose radius and amplitude follow the Hill scaling rather than ordinary Gaussian scaling. The packet coefficients can represent unresolved flow corrections while keeping their L^2 contribution approximately invariant under refinement, preventing fine-scale features from becoming numerically negligible or explosively large.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an MoE router's single softmax distribution with a normalized coordinate-wise product of several simplex-valued routing factors. The product preserves positivity and normalization but, as depth grows, concentrates mass on a small subset of experts, creating a mathematically controlled heavy-tailed routing prior rather than relying only on an auxiliary load-balancing loss.
Useful6/10
Difficulty5/10
Novelty7/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