✗ Failed on benchmark
2026
Use a smoothed Burg entropy as the mirror map in a proximal-gradient optimizer for positive or simplex-valued neural parameters. The optimizer performs a Bregman-proximal step instead of an additive Euclidean update, while the smoothing parameter avoids the singularity of ordinary Burg entropy at zero.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the sign-flip-only dynamics of high-index saddle search with low-rank inverse-curvature scaling on the estimated negative-curvature subspace. Directions with small negative Hessian eigenvalues then receive approximately curvature-independent updates instead of extremely slow updates proportional to their tiny curvature.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Prune hidden units only after testing whether their nonlinear gate is task-visible and downstream-used. For ReLU, a unit is removable when its preactivation does not cross zero on the task patch or its outgoing weight column is zero; this is a more structural criterion than weight magnitude and can be applied during width search or post-training compression.
Useful6/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Construct a sparse token-interaction graph from attention affinities and recursively split it by removing the closed neighborhoods of a small set of separator tokens. Separator tokens retain global communication, while the resulting anti-adjacent components perform local attention independently, reducing quadratic attention and KV-cache costs. The induced Erdos-Pósa theorem supplies a structural diagnostic: graphs with few anti-adjacent long-cycle or theta packings should admit small…
Useful6/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Use the paper's negative-semidefinite interaction curvature to detect and compensate for destructive coupling among layerwise learning-rate, momentum, or preconditioner mechanisms. Instead of independently tuning mechanism amplitudes, estimate their reduced curvature after hidden optimizer states relax, then apply a low-rank trust-region step or freeze mechanisms whose interaction curvature is too negative.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Enumerate structured pruning masks only up to exact permutations of exchangeable channels, hidden units, or experts. Replace exhaustive mask search with canonical augmentation: retain a subset only when it is lexicographically smallest among all masks obtained by the model's symmetry group, while recursively generating only canonical predecessors.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Insert an active-set reduction step into a binary energy layer or Hopfield-style discrete optimizer. Coordinates whose signs are stable and whose local fields have a rigorous margin are frozen, while their interactions are folded into an induced bias and only the unresolved tail is updated. This preserves the exact conditional quadratic objective and can reduce dense interaction cost substantially when the state becomes polarized.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace repeated full-curvature factorizations when evaluating many Bayesian neural-network hyperparameter settings with one shared low-rank approximation of the data-induced precision update. Reuse the same curvature subspace while changing prior precision, observation-noise precision, or layerwise regularization, evaluating each candidate through a small rank-r matrix and Woodbury solves.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Treat a coupled neural training loop as a delayed feedback system with two hard delays and two first-order implementation filters. Estimate the dominant coupled Jacobian mode and use the characteristic equation to distinguish a recoverable delay-induced oscillation from a filter-induced instability; then reduce stale-gradient delay only in the former case, and slow or retune EMA or relaxation filters in the latter.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10