Unverified
2026
Extend regularized extragradient with proximal operators so nonsmooth penalties such as group sparsity, nuclear norms, or parameter constraints are applied at both prediction and correction stages. This can produce sparse or low-rank adapters while retaining the look-ahead stabilization for the smooth inner residual.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a decaying Tikhonov term to make inner training dynamics select a stable outer-preferred solution, and evaluate the regularized operator at a look-ahead point before updating parameters. This is intended for convex heads, adapters, equilibrium layers, or locally monotone inner objectives rather than unrestricted nonconvex end-to-end training.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independently normalized attention or routing weights with an entropic doubly stochastic transport plan, while choosing its regularization ε using the paper's explicit statistical-stability bound. Increase ε when residual inversion or minibatch fluctuations are amplified, and decrease it only when the estimated bound permits sharper assignments.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an Erlang delay or exponential smoothing cascade in a recurrent or state-space layer by a positive rational kernel of the form \(\kappa(u)=C e^{-a u}p(u)^2\). Choose the degree-\(m\) polynomial by deleting the adjacent pair of Laguerre zeros with smallest relative gap from \(L_{m+2}\), then rescale the resulting density to unit mean. This preserves a nonnegative impulse response while reducing temporal jitter relative to Erlang filters.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a recurrent or state-space network with time-dependent transition parameters, but train it to forget perturbations at a common exponential rate across all admissible parameter schedules. The model should retain task-relevant long-term signals while suppressing dependence on arbitrary initial hidden states, reducing instability under changing inputs, curricula, or deployment-time dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a deliberately nonconservative, antisymmetric parameter-space force to ordinary gradient descent, with its amplitude controlled by an empirically estimated stability margin. The force should move parameters around elongated loss valleys instead of repeatedly descending and stopping along the same local gradient direction, while damping preserves convergence. The method directly tests whether nonzero circulation can improve traversal of flat or ill-conditioned regions without destabilizing…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace the assumption that strong convexity keeps optimization inside a valid parameter chart with an explicit viability condition on the chart boundary. For Lie-group neural-network parameters or bounded latent coordinates, modify each update so its velocity has nonpositive outward radial component, using either a radial barrier or projection onto the tangent cone.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace the linear phase progression in a positional encoding or rotary attention mechanism with a deterministic quadratic phase. The resulting position signal is generated by an irrational rotation with linearly changing increments, and the paper proves that its infinite diffraction measure is purely absolutely continuous, suggesting disorder-like spectral coverage without random sampling.
Useful6/10
Difficulty4/10
Novelty6/10
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
Construct a weighted training subset of size d+k for a linear prediction head by whitening per-example gradients, identifying approximately orthogonal gradient blocks, and allocating selected examples according to the paper's balanced-partition risk law. Train the head, or a local linearized model, using this subset and its nonnegative weights. The main falsifiable claim is improved full-dataset risk at very small budgets, especially when the subset size is only slightly larger than the…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense directional feature map with a finite stable-zonotope layer: a small set of large random vectors creates a hyperplane arrangement over the input sphere, while a cheaper small-jump residual gives continuous features inside each cell. The layer exposes an explicit compute-versus-resolution knob through the jump cutoff and can be used either as an embedding before an MLP or as a lightweight router for mixture-of-experts blocks.
Useful6/10
Difficulty5/10
Novelty7/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
Replace a sparse graph layer's separate edge transformations with one joint low-rank factorization of all transformations entering each target node. For target node i, concatenate the neighbor matrices horizontally, project all neighbor features into a shared low-dimensional receiving basis, and reconstruct one output; retain the self transformation exactly. This can reduce edge-parameter storage and message-passing FLOPs when the incoming block row has rapidly decaying singular values.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a fixed learned energy or score network but search over inference protocols with different mobility, temperature, and duration. Select the shortest protocol that reaches a target accuracy without exceeding a prescribed entropy-production budget, exploiting the paper's observation that computational accuracy does not uniquely determine the thermodynamic path.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace ordinary token pooling or attention aggregation in a hyperbolic representation space with the point satisfying a bounded radial equilibrium law. Each token contributes a unit tangent direction multiplied by \(\tanh\) of its hyperbolic distance from the candidate, so distant outliers cannot dominate the pooled representation while nearby, geometrically consistent tokens still determine it.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use coordinate hit-and-run rather than isotropic Gaussian random walks to generate latent negatives or augmentation trajectories inside a convex latent domain K. At each step, select one coordinate and resample the entire feasible chord along that coordinate; the paper's l0-isoperimetric theorem predicts that sets of non-negligible mass cannot be separated by severe coordinate-only bottlenecks when K is well-conditioned relative to an unconditional body Q.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Partition neural modules into two empirically identified reliability or noise classes and restrict their communication graph to a two-block stochastic block model. Allocate a fixed connectivity budget across within-class and cross-class edges using a water-filling update that favors block pairs producing the largest increase in validation utility. The resulting layer is sparse and modular, with a testable prediction that optimal connectivity concentrates on a few block pairs rather than…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace fixed LoRA factors with a rank-adaptive moving subspace whose columns are augmented using derivative information from several Runge–Kutta stages. The optimizer integrates a matrix-valued gradient-flow approximation inside this enlarged left/right basis, allowing high-order motion of the adapter subspace while retaining a low-rank parameterization.
Useful6/10
Difficulty6/10
Novelty6/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
Partition trainable parameter blocks into specialists that receive a fixed task or data-domain assignment and generalists that stochastically sample tasks at every update. Estimate local ruggedness from the correlation between losses at nearby parameter perturbations, then increase the generalist fraction when this correlation is low and increase specialization when the landscape is smooth. The mechanism mirrors the paper's permanent-specialist versus stochastic-generalist allocation while…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace random node or token subsampling by a subset selected to preserve the averages of low-frequency graph signals exactly or approximately. Build a graph over nodes or tokens, compute its Laplacian eigenspace, and choose a fixed-cardinality subset whose eigenvector moments match those of the full graph; use the retained subset for graph pooling or downstream attention.
Useful6/10
Difficulty5/10
Novelty7/10