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
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 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 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
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 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
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 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 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 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
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