Unverified
2026
Augment a hidden representation with positively homogeneous interaction features built from approximate eigenmodes of a linear layer. Fractional products of mode magnitudes and phases provide nonlinear channels whose transformation laws are inherited from the spectrum of the underlying operator, potentially representing oscillatory or multiplicative dynamics more compactly than a generic MLP.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Whiten intermediate feature vectors and constrain several gauge moments to remain in the dimension-dependent interval predicted by the paper's Gaussian/log-concave comparison. Apply the penalty only to moderate orders, where the paper gives a uniform bound independent of the particular log-concave distribution; this should suppress heavy activation tails without forcing all features to be exactly Gaussian.
Useful5/10
Difficulty3/10
Novelty6/10
Unverified
2026
Construct a branching residual network whose active computational paths reproduce according to a fixed offspring/connectivity law, while a controller can only remove paths using an age- or depth-dependent hazard \(u(a)\). Use the resulting bound as a diagnostic and gating schedule: removal can suppress unstable activity and reduce compute, but it should not be expected to cross the reproduction-driven propagation barrier unless the network's expansion operator is also changed.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Insert a small number of differentiable graphical mean-curvature-flow steps between a neural network's raw vector-field prediction and its task loss. The relaxation performs geometry-aware smoothing rather than isotropic Gaussian smoothing, and it can enforce fixed boundary values after every step.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add the paper's joint shape-and-mass distortion objective to a neural coordinate map whose output is a three-dimensional latent representation. Penalize anisotropic local Jacobians through a log-distortion term and penalize nonuniform latent occupancy through a density-gradient term, while learning the radii of an ellipsoidal latent target domain. This should discourage folds and collapsed regions without forcing every dataset into a fixed spherical latent prior.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a symmetric feature-interaction or Jacobian matrix A_theta whose desired rank is t, then regularize its t-th compound matrix toward rank one. This transfers the paper's identity that a rank-t matrix has a rank-one t-th compound, while the rank-one factor encodes Plucker coordinates of the kernel subspace.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Train an overcomplete linear or MLP layer so that square subsets of its output rows remain numerically invertible after neuron pruning or routing failures. Penalize sampled subsets with unusually small least singular values, using the paper's entropy exponent to quantify the severity expected from random redundancy.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a fixed quantile output with a Lambda-quantile head that receives a predictive sample set and applies a learned value-dependent threshold \(\Lambda(x)\). Unlike ordinary quantile regression, the model can use a low threshold in one value range and a high threshold in another, which is useful when error costs or calibration requirements vary across the output domain. Start with a piecewise-constant or monotone spline parameterization, then test whether allowing controlled…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the direct nonlinear loss step by a scalar-auxiliary-variable discretization of a gradient flow. The optimizer maintains an auxiliary value representing the square root of the nonlinear energy, so the coupled update has a discrete modified-energy decrease even when the step size is not restricted by the local curvature of the loss.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a dense channel-mixing matrix in a sequence layer with alternating diagonal propagation and sparse unipotent Stokes jumps. The diagonal part carries independently controlled exponential phases, while the unipotent factors implement cheap residual-like mode conversion without changing determinant or requiring a dense matrix multiply. Constrain the phase magnitudes and jump coefficients during training to obtain a reversible, norm-monitorable mixer.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a multiscale circular-integral penalty to a complex-valued neural field f_theta: R^2 -> C. The penalty directly tests the local contour condition that characterizes holomorphic functions, providing a derivative-free alternative to explicitly penalizing the Cauchy-Riemann residual.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace ordinary coefficient decay in a degree-d polynomial neural layer with the Bohnenblust–Hille coefficient quasi-norm, whose exponent p=2d/(d+1) is dimension-independent and strictly below 2 for d>1. Combine this penalty with a sampled torus supremum penalty so the layer is constrained both in its realized function amplitude and in the coefficient geometry predicted by the inequality.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent each of n signed tokens with two or more anticommuting feature channels and build equivariant outputs from exterior products rather than unconstrained tensor products. Penalize or project out positive-degree signed-permutation invariants, approximating the coinvariant quotient so that the layer retains order-sensitive orientation information without learning redundant invariant directions.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the layer at which persistent connected components and holes disappear to allocate capacity nonuniformly across a network. If representations simplify much earlier than desired, widen the responsible layers or insert an additional block; if simplification is excessively delayed, avoid spending parameters there. This turns persistent-homology COM into an actionable architecture-search signal rather than a post-hoc visualization.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained collection of coefficients over degree-nR compositions by a signed simplex-indexed coefficient tensor satisfying the paper's local cancellation equations. Anchor the balanced coefficient and use the resulting discrete unique-continuation principle to prevent the learned tensor from collapsing onto a tiny set of compositions, while still allowing structured sparsity below the full simplex size. Apply the tensor to a signed residual feature mixture or to expert logits…
Useful5/10
Difficulty6/10
Novelty9/10
Unverified
2026
Replace the explicit parameter update \(\theta_{k+1}=\theta_k-\eta\nabla L(\theta_k)\) with an approximate generalized proximal step defined by a simple map \(v\). The map is chosen so that the gradient operator and v satisfy an empirical pair-monotonicity condition, allowing larger stable outer steps and reducing oscillations in stiff or highly curved neural-network training.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Apply a low-degree polynomial feature lift to normalized hidden representations and penalize degeneracy of the covariance in that lifted space. This can detect collapse in nonlinear combinations of features even when the raw hidden covariance appears healthy.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense third-order channel-interaction tensor by a fixed sparse support selected through the paper's uniform-marginal infeasibility certificate. Supports with a large dual margin have an effective entropy base below the channel alphabet size, suggesting fewer independent interaction slices and cheaper contractions. Use the certificate either during architecture search or as a pruning score for an already-trained tensorized layer.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a tanh MLP with an explicitly tracked Pfaffian-chain complexity and select its width and input sparsity using the paper's zero-count bound. The bound limits the number of regular decision-boundary crossings along one-dimensional data-space restrictions, so it provides a principled way to discourage excessively oscillatory fits beyond ordinary weight decay.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Train an MLP coordinate map so that its local scale distortion is smooth in the interior and approximately constant on the boundary of the parameter domain. This implements the Chebyshev-Darboux-Milnor principle as a regularizer for neural parameterizations, potentially reducing boundary stretching and improving interpolation quality on learned geometric domains.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace or augment a singular scalar activation \(\sigma\) with a distributionally regularized activation \(g\) whose Fourier transform is multiplied by \((i\rho)^\alpha\). This suppresses the problematic low-frequency singular component and can produce better-conditioned random-feature or first-layer representations, while a residual raw-activation branch prevents loss of standard approximation behavior.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Parameterize a tree-structured policy through realization weights satisfying sequence-form flow conservation, instead of independently predicting probabilities at every node. Conditional action probabilities are recovered by dividing a child sequence weight by its parent weight, guaranteeing globally consistent probabilities and avoiding invalid or contradictory branch masses. This is suitable for hierarchical RL policies, adaptive computation trees, and neural routers with sequential gating…
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add randomized orthogonal frame mixing and an incoherence penalty to tensorized neural layers so that predictions and gradients are less controlled by a small coordinate block. The goal is to retain the bulk, approximately Gaussian behavior of tensor contractions while preventing rare coherent directions from dominating training.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Regularize the Gram spectrum of selected neural layers so that its low-order moments match the spectral moments generated by a truncated q-boson Jacobi operator. Unlike a simple Frobenius or spectral-norm penalty, this controls several parts of the singular-value distribution simultaneously and can discourage harmful spectral tails without forcing all singular values to be equal.
Useful5/10
Difficulty5/10
Novelty6/10