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
Use diagonal similarity scaling to reduce the induced infinity norm of a sparse recurrent transition or companion operator before or during training. Similarity preserves eigenvalues while changing coordinate-wise amplification, so the method can suppress non-normal transient growth without changing the represented linear dynamics.
Useful5/10
Difficulty5/10
Novelty6/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
Train a score-based diffusion model on a domain with partially reactive constraints, replacing hard rejection or large boundary penalties by a Robin boundary condition. Samples approaching the constraint boundary acquire a hazard proportional to accumulated boundary local time, giving a continuous interpolation between reflection and absorption.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Initialize directional prototypes, cosine-classifier weights, or angular attention directions with a spherical t-design rather than iid random vectors. Exact matching of spherical moments through degree t should provide uniform angular coverage and reduce initialization anisotropy, especially when the number of prototypes is small.
Useful5/10
Difficulty4/10
Novelty5/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
Replace independently random unit-normalized prototypes in a spherical classifier, vector-quantizer, or prototype contrastive head with prototypes selected to cover the sphere evenly. The method directly targets the paper's finding that weak-signal spherical K-means preserves initialization-induced Voronoi structure, reducing redundant prototypes and making early assignments less dependent on random seed.
Useful5/10
Difficulty4/10
Novelty5/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
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
Unverified
2026
Regularize a scalar network output so that its superlevel sets are approximately quasiconcave in input or latent space. Instead of penalizing the full Hessian, penalize positive curvature only in directions orthogonal to the output gradient, matching the paper's projected-Hessian and weighted 1-Laplacian structure.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Train an implicit neural field with a regularizer that evaluates its level-set minimality operator after several nonuniform diagonal coordinate dilations. Instead of penalizing only the aggregate operator at the original coordinates, invert the resulting Vandermonde system and penalize every coordinate-pair coefficient separately. This suppresses hidden curvature cancellations and should produce level sets that remain geometrically simple under anisotropic rescaling.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the reciprocal arrangement as a probe of whether a learned representation has the intended angular response, and penalize deviations from the paper's universal beta distribution. This converts the theorem into a distribution-level regularizer rather than assuming that the reciprocal layer itself improves task loss.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the graph-coloring stability concept to route graph nodes to experts. Nodes rank experts by router logits, adjacent nodes are constrained to use different experts, and a blocking cycle is a directed cycle in which every node prefers the expert currently assigned to the next node. Eliminate profitable feasible cycles or penalize their existence so routing reaches a locally stable assignment instead of oscillating between equally plausible expert allocations.
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Represent each example or minibatch by two positive semidefinite feature maps, such as teacher and student covariance operators, and penalize their noncommutative operator-valued f-divergence rather than only a scalar KL or Frobenius distance. The matrix-valued penalty preserves directional disagreement in feature space and is compatible with positive postprocessing, making it a candidate replacement for covariance matching in distillation and representation regularization.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a static top-k MoE capacity rule with a router whose expert allocation evolves through a finite-domain coverage process. Experts with larger current occupancy can either receive more future capacity, intentionally amplifying specialization, or receive less capacity by reversing the size dependence, allowing a controlled test of the paper's asymmetry-amplification mechanism.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Build a constrained autoregressive model whose initial logits are generated from a translation-invariant MPS associated with a local zero-mode construction. The MPS supplies a structured valid distribution before a Transformer residual is added, so the model starts on the constraint manifold instead of learning validity through a penalty.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a Michael-Simon-inspired penalty to a neural implicit surface, neural renderer, or differentiable mesh generator. The penalty suppresses large-area sheets whose anisotropic first variation is small, which should reduce spurious folds, floating components, and geometrically unstable solutions while preserving surfaces required by the task loss.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Represent a neural model's particle ensemble, latent samples, or routing prototypes as an empirical probability measure and penalize its Wasserstein total variation across training or inference steps. Discrete resampling and particle replacement remain allowed, but their mass-distance cost is made explicit so the model cannot obtain a cheap distributional change through untracked teleportation. A weak continuity-equation residual can be added as an auxiliary loss or used as a diagnostic.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Train two parameter replicas with common low-rank stochastic forcing and an adaptive finite-dimensional Cameron–Martin correction that contracts their discrepancy in a weak parameter metric. Transporting the forcing directions through the loss Hessian is intended to make a rank-k perturbation influence more than k raw parameter directions, while damped momentum suppresses high-energy divergence.
Useful5/10
Difficulty7/10
Novelty7/10
Unverified
2026
Represent a time-dependent Hamiltonian system on the reduced state $(q,t,p_q)$ rather than on the redundant extended state $(q,t,p_q,p_t)$. A neural Hamiltonian section predicts one canonical representative of each affine cotangent fiber, while an optional symmetry loss enforces consistency under transformations that translate time.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Constrain a channel-mixing layer to be a product of nonnegative bidiagonal matrices, rather than an unconstrained dense matrix. The resulting totally nonnegative operator is predicted not to increase sign oscillations in ordered channel features, potentially reducing high-frequency feature noise and making deep stacks more stable.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Partition activations into dyadic magnitude bands and allocate sparse connectivity separately to heavy and diffuse coordinates. Protect high-magnitude coordinates with more reliable connections while using randomized flat connectivity for the many small coordinates, keeping the total number of nonzeros fixed.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a one-step recurrent update with a causal convolution over past affine innovations using an exponential-fractional kernel. Add mean reversion and calibrate the innovation amplitude so that activation mean and variance remain approximately invariant across sequence position while retaining long-range, power-law-like memory.
Useful5/10
Difficulty6/10
Novelty5/10