Unverified
2026
Use the paper's analytic merging threshold to choose the Scaled-NAP exponent from an intended community size rather than treating alpha as an arbitrary hyperparameter. A warm-started schedule can begin with persistence-like fine structure and increase alpha only when the model has learned reliable local groups.
Useful5/10
Difficulty3/10
Novelty8/10
Unverified
2026
Approximate a graph's adjacency by a learned abelian Cayley host and use one shared message-passing operator for every edge in the same inverse-pair generator class. Keep only the unexplained original edges as a residual branch, so the layer interpolates between a parameter-efficient group convolution and ordinary graph message passing.
Useful5/10
Difficulty7/10
Novelty7/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 powers or unconstrained polynomial spectral features with normalized Jacobi features whose amplitude is provably bounded on the entire input interval. Use trainable mixtures of these features in a positional encoding, graph spectral layer, or MLP front end, while preserving the theorem's normalization and optionally constraining the learned mixture norm.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a hard nonnegative slack or ReLU output by the barrier-derived map \(x_s(w)=\frac{w+\sqrt{w^2+4s}}{2}\). Unlike an arbitrary smooth activation, this output is the unique positive solution of \(x(x-w)=s\), so the network can explicitly monitor complementarity and anneal \(s\) toward the true inequality-constrained solution. Use it in a constrained output head or in hidden layers whose activations represent nonnegative resource, probability, or routing slack variables.
Useful5/10
Difficulty3/10
Novelty4/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
Replace a globally shared latent transformation group by a source-dependent collection of valid transformation paths. A feature at latent point z is transported only along paths whose transformed coordinate never reaches the singular locus, while homotopic paths are identified and composable paths are concatenated. This should let an equivariant model represent branched or incomplete symmetries that ordinary group-equivariant layers must discard.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Interpret the Cramér energy of an embedding as the logarithm of the number of random in-distribution samples required to reach it through a convex hull. Use this quantity to stratify training data into geometric difficulty levels and schedule exposure from low-energy central points toward high-energy boundary points, or preferentially replay high-energy points after the model has learned the core distribution.
Useful5/10
Difficulty5/10
Novelty7/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
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
Unverified
2026
Parameterize a learned token metric as a nonnegative sum of sparse integral rank-one projections with unimodular support, rather than learning an unconstrained dense positive-semidefinite matrix. Graph-incidence covectors give an immediately implementable support family, while nonnegative coefficients guarantee positive semidefiniteness by construction.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a learnable curved augmentation trace to latent features and penalize excessive overlap between its translated tubular neighborhoods. The regularizer uses the paper's curvature-driven bound as a scale-dependent target: nearby translations may overlap at order delta, while translations at distance r should overlap only at order delta squared divided by r. This encourages feature perturbations to form a non-flat, coverage-efficient manifold rather than collapsing onto a line or a small set of…
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use reverse plane partitions of a minuscule heap as the discrete codebook for a VQ-VAE or discrete sequence model. Codes are not arbitrary indices: each code is an order-preserving array, and crystal raising/lowering operators define a sparse, semantically structured neighborhood graph for augmentation, routing, and metric regularization.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a regularizer that rewards each neuron's expected absolute response to random sign perturbations, normalized by the neuron's l2 norm so ordinary weight scaling cannot trivially increase the objective. Use the paper's distance-sensitive Khintchine lower bound to penalize filters close to the two-coordinate extremal set, promoting distributed and perturbation-stable feature extraction.
Useful5/10
Difficulty3/10
Novelty8/10
Unverified
2026
Replace a fixed discrete augmentation distribution over a finite symmetry group by a continuous-time random walk driven by learnable symmetric Poisson jump rates. Use the resulting transformed-example distribution as a symmetry regularizer, with an even ℓ^{2m} distance to uniformity whose behavior is guaranteed to improve monotonically as the symmetric rates increase for the group families covered by the paper.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert an overcomplete sparse feature bottleneck into an MLP or embedding stream: encode an activation h with z = ReLU(W^T h + b), then reconstruct or continue computation from Wz. Normalize dictionary columns and train them to remain nearly tight and low-coherence, while choosing a negative bias from an estimate of worst-case cross-feature interference. The hypothesis is that this gives cleaner, more stable feature supports than an ordinary L1 sparse autoencoder at the same latent width.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Use the paper's multicycle result to distinguish useful parameter motion from internally circulating optimizer activity. Add an auxiliary two-cycle diagnostic to an optimizer or recurrent training loop: one cycle represents net loss-improving motion, while another represents momentum or noise circulation that can remain active even when the net parameter update is nearly zero. Penalize or throttle this hidden circulation to prevent apparent convergence from masking high update variance and…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Train a neural approximation to a scale-dependent effective action, energy functional, or field while penalizing the residual of a known continuous-symmetry Ward identity. Select the regulator, smoothing scale, or architecture hyperparameter at the minimum Ward residual, and require that the residual decreases when model capacity or derivative-expansion order increases.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Partition a neural network into coupled parameter or activation blocks with distinct effective noise temperatures, and inject Gaussian perturbations whose covariance contains off-diagonal terms induced by the coupling. Unlike standard independent gradient noise, equal-temperature or detached blocks should have negligible cross-correlation, whereas unequal-temperature coupled blocks should exhibit measurable correlated fluctuations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize hidden-state trajectories so that their temporal statistics match the moments of an isotropic Haar-distributed state up to order k, while deliberately leaving moments above k unconstrained. Use k as a controllable mixing knob: k=1 or 2 suppresses drift and anisotropic variance, whereas larger k imposes stronger distributional invariance and may remove useful temporal information.
Useful5/10
Difficulty4/10
Novelty7/10