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
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
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
Replace ordinary per-coordinate activation normalization or covariance whitening with a learned or frozen affine map based on a minimum-volume ellipsoid calibrated to the activation convex hull. Estimate the hull's Minkowski symmetry and use the bound \(\rho=\sqrt{d/\alpha}\) to set a principled clipping radius, where \(d\) is feature dimension and \(\alpha\) is the measured symmetry. This should reduce worst-case clipping of asymmetric activation distributions without requiring a much larger…
Useful5/10
Difficulty6/10
Novelty4/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
Before message passing, repeatedly detect a pair of vertices with nested open neighborhoods and fold away the dominated vertex while preserving its information in the surviving vertex's feature state. The graph reduction is justified by homotopy invariance of the independence complex, while the feature merge prevents task-relevant attributes from being lost. Add a topology-aware ablation comparing this exact fold against random node pooling and standard learned pooling.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a channelwise wavelet or strided-convolution front end with vector-valued wavelet filters that deliberately pair different scalar wavelets across channels. The resulting subbands retain compact-support multiscale structure and can be recombined exactly, while a small learned 1x1 mixing layer operates on the cross-channel coefficients instead of learning a full expensive convolution at every scale.
Useful5/10
Difficulty5/10
Novelty4/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
Use the measured power-exponential covering dimension of an activation manifold to choose the growth rate of latent codebooks, prototypes, or quantization resolution. The goal is to avoid spending parameters on a representation whose attainable resolution exceeds the intrinsic covering complexity.
Useful5/10
Difficulty6/10
Novelty7/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
Use the adjacency matrix of a vertex-transitive strongly regular graph as a fixed sparse attention or token-mixing mask. Every vertex has the same degree, and every pair of vertices has exactly one of two common-neighbor counts, giving predictable two-hop coverage and avoiding the degree and connectivity irregularities of random sparsification.
Useful5/10
Difficulty5/10
Novelty6/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 an unconstrained low-rank adapter or similarity projection with a learned subspace carrying a prescribed signed metric. The module learns an orthonormal basis U for a k=p+q dimensional subspace, forces the compressed form U^*I_{m,n}U to have p positive and q negative eigenvalues, and uses the resulting pseudo-inner product for signed attention or retrieval scores.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the Gaussian approximation of a high-dimensional maximum to set a simultaneous coordinate-clipping threshold for minibatch gradients or activations. The threshold is sampled from a correlated Gaussian with the observed batch covariance, rather than treating coordinates as independent or estimating an unstable extreme quantile directly.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace random or learned routing hashes for tokens arranged on a d by d grid with a fixed family of mutually orthogonal anti-Latin squares. Each channel assigns exactly d of the d squared tokens to every bucket, while any two channels jointly distinguish every grid position. The resulting router has deterministic load balance and multi-view positional diversity.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment standard sinusoidal or RoPE position features with bracket-quadratic phases $e(-\theta n\lfloor\beta n\rfloor)$ generated by a Heisenberg nilmanifold orbit. Multiple irrational coefficients and output frequencies produce a cheap deterministic encoding whose empirical cross-position correlations should exhibit cancellation instead of the periodic aliasing of rational or finite-frequency encodings.
Useful5/10
Difficulty3/10
Novelty7/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
Replace continuous stochastic-gradient updates by a flashing schedule with alternating ON phases, where gradients act normally, and OFF phases, where gradients are suppressed or weakened and controlled noise allows escape from local traps. Estimate directional asymmetry of the local loss basin from forward and backward probe distances, then set the flashing frequency using the ratchet resonance law so that noise-assisted transitions preferentially produce net progress toward lower loss.
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
Use the constraint matrix rank and nullity to set an explicit upper bound on the number of facial-reduction phases in an SDP layer representing structured binary decisions. Apply those phases before the main primal-dual solve, stopping after the rank–nullity budget and using the reduced face for all subsequent forward and backward computations.
Useful5/10
Difficulty7/10
Novelty8/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