Unverified
2026
Replace an unconstrained Fourier-feature block in an implicit neural representation or coordinate MLP with a sparsity-aware layer whose output gain is normalized according to the distance outside the training interval. The normalization uses the paper's endpoint law, preventing a small in-domain Fourier representation from producing arbitrarily large outputs just beyond the observed coordinate range.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single smooth inverse predictor near detected ambiguity boundaries with multiple prediction branches and a soft gate. The gate is trained to preserve distinct decompositions rather than forcing the network to interpolate through a thin high-curvature transition layer, while a Jacobian or curvature penalty identifies unresolved ambiguity regions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Represent input or parameter uncertainty locally by a low-order polynomial expansion of the network output, and compute only task-relevant directional third- and fourth-order moments. Add a penalty that calibrates or controls projected skewness and kurtosis, allowing the model to represent bent or elongated confidence regions without constructing a full dense moment tensor.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's singular stopping-gain term to explicitly measure how much learned feature covariance crosses a max or routing boundary. Penalize excessive covariance in the normal direction to the switching surface, rather than pretending that the max operation has an ordinary Hessian.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn a recurrent or state-space memory into a constrained hereditary state: the latent state remains in a learned convex domain, and only input motion that reaches the boundary changes the plastic component. This creates a nonexpansive, rate-independent memory that should suppress unstable state growth and make the representation depend on meaningful cumulative changes rather than arbitrary update frequency.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a targeted barrier or hinge loss to an existing attention or graph-mixing matrix that penalizes violations of signed circular-minor inequalities. Instead of enforcing only generic entrywise positivity, constrain higher-order noncrossing interactions encoded by determinants. This can suppress pathological oscillatory mixing while still allowing individual entries to be negative when the global structured sign pattern permits them.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use midpoint or running ergodic averages of adversarial iterates for evaluation and checkpointing instead of exposing a single phase-dependent iterate. The mathematical attenuation factor suppresses rotational error, especially for modes with large step-size-times-frequency product.
Useful6/10
Difficulty2/10
Novelty4/10
Unverified
2026
Replace independent uncertainty heads in a branching neural network with a structured variational posterior whose non-root node distributions condition on jointly sampled latent states of all parents. This allows collider evidence to explain away upstream uncertainty: evidence at a child can alter the posterior over several parent branches instead of leaving their uncertainties artificially independent. The approach can be implemented as a stochastic DAG network and trained with an evidence…
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace the unconstrained parameter update of a selected neural layer by a tangent update generated by a rank-two skew-symmetric operator. A Cayley transform then applies this operator while exactly preserving a quadratic parameter energy, preventing exploding or vanishing layer norms without projecting after every step. Add a separately trained scalar gain if fixed norm would otherwise reduce expressivity.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Model a finite training run as a driven stochastic process whose control parameter is the learning rate or another scheduled hyperparameter. Compare the distribution of parameter perturbations, activations, logits, or losses after a finite-rate update to a reference distribution generated by a much slower approximately adiabatic schedule; reduce the learning rate when the estimated relative entropy exceeds a calibrated threshold.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an optimizer's endpoint-only step acceptance rule with a robust envelope rule that requires all monitored neural-network constraints to remain feasible for every interpolation point between the old and proposed parameters. This targets transient instability during a large update, such as exploding activations, loss spikes, negative curvature, or violation of a spectral-norm budget, even when the final endpoint appears acceptable.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a fractional-Laplacian penalty to a neural network evaluated on binary inputs or binary latent gates. For 1 < p < 2, the endpoint inequality implies that controlling fractional spectral energy controls the L_p norm of aggregate coordinate-flip sensitivity, potentially giving a more global robustness objective than explicitly enumerating one-bit perturbations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add asynchronous nonlinear consensus steps between local-SGD updates in a federated or decentralized system. Instead of averaging a participating client with all peers, replace one client parameter vector by the coordinatewise p-mean of neighboring replicas, allowing sparse communication and reduced sensitivity to atypical client models.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the two-species phase diagram as a training controller: gradually increase one-way mutation \(\lambda\) and mutant suppression \(\mu\) while monitoring whether feature activity approaches the absorbing boundary. This creates a measurable curriculum from independent learning to controlled competition instead of turning on strong destructive interactions at initialization.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Use a multivariate generating function to construct training examples or network variants with an exactly controlled amount of a structural attribute, such as graph branching, routing depth, skip connections, or the number of experts activated. Train by gradually changing the target coefficient slice instead of relying on an uncontrolled random curriculum.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace Fourier or sinusoidal one-dimensional coordinate features with a trainable radical layer f(x)=sum_i c_i sqrt(P_i(x)), where every P_i is a strictly positive quadratic. A nonzero scalar output formed by such a layer has at most 2n distinct real zeros, providing an explicit bound on sign changes and suppressing uncontrolled ringing. Use the radical features as an input embedding for a conventional MLP or neural implicit field.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Prune higher-order tensor or polynomial interactions while preserving an exchange-closed support instead of independently retaining the largest weights. The resulting sparse interaction pattern avoids arbitrary holes and retains structured substitutions between coordinates, potentially improving parameter efficiency and robustness after pruning.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Replace a raw pairwise repulsion or similarity penalty on neural embeddings by a centered mean-field energy plus a Carleman–Fredholm determinant correction for finite-batch quadratic fluctuations. The correction uses the spectrum of a centered learned kernel, retaining the effect of important fluctuation directions while removing the first-order mean-field component. A Nyström or landmark approximation makes the method practical without forming a large batch-by-batch determinant.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ad hoc Gaussian or Laplace noise injection with a Laplace majorant calibrated to the observed finite-range sub-Gamma parameters of a neural perturbation. For convex perturbation losses, the calibration guarantees that the expected loss under the scaled Laplace noise upper-bounds the expected loss under every centered random perturbation satisfying the same Bernstein-type MGF constraint.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a learned linear operator by Monte Carlo averages of unitary-conjugated copies, where the conjugators are discrete time-frequency shifts sampled from a narrow phase-space distribution. The conjugation preserves the singular spectrum of each sampled operator, while the expectation penalizes sensitivity to small translations and modulations without directly shrinking the operator norm.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent augmentation centers or training examples in a low-dimensional torus and accumulate the geometric overlap of their augmentation neighborhoods. Add a finite-horizon penalty that detects latent locations with insufficient accumulated coverage, while constraining center uniformity so that coverage optimization does not collapse all samples to one location.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Apply a regularizer that penalizes feature disagreement under a finite set of known transformations. The paper's spectral-gap inequality gives a quantitative reason that this local consistency penalty controls distance from the subspace invariant under the transformation group, while the task loss prevents undesirable collapse.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a mixed Fourier-L1 penalty to a particle or molecular neural network so that frequencies involving selected coordinate blocks are penalized by products of per-coordinate weights, rather than only by one isotropic norm. This should favor representations that capture pairwise or blockwise structure efficiently in high-dimensional configuration spaces, especially for wavefunctions, molecular energies, and other permutation-structured functions.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent an original neural-network block and a proposed rewritten block as constrained optimization formulations over inputs and trainable parameters, then certify that the rewrite preserves feasibility and the ordering of losses over a bounded domain. This gives a compiler or pruning pipeline a formal reject/accept gate instead of relying only on numerical regression tests.
Useful5/10
Difficulty7/10
Novelty8/10