Unverified
2026
Replace fixed-budget token or patch pruning with greedy selection that combines a teacher-derived relevance score and Gaussian-process mutual information. Select an item when it is both relevant and non-redundant, and stop when the largest remaining information gain falls below a calibrated threshold instead of retaining a fixed number of items.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Augment SGD or Adam with a short-window estimate of optimizer trajectory entropy production obtained from forward and reverse minibatch or noise paths. Reduce the learning rate when estimated dissipation rises sharply, and increase it only when dissipation remains controlled, avoiding the rare-event sensitivity of exponential work estimators.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace online enumeration over a finite action set with a classifier or lookup map whose regions directly return the action minimizing a one-step predictive-control cost. For affine dynamics and quadratic tracking loss, exact action regions are separated by pairwise cost boundaries, so the approximation can be audited against exhaustive predictive control rather than treated as an unconstrained policy.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a uniformly time-stepped neural ODE or state-space layer with a finite set of neural dynamical modes and an event scheduler. The hidden state follows the smooth flow of the current mode until a learned guard function crosses zero, at which point the solver evaluates the state at the event, switches mode, and continues with the new dynamics; this avoids numerical smearing of hard routing, thresholding, and switching behavior.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace projected or retracted updates for constrained spherical parameter blocks with a geodesic Frank–Wolfe update and an iteration-only step size \(\eta_k=a/(k+a)\). The method moves along a minimizing geodesic toward a feasible linear-oracle point, avoiding repeated projection and eliminating line-search or gap-feedback overhead. On locally error-bounded objectives, the paper predicts accelerated polynomial convergence, including \(O(k^{-2})\) for strongly geodesically convex objectives…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Approximate an expensive neural objective as a local second-order Hermite polynomial over a symmetric action stencil, then optimize the fitted polynomial rather than repeatedly evaluating the original objective. Unlike a Taylor model, the coefficients are obtained from function values and do not require reliable action derivatives through a simulator or learned environment.
Useful6/10
Difficulty5/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
Before or during graph-neural-network inference, use a tree dynamic program to choose a limited set of active computation nodes and upgraded message-passing edges. A node receives an embedding from an active landmark only when the selected path has enough residual communication radius, so the planner directly optimizes weighted coverage under a joint node-and-edge budget. The resulting active subgraph is then used by a sparse GNN or graph transformer.
Useful6/10
Difficulty5/10
Novelty7/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 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
Approximate a dense symmetric interaction matrix in a neural layer by \(\widehat A=C\widehat M C^{\top}\), but compute the small core \(\widehat M\) from a two-sided sketched least-squares fit rather than from the landmark principal submatrix. This preserves signed or indefinite directions and avoids exploding outputs caused by an almost-singular \(A(I,I)\).
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
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
Construct a sparse attention variant whose positional interaction kernel is piecewise polynomial rather than an arbitrary softmax score. Store key-value content in exact monomial moments within a spatial or learned-coordinate box hierarchy, then evaluate all queries from those moments without materializing the query-by-key matrix.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use paired recurrent channels with exactly reciprocal gains while applying a common phase rotation. One channel carries a controlled expanding mode and the other a matching contracting mode, creating a tunable hyperbolic memory spectrum without the optimization fragility of an unconstrained recurrent matrix.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace repeated substrings in long sequences with nonterminal symbols from an acyclic straight-line grammar, then run the transformer on the compressed sequence. Unlike ordinary fixed tokenization, the compression objective explicitly minimizes the number of reusable binary productions, allowing repeated document-specific or corpus-level motifs to become single units. An expansion map lets the model recover token-level outputs for selected positions.
Useful6/10
Difficulty6/10
Novelty6/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
When a recurrent or graph coupling matrix is approximately rank one, replace expensive full spectral monitoring with a scalar small-gain controller. Adapt a residual mixing coefficient so that the dominant coupled mode remains below a prescribed contraction threshold.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a sparse fixed orthogonal mixer by repeatedly applying pi/4 rotations to randomly matched pairs of feature coordinates. Place this mixer before top-k feature pruning, sparse projection, or activation quantization so that information is spread across coordinates without using a dense random matrix.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a trainable shallow hidden layer by a deterministic feature dictionary generated from Chebyshev-spaced scalar parameters and quasi-uniform ridge directions. Train only the output linear map, or use the frozen layer as the first stage of a larger network, thereby eliminating hidden-layer backpropagation while retaining a constructive smooth-function approximation guarantee.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Use the weighted feature Gramian to remove nearly dependent Fourier, sinusoidal, or dictionary features during training instead of relying only on magnitude pruning. The criterion detects redundant directions even when their learned coefficients are individually large, improving conditioning of the linear readout and reducing inference cost.
Useful6/10
Difficulty4/10
Novelty5/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
Unverified
2026
Replace dense token-to-token attention in a controlled ablation with a cyclic order-a recurrence whose coefficients are periodic across positions. The resulting mixer has linear cost in sequence length for fixed recurrence order and can enforce a fixed signed periodic boundary condition, providing a compact structured alternative to local attention or a lightweight state-space model.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a naively evaluated mixture of power-law experts with a Newton-envelope layer that computes all monomial magnitudes in log-space and subtracts their maximum before exponentiation. The layer exposes both a stabilized mixture value and soft dominance weights, allowing a downstream MLP to adapt to whichever scaling regime is active without overflow or hand-designed regime splits.
Useful6/10
Difficulty4/10
Novelty7/10