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
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
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
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
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
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 one local spatial aggregation in a CNN or vision transformer with a discretized Riesz potential whose kernel is proportional to $\|x-y\|^{-(n-s)}$. Normalize the layer using the paper's sharp weak-type constant and penalize empirical violations of the resulting tail bound, encouraging nonlocal context without allowing a small set of pixels or tokens to generate arbitrarily large responses.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a Goldfarb–Idnani-style active-set solver as a neural constrained layer or optimizer substep, but never trust a guessed active set solely because its linear system solved. Remove duplicate or dependent constraints, solve the reduced KKT system, and accept the result only after checking primal feasibility, dual sign conditions, and stationarity. This gives exact enforcement of linear inequalities and a diagnostic certificate when the constraint set is infeasible.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a differentiable penalty that encourages a neural implicit field to have a controlled local homogeneity degree across concentric spatial scales. The penalty compares the flux-normalized frequency at adjacent radii, optionally targeting a desired degree k, so the network is discouraged from producing scale-inconsistent or oscillatory local geometry.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace two unconstrained scalar quadratic feature heads with a pair whose quadratic forms admit a positive-definite linear combination. This prevents the two heads from simultaneously vanishing on any nonzero hidden vector, which can reduce representation collapse and improve the conditioning of downstream gates or auxiliary objectives. The constraint can be implemented softly with a spectral-margin penalty, or exactly by parameterizing one learned pencil as positive definite.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace raw polynomial features in a scalar MLP expansion with endpoint-weighted orthonormal Jacobi features. The paper's envelope gives a degree- and parameter-aware scale for each feature, preventing high-degree terms or endpoint behavior from dominating gradients while preserving a richer approximation basis than low-degree monomials.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add coefficient-spreading and moment-calibration mechanisms to binary or sign-noised linear layers. For each output neuron, normalize its real-valued weights and penalize large normalized coordinates, so its signed preactivation obeys the paper's quadratic Gaussian approximation rather than the weaker linear bound. This should make activation scales more predictable and reduce training instability caused by highly concentrated binary projections.
Useful5/10
Difficulty3/10
Novelty4/10
Unverified
2026
Represent each neural prediction as a finite probability distribution and project it, under an optimal-transport cost, onto the set of distributions dominated by a teacher or target distribution in convex order. This enforces a global spread and risk relationship across all convex observables rather than adding separate variance, tail, and calibration penalties. Use a periodically refreshed projection during training and test whether it improves uncertainty calibration and robustness at equal…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
For a coordinate-based neural network u_theta(x) solving a fully nonlinear second-order PDE, replace the raw quadratic-Hessian residual with the concave, homogeneous operator G(D_x^2 u_theta)=sqrt(sigma_2(D_x^2 u_theta)). Add differentiable barriers that keep the predicted Hessian inside the positive branch Gamma_2, preventing optimization from entering regions where the PDE operator is non-elliptic.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a task-aware error-protection code to a binary or low-cardinality latent representation. The encoder remains systematic, preserving the original latent coordinates, but appends repeated or parity coordinates computed from a linear task map so that latent states with different task values are separated by at least a chosen Hamming distance. Redundancy is allocated according to the rank of the task map rather than the full latent dimension.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a neural implicit occupancy or signed-distance model with Fourier coefficients sampled on a dual lattice, while explicitly preventing spatial aliasing under the corresponding periodic lattice. The spatial reconstruction loss is supplemented by a finite Fourier loss and a penalty for shape-point differences that approach nonzero lattice vectors.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary simplicial incidence matrices in a graph or mesh neural network by integer-ratio weighted incidences derived from a divisibility hierarchy on simplex weights. The resulting up/down message-passing operators preserve exact chain cancellation, so features propagated around a filled simplex cannot create spurious boundary signals. Train the weights either from known metadata or as positive integer powers of a small prime, while retaining an ordinary-incidence baseline for ablation.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace or augment a low-dimensional recurrent transition with affine maps whose linear parts belong to a structured unipotent holonomy family, and train the cell so that positive accumulated translation produces a controlled projective attractor. This creates a measurable two-basin long-horizon behavior: hidden-state perturbation directions should align with a learned direction X or its antipode according to the sign of a scalar functional, rather than exhibiting unconstrained rotation or…
Useful5/10
Difficulty6/10
Novelty8/10