Unverified
2026
Use the logarithmic exhaustion as a geometry for bounded hidden representations rather than only as a parameter constraint. A representation approaching the boundary receives an increasingly large metric, making ordinary Euclidean motion expensive and discouraging brittle saturation while preserving a bounded intrinsic gradient for the boundary coordinate.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a robust central region of each class or domain embedding cloud by intersecting halfspaces whose discarded cap mass is at most a prescribed fraction. Use this floating-body region to define prototypes or consistency targets, suppressing one-sided outliers without assuming Gaussian covariance structure. The centerpoint level 1/(d+1) provides a principled default depth parameter.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a neural network's categorical output over a rooted tree using cumulative probability mass on each rooted subtree. Train pairs of examples with a stochastic-dominance loss that compares these subtree masses, avoiding enumeration of all upper sets and making hierarchical monotonicity explicit. This is suitable for taxonomies, severity levels, hierarchical intents, and structured world-model states.
Useful5/10
Difficulty3/10
Novelty4/10
Unverified
2026
Estimate how often a representation lies on a separating hyperplane for alternative separable dichotomies, and use this quantity as a boundary-concentration penalty. Unlike a single classifier margin, the score measures whether many admissible separators consider the point ambiguous.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use linking number as a diagnostic and optional regularizer for representations of paired closed data manifolds. The probe identifies layers that collapse or separate class geometry through collisions and folds, giving an architecture-selection signal beyond loss and Jacobian singular values.
Useful5/10
Difficulty7/10
Novelty8/10
Unverified
2026
Represent entities, tokens, or graph nodes by learnable rays subject to orthogonality constraints on prescribed hypergraph contexts. In addition to enforcing orthogonality within each context, penalize distinct vertices that become collinear, because contextual orthogonality alone can permit or force geometric collapse. This creates a structured embedding layer for graph neural networks or context-aware attention.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Estimate the simplex-based ratio of a target or learned convex piecewise-linear polytope and use the theorem \(\rho_\Delta(P)\le 2^d-1\) to choose a minimum useful ReLU depth. During training, monitor whether the learned polytope is approaching a high-\(\rho\) target; if it is, widen the model without increasing depth only when the diagnostic indicates that depth is the bottleneck.
Useful5/10
Difficulty5/10
Novelty9/10
Unverified
2026
Build a decoder \(F:\mathbb{R}^m\to\mathbb{R}^N\) whose latent-coordinate derivatives are approximately horizontal, meaning they annihilate a prescribed one-form \(\lambda\). When \(\lambda\wedge d\lambda=0\), use local chart-wise training or Jacobian projection to exploit the paper's Lipschitz extension regime and obtain smoother, geometrically valid interpolations between observed boundary samples.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained pairwise attention score with an intersection of coordinate-wise threshold or interval compatibility heads. Each head is a supergraph that permits pairs satisfying one constraint, while the final attention edge exists only when every head permits the pair. This provides an interpretable inductive bias for multi-constraint relations and prevents the model from approximating a conjunction using a single unstable nonlinear score.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's asymptotic null law to decide when two minibatch covariance structures are statistically distinguishable, rather than applying a fixed covariance-matching weight throughout training. This creates a confidence-gated regularizer that is strong when discrepancies exceed sampling noise and weak when the observed difference is compatible with finite-batch variability.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add an inverse-capacitary-distance penalty to coordinate-network outputs near complex forbidden sets, rather than using only Euclidean distance-to-boundary weighting. The penalty is theoretically compatible with the network's spatial Dirichlet energy: it suppresses large values near obstacles while the gradient penalty controls the weighted singularity, even when the obstacle is thin, perforated, or fractal-like.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a bank of quadratic features encoding tangent contact with the reciprocal manifold x1 x2 = 1, rather than forcing a generic MLP to discover this interaction from arbitrary monomials. For positive bounded feature pairs, each feature is nonnegative and becomes exactly zero at a selected reciprocal operating point. The module can be used either as an input feature expansion or as a regularizer encouraging learned gates and scales to follow a reciprocal geometry.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace an unconstrained bilinear feature interaction with a joint spectral filter that only allows pairs of graph or spherical frequencies satisfying a soft radius constraint. The smooth factor attenuates interactions near and beyond the cutoff instead of making the hard low-pass decision used by ordinary spectral truncation, which should reduce high-frequency aliasing and unstable feature products.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Equip a learned embedding with a pullback Riemannian metric and regularize the bottom eigenvalue of the operator -Δ_g+γ scal_g. The regularizer searches for localized functions with low Dirichlet energy plus curvature potential, thereby penalizing unstable regions that ordinary Jacobian-norm penalties may miss.
Useful5/10
Difficulty8/10
Novelty8/10
Unverified
2026
Add a graph-derived conditional moment penalty to a neural representation or predictor. For each nested Markov constraint represented after fixing variables in R, residualize functions of (X,Z) with respect to Z under the post-fixing distribution and penalize their weighted correlation with functions of (Y,Z). This directly targets the equality constraint and can be more informative than an unconditional decorrelation penalty.
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Represent a population of N circular latent states using a three-parameter Möbius transformation applied to fixed uniform reference phases, rather than learning N unrelated angles. The resulting states remain on the circle by construction and can model concentrated or nearly uniform phase populations through a single concentration parameter.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a norm-controlled feature mixer that applies a polynomial spectral filter to the channel covariance of a transformer or MLP block. A quadratic filter centered at \(\rho\) suppresses covariance eigenmodes far from the target and preserves modes near it, providing a tunable alternative to purely variance-maximizing mixing or standard normalization.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize the spatial curvature of a scalar-output image network using the paper's Burkholder integrand instead of an isotropic squared-Hessian norm. The energy is nonconvex pointwise but quasiconvex on symmetric Hessians, so compactly supported Hessian perturbations cannot lower the total energy relative to an affine field; this may suppress oscillatory curvature while allowing sharper anisotropic transitions than quadratic smoothing.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Construct metric-graph Laplacian positional encodings only at frequencies whose empirical eigenvalues are statistically stable under the paper’s $(n v_\mu(h))^{-1/2}$ law. Use local ball-mass estimates and empirical eigengaps to gate or downweight unreliable eigenvectors, preventing small-sample spectral noise from entering a GNN or graph transformer.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a learned stochastic pair-interaction layer to a particle graph neural network, with a conditional normalizing flow generating the post-interaction relative state. Parameterize the update in center-of-mass and invariant relative coordinates so every sampled interaction preserves pair momentum and kinetic energy exactly. The flow learns the transition law directly from observed scattering or trajectory data, replacing repeated numerical collision solves or unconstrained message-passing…
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a two-output anti-collapse regularizer based on the determinant of the Jacobian Gram matrix, together with a penalty against proportional highest-degree coefficient tensors. The paper's inequality predicts that preserving coefficient non-proportionality prevents the output distribution from concentrating on thin curves or tiny regions, potentially improving coverage of a two-dimensional latent or generative output.
Useful4/10
Difficulty5/10
Novelty6/10
Unverified
2026
For a neural scalar field defined on the vertices of a mesh or graph, generate several random level interfaces by adding continuous perturbations and thresholding the field. Penalize the deviation between the empirical mean Euler characteristic of these interfaces and the value predicted from the host complex's f-vector, encouraging decision boundaries with stable global topology.
Useful4/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a centro-affine Dirichlet penalty to a neural module whose inputs or outputs lie on a sphere, such as normalized embeddings or attention directions. The penalty measures intrinsic variation under an unconditional convex-body metric while projecting out the constant and coordinate-affine modes excluded by the theorem.
Useful4/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment spatial training examples by replacing a compact active region with several separated components while preserving its exact value histogram, total active area, and amplitude. The augmentation probes the nonlinear interaction between diffusion-like receptive fields and threshold activations, which the paper shows can make fragmented and compact inputs evolve in opposite directions despite identical distributions.
Useful4/10
Difficulty4/10
Novelty7/10