Unverified
2026
For neural eigenmode solvers on periodic domains, train the full field directly and impose Bloch phase coupling only at opposite cell boundaries, rather than differentiating a periodic factor with respect to q through a quadratic volume operator. The boundary formulation preserves reciprocal-lattice equivalence exactly through z=exp(iqa), reducing spurious eigenmodes caused by inconsistent q-dependent discretization.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Separate low-support monomials, which involve only a few distinct input coordinates, from high-support monomials in a high-degree symmetric interaction layer. Compute the low-support orbit features exactly and prune, sample, or factorize the high-support tail, using the paper's cutoff scale as the initial sparsity rule.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's order-parameter dynamics to initialize spectral feature modes with deliberately separated activation times. This creates a controlled progressive-learning curriculum in which dominant modes become available first and weaker modes activate later, potentially reducing early gradient interference.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Represent adaptive computation or MoE routing as a continuous latent trajectory that crosses convex mode walls, with a Minkowski norm defining computational speed. At a wall, choose the outgoing latent velocity by the same constrained variational rule as billiard reflection, and use the local path-length certificate to detect or prevent pathological accumulation of infinitely many routing events in finite depth.
Useful6/10
Difficulty7/10
Novelty8/10
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
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
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 a tensor-product network over a low-dimensional state and a large distribution embedding with a neural operator that consumes the distribution vector once and outputs values on a finite-difference grid in the low-dimensional state. Train it with the governing PDE residual, explicit boundary residuals, and optional signed shape constraints, allowing the network to preserve numerical structure that a generic MLP would learn only implicitly.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a neural state-feedback controller together with a positive Lyapunov critic so that the closed-loop system decreases a Lyapunov function for every plant matrix inside the data-consistent uncertainty ellipsoid. Replace the paper's exact SOS constraints by differentiable sampled constraints or inner maximization over uncertain plant parameters, yielding a controller that is explicitly robust to measurement noise and system-identification error.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Maintain an SPD matrix preconditioner with the paper's deterministic Ornstein–Uhlenbeck covariance recursion rather than estimating an inverse through Newton–Schulz or an explicit matrix inverse. Apply this preconditioner to gradients from a small layer block, using damping and a conservative step size to preserve positive definiteness. The method is most plausible for low-rank, per-layer, or blockwise curvature matrices where dense matrix storage is affordable.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the purely diagonal preconditioner in AdamW or SGD with a blockwise, single-secant BFGS inverse-curvature metric. Use spectral damping and clipping relative to the diagonal RMS metric so the learned metric cannot become arbitrarily ill-conditioned, mirroring the paper's uniform comparison between its conjugate-free scaling and the primal barrier Hessian.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Initialize an invertible neural linear layer from a bounded discrete random matrix only after checking that every leading principal submatrix is nonsingular and that its LU growth factor is below a prescribed threshold. This replaces blind random initialization with a cheap resampling rule designed to prevent zero pivots and excessive finite-precision amplification in reversible or flow-based networks.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace isotropic variance control in a bottleneck or router with a spectral polarization penalty that drives each latent direction toward either variance 0 or variance 1. The intended result is an automatically selected active subspace: inactive coordinates can be pruned or quantized aggressively, while active coordinates retain information instead of being uniformly attenuated.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace raw polynomial or Fourier-like features in a small MLP with basis functions orthonormal under a Sobolev inner product that jointly measures feature magnitude and input derivative magnitude. This explicitly controls feature smoothness while preserving decorrelation, potentially improving conditioning and reducing the need for large derivative-regularization coefficients.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a learned dense bilinear map with a structured family of signed orthogonal matrices. Given feature vectors y,z in R^n, produce r interaction features h_a = y^T H_a z / sqrt(n), where the H_a form a Hadamard/Clifford-like family; the resulting bilinear map has operator norm at most one when r is within the Hurwitz–Radon limit. Learn only channel projections and optional scalar gates around this fixed mixer.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent each trainable parameter block as a global scale multiplied by a normalized shape, and evolve the shape through a projected Hamiltonian optimizer. The optimizer is designed so that normalized weights can approach a stable central configuration while auxiliary momenta retain phase-space volume that prevents ordinary Hamiltonian dynamics from having a full-space attractor.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the network-space inverse inequality to choose derivative order, collocation resolution, and feature separation jointly instead of enforcing arbitrarily high-order residuals on an under-resolved network. This creates an anti-aliasing rule: a network whose parameters are separated by \(\underline h\) cannot represent high Sobolev frequencies without a factor \(\underline h^{-(r-s)}\), so derivative penalties above the resolvable order should be disabled or accompanied by refinement.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent stochastic layer execution, branching, retries, and early exit as a finite continuous-time Markov chain, with the completed-prediction state absorbing. Learn transition rates jointly with neural-network weights, but use MFPT sensitivities to allocate rate changes according to their available control budget rather than allowing one routing edge to dominate halting-time control.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the Bregman objective's exact residual-dependent curvature to build a positive-semidefinite Gauss-Newton preconditioner for a neural network's scalar regression head. Negative curvature weights are clipped or damped before solving the update, preserving the original gradient while preventing residual patterns from producing unstable parameter steps.
Useful6/10
Difficulty6/10
Novelty6/10