Unverified
2026
Coarse-grain the training trajectory into a one-dimensional field over depth or parameter blocks, such as normalized gradient energy per layer, and model its redistribution as a fluctuating diffusive current. Compute the macroscopic fluctuation action over a sliding time window; use unusually large action as an early-warning signal for nonstationary gradient bursts and reduce the learning rate before divergence. The controller explicitly distinguishes flat layer profiles from step-like…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Evaluate a temporal neural predictor by freezing its prediction before a later exogenous randomisation, then test whether the endpoint residual is systematically ordered by that randomised variable. Under a valid past-only information set, the randomised variable must be conditionally irrelevant to the already committed prediction error; significant ordering indicates leakage, selection bias, or an invalid sufficiency claim.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the paper's explicit pixel-spacing error bound to make radial topological features and losses resolution-aware. Treat intervals whose endpoint changes are below the discretization tolerance as unreliable, and use the bound to select contour resolution or a persistence threshold instead of tuning these quantities arbitrarily. This can improve robustness to rasterization, small contour perturbations, and multi-resolution training.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace an unconstrained spatial aggregation in a neural PDE surrogate or controlled-dynamics model with a fixed-branch expectation layer. Each output is a maximum over controls of a nonnegative weighted average of next-state values, with reflected overshoots attenuated by Robin factors. Increasing any input value therefore cannot decrease the output, giving a hard monotonicity and positivity property instead of relying on a penalty.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Make Laplacian latency attention hardware-friendly by quantizing the exponential decay and row normalization to powers of two. Exponentials and divisions can then be implemented with lookup tables and integer shifts, enabling a low-bit attention kernel for neuromorphic and edge accelerators.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a random cyclic filter bank or patch projection with the Weyl–Heisenberg orbit of one normalized learnable prototype. Regularize the prototype so that all nonzero shift and modulation correlations have a large and nearly equal magnitude, maximizing the smallest eigenvalue of the induced feature Gram matrix and preventing poorly observed feature directions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the paper's explicit approximation bound to select the output-head regularization strength as a function of measurement resolution. Rather than applying fixed weight decay across meshes, increase or decrease regularization so that discretization error and shrinkage error remain balanced.
Useful6/10
Difficulty3/10
Novelty6/10
Unverified
2026
Treat a minibatch of nonnegative neural features as a smoothed density f in an embedding space and compute its Riesz potential E_alpha f. Add a hinge penalty whenever the observed potential norm falls below the reverse-HLS lower bound determined by the batch mass and its L^q quasi-norm. This directly discourages feature collapse while preserving the theorem's scale-sensitive interpolation structure.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a projective normalization and spectral monitor into a recurrent or deep residual dynamical block. If the effective linearized map has one real eigenvalue whose modulus dominates all others, the block is predicted to collapse features toward one direction; constrain the spectral ratio or preserve a controlled two-dimensional rotational mode to maintain representational rank.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the fixed number of Sinkhorn iterations used to normalize an attention kernel with a per-example stopping rule based on the local spectral contraction factor. Estimate the remaining marginal error geometrically and stop early on easy examples while retaining extra iterations on difficult or nearly disconnected examples.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Generate relational training examples by first coupling two graphs or kernels and then interpolating every matched pair of node or edge attributes along a geodesic in Z. Unlike ordinary mixup, this preserves the intrinsic Gromov-Wasserstein correspondence and produces constant-speed paths in the relational metric when Z is geodesic.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a fixed spherical t-design as the direction codebook for a directional attention or feature-aggregation module instead of independently sampled random directions. Equal weights provide exact zero mean and isotropic second moments, while exactness for spherical polynomials up to degree t reduces directional aliasing and seed-dependent anisotropy.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Approximate a long hidden-state or key/value trajectory by a small sum of exponential modes, storing only the mode nodes and vector weights instead of every timestep. Recover the modes from a Hankel matrix through an annihilating polynomial, then reconstruct the trajectory or a compact recurrent state during inference.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use a low-dimensional polynomial model of local training dynamics to detect when the leading nonlinear restoring behavior becomes degenerate. Shrink the optimizer step in that region, or fit higher-order terms before restoring it, because the paper shows that quartic nondegeneracy determines whether local nonlinear stability can be certified and that sixth-order terms resolve inconclusive cases.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Apply a Birkhoff-normal-form-inspired monitor to momentum optimization and recurrent-state updates, where oscillatory modes are identified from recent parameter or hidden-state trajectories. When two dominant frequencies approach a low-order ratio such as 2:1 or 3:1, increase damping before nonlinear mode coupling produces large oscillations; away from resonance, retain the faster low-damping update.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a cheap directional curvature-defect estimator to an SGD or AdamW optimizer and shrink the step size only when the local gradient field loses the nominal contraction margin. Unlike a Hessian-norm trust-region rule, this directly measures the quantity that appears as additive instability in the Euler coupling estimate.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Give a token, patch, retrieval-item, or expert-selection module a learned utility f_theta(S) over subsets S, and penalize violations of the paper's submodularity and strong-submodularity inequalities. The resulting selector should prefer complementary elements: the marginal value of adding an item decreases when the current selected set is already rich in similar information. At inference, use greedy marginal-gain selection rather than independently thresholding token scores.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a PEP-generated quadratic Lyapunov function as a runtime monitor for minimax training. When the measured Lyapunov decrease becomes positive, reduce the learning rate or reset optimizer memory; when the decrease is safely negative, retain or cautiously increase the step size.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained momentum update by a bounded-acceleration, four-arc bang-bang maneuver in an augmented state containing parameter position, velocity, and an oscillator coordinate. Each micro-maneuver targets a gradient-derived displacement while ending with zero velocity and zero oscillator amplitude, so flexible or momentum-like modes do not carry ringing into the next update.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an ordinary hierarchical graph encoder with a finite chain-complex encoder whose learned boundary maps satisfy \(\partial_{k-1}\partial_k=0\). Compute Smith normal form on the integer incidence matrices and treat unit-labelled cell pairs as refinement overhead: cancel or gate those pairs before message passing, while preserving non-unit labels that encode genuinely nontrivial structure. The resulting representation should be insensitive to arbitrary cell subdivision while retaining…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace the usual top-eigenvector positional encoding in a graph neural network with a density-selected spectral subspace. The selector explicitly searches below the leading eigenvectors, where community information may survive after latent geometric modes have consumed the largest eigenvalues. The selected coordinates can be concatenated to node features or used as a bias in graph attention.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Track where the loss Hessian's eigenvectors are most sensitive to the current minibatch perturbation, rather than using only eigenvalues or a global learning-rate estimate. Apply extra damping only to spectral bands with high geometric response, allowing flat and well-separated curvature modes to retain a larger step size.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Use the conditioning of a learned symmetry-commutant manifold as a training-time detector for frozen or weakly reachable hidden-state regions. When replica observables become nearly linearly dependent, the commutant Gram matrix becomes ill-conditioned; reduce injected noise and learning rate there, or perturb only directions with measurable response. The mechanism predicts a transition in relaxation curves at a conditioning threshold rather than relying only on validation loss.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained recurrent residual update with a sparse coordinated state-space block whose gains and state radii are synthesized jointly by a linear program. The block receives bounded feature disturbances, keeps every hidden coordinate inside a certified interval for all time, and uses an affine feedforward correction to reduce the output sensitivity of downstream coordinates.
Useful6/10
Difficulty5/10
Novelty7/10