Unverified
2026
Build neural computation graphs with explicitly phase-budgeted serial and parallel branches, treating serial compositions as SRG products and parallel residual branches as SRG sums. Allocate phase centers theta_i so that every loop or branch aggregate stays away from -1, enabling stability-aware architecture search and constructive control of branch gains.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Replace an unconstrained q-way polynomial or tensorized feature layer with separate decomposable and primitive interaction channels. The decomposable channel models interactions explainable as products of lower physical-weight feature blocks, while the primitive channel captures residual factors that cannot be represented by those products. This should reduce redundant high-order parameters and provide a controllable inductive bias for compositional or disentangled representations.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a differentiable Fourier-domain layer after a network predicts a symmetric strain field, projecting every frequency onto the subspace satisfying isotropic mechanical equilibrium. The projection is a closed-form least-squares correction, so the network cannot spend capacity representing large equilibrium violations and the resulting field is physically admissible by construction.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the min-plus phase transition as a training-time controller: begin near p = 1/2 to preserve the initial active-state fraction across depth, then move above or below criticality to deliberately remove or create sparse pathways. The controller uses a measurable state variable, the activation zero fraction, rather than an arbitrary regularization coefficient.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Represent a nonnegative neural output as a homogeneous polynomial with coefficients indexed by count vectors, and penalize violations of the Lorentzian Hessian signature after factorial normalization. Add an M-convex support penalty so mass can move between coordinates through valid exchange operations rather than forming disconnected or brittle coefficient patterns.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's separated near-return criterion as a finite-data certificate that a recurrent or latent dynamical model contains positive-complexity behavior rather than merely noisy prediction error. Detect pairs of nearby trajectories that almost return to their starting points but separate at an intermediate time, then either flag the model for long-horizon unreliability or penalize the number and strength of such events. The monitor is suited to learned world models, RNNs, and neural ODEs…
Useful6/10
Difficulty5/10
Novelty6/10
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
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 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
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
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
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
Unverified
2026
Add KL Tikhonov regularization to simplex-valued attention or routing parameters so that the optimizer selects a stable solution close to a chosen reference distribution instead of collapsing onto a few entries. Anneal the regularization strength to obtain exploration early and specialization later.
Useful6/10
Difficulty3/10
Novelty4/10
Unverified
2026
Use the paper's Lp inequality to construct an empirical certificate for a neural network's generalization gap. Estimate cross-example interaction beta with coordinate-replacement probes and estimate the single-example fluctuation M by conditional resampling; use the resulting certificate for checkpoint selection or as a stability-aware hyperparameter objective.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Regularize a recurrent or state-space transition matrix using numerical ranges after bounded-condition-number similarity transforms, rather than only penalizing eigenvalues or the raw spectral norm. The resulting penalty targets nonnormal transient amplification and can certify bounds on powers or other polynomial functions of the transition matrix.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a deterministic latent state with a probability measure over latent states, represented by particles or weighted prototypes. Apply the learned latent transition to every particle, so one base trajectory map induces a dynamics on distributions; use an entropy-preservation or entropy-growth regularizer to prevent collapse of the ensemble. The mechanism predicts that any positive base-state trajectory entropy can generate unbounded distinguishability in the ideal measure space through…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a sequence network with a learned staggered matrix-product-operator symmetry and penalize its commutator with the network map. Unlike ordinary equivariance, the auxiliary operator need not define a self-commuting transfer-matrix family: it can be discovered through cross-commutation with a second alternating operator, while nilpotency supplies a finite hierarchy of symmetry constraints. The model should preserve generalized symmetry sectors and exhibit lower commutator error on…
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Construct a sparse recurrent network with positive edge weights and Leaky-ReLU updates so that one selected hidden node, observed over a finite time window, contains enough information to reconstruct the full hidden state. Add an auxiliary decoder from the observed trajectory to the initial state or current state, and use graph rewiring or edge-growth until every hidden node has a directed path to the sensor within the observation horizon.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Insert an anisotropic fractional diffusion operator into residual blocks so that feature energy in dyadic frequency band j is damped at a rate proportional to 2^{alpha j}. Combine this fixed nonlocal dissipative branch with a learned convolutional residual branch. The resulting block is a frequency-selective alternative to ordinary residual updates, with stronger damping of unstable high-frequency feature modes.
Useful6/10
Difficulty5/10
Novelty7/10