Unverified
2026
Represent a sequence of hidden states as points on a Riemannian sphere and penalize discrete geodesic curvature rather than merely penalizing adjacent-state differences. The regularizer discourages sharp bends in representation trajectories while remaining comparatively insensitive to uniform traversal speed, making it suitable for transformer depth trajectories or diffusion denoising paths.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a finite-resolution geometric code to a 3D neural encoder: quantized lattice occupancy, local barycenters, and tangent directions are converted into structural tokens alongside ordinary point or mesh features. Choose lattice spacing from estimated local reach so that small perturbations do not change the code, and train the continuous encoder to agree with this discrete structural representation.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a fixed weighted sum of normalized neural-network objectives with a differentiable fuzzy scalarizer that assigns every criterion to desirable, tolerable, and undesirable regions. Explicit output consequents turn these semantic classes into a scalar training loss, while localized memberships reduce flat plateaus and make the optimizer distinguish genuine preference minima from arbitrary ties.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Add an invertible two-dimensional flow block whose Jacobian and coordinate outputs are explicitly regularized to preserve independence of several prescribed product distributions. Instead of estimating independence only from samples, enforce the change-of-variables functional equation for multiple density probes, encouraging the learned map to belong to a low-dimensional family of independence-preserving transformations.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Represent sequence positions as vertices on a circle and use a maximal family of mutually non-crossing d-arcs to define the allowed attention interactions. Rotate the family by d positions, or use several phase-shifted families across successive layers, so each layer has only O(N) edges but repeated layers propagate information over long distances. The geometric compatibility rule replaces arbitrary local-window or hand-designed sparse masks with a structured family whose maximality gives broad…
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace independent logits for all d-subsets with a neural head that outputs a d-by-n matrix A and assigns subset weight x_I=det(A_{:,I}). After normalization, these minors define a probability distribution over subsets. The head imposes a strong algebraic coupling between subset probabilities, reducing parameters and potentially improving extrapolation to rarely observed subsets.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a curl-Sobolev quotient to a 3D neural network whose intermediate features are vector fields or discrete 1-forms. The regularizer rewards features with strong curl-helicity relative to their L^{2n/(n+1)} curl energy, while an explicit Hodge projection removes exact-form components that lie in the curl kernel. In three dimensions this is a differentiable, gauge-aware alternative to simply penalizing feature gradients.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a Fourier-domain anti-concentration penalty to normalized embeddings or latent codes. For random one-dimensional projections, penalize empirical characteristic functions that exceed a power-law envelope whose exponent is determined by the estimated effective fractal dimension, discouraging collapsed, lattice-like, or overly periodic representations.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace an unconstrained simplex router or differentiable mixture layer with a resource-cost-aware router whose learned costs satisfy the paper's monotonicity curvature condition. Use a Euclidean-regularized Frank–Wolfe oracle to update routing probabilities, which should reduce cycling and sensitivity when several examples or agents compete for the same experts.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a hypergraph p-Laplacian penalty to hidden representations of samples or tokens grouped by a known relation, such as augmentations of one image, mentions of one entity, or tokens in one retrieved semantic cluster. Unlike mean pairwise smoothing, the penalty targets the maximum weighted discrepancy within each hyperedge, preventing a single representation from becoming an outlier while allowing moderate variation among the remaining members.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent each bias-free hard MoE routing region as a polyhedral cone in router feature space and regularize its estimated conic intrinsic-volume sequence. The penalty enforces the paper's strengthened log-concavity inequality, preventing routing regions from having implausible concentration at isolated face dimensions and potentially reducing unstable expert starvation.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's boundary Hadamard formula as a sensitivity-weighted interface objective for a neural potential and a neural implicit domain. Boundary points with large outward normal flux receive larger shape-update weight, while the positive mixed Monge–Ampère boundary measure supplies a geometry-aware quadrature weight. This gives a mathematically motivated alternative to uniformly weighted boundary residuals in neural free-boundary and obstacle-problem solvers.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a coordinate-free regularizer that prevents a batch of unit-normalized embeddings from concentrating almost entirely on one side of a hyperplane passing through their spherical centroid. Sample random directions tangent to the estimated centroid, measure the soft fraction of embeddings in each corresponding hemisphere, and penalize fractions below the spherical Grünbaum constant. This targets directional mode collapse while preserving rotational invariance.
Useful5/10
Difficulty3/10
Novelty7/10
Unverified
2026
Replace Euclidean Mixup with interpolation in a learned anisotropic embedding metric. Use the paper's distortion coefficient to weight the endpoints and add a consistency term requiring the model's interpolated prediction to respect the geometry-dependent mass allocation.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the calibrated compact-support maximum-entropy law as a latent prior or representation regularizer in a VAE or autoencoder. Unlike a Gaussian prior, it prevents latent codes from drifting arbitrarily far while retaining explicitly controlled mean and covariance.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Estimate the spatial distribution of minibatch embeddings using normalized residuals, then use the resulting spatial depth as a bounded confidence weight on each example's loss. Examples whose embeddings are spatially central receive near-unit weight, while isolated or adversarial examples are automatically downweighted without estimating covariance matrices or choosing a dimension-dependent bandwidth.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a local curvature penalty to graph learning or GNN training that penalizes sampled node signals with negative discrete Bakry–Émery curvature. The regularizer targets graph bottlenecks and irregular diffusion geometry, and can be applied either to a learned adjacency matrix or to the task-relevant hidden representations propagated by a fixed graph.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Build a linear state-space or recurrent layer in a learned pseudo-unitary coordinate frame $\Theta(t)$, and penalize the covariant coefficient $P_{m,\Theta}$ instead of penalizing $\Theta'(t)$ or transition-matrix norms directly. The regularizer is sensitive to meaningful variation of the represented Hamiltonian but is invariant to redundant gauge representations, potentially reducing unstable latent modes without forcing every parameter matrix to be small.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a representation-learning objective with penalties enforcing the paper's four-point metric inequalities, and use an exponential snowflake kernel instead of unconstrained dot-product similarity. The experiment tests whether geometrically valid similarities improve retrieval or attention stability at equal model size and compute.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent the sequence of hidden states through a residual or state-space network as a polygonal curve and penalize turns according to their signed moment arm relative to the curve's input and output states. This targets bends that most strongly reduce endpoint separation, rather than applying an unweighted total-curvature penalty. The expected benefit is better long-range signal transport and less folding of hidden trajectories at comparable parameter count.
Useful5/10
Difficulty4/10
Novelty7/10
Unverified
2026
Regularize a scalar feature field on a 2D grid by interpreting each feature value as the uniformizing variable of a hyperbolic ring and penalizing violations of local orthogonal-ring angle closure. Unlike a raw Laplacian penalty, this constrains the representation through positive hyperbolic radii and geometrically meaningful edge compatibility.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a locally oriented three-channel feature frame by its positive-definite polar factor, removing arbitrary SO(3) basis rotations before the feature enters an MLP, attention block, or graph message-passing layer. Process the resulting SPD matrix in log coordinates so the downstream network receives a globally unconstrained symmetric representation rather than a gauge-dependent frame.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Maintain a small population of neural-network parameter replicas and interleave ordinary gradient steps with Boltzmann/Kac-style binary collisions. Each collision preserves the pair's mean parameter vector and relative-distance norm while randomly rotating the relative direction, with collision frequency proportional to a regularized negative power of replica distance.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Construct a recurrent or state-space block with two learned transition matrices A and B representing two commuting update directions. Besides penalizing noncommutation and deviation from isometry, penalize the negative spectrum of the paper's core operator H(A,B), encouraging a structured overlap of one-step and two-step ranges. Compare this against an orthogonal-RNN baseline and against commutation-only regularization on long-horizon sequence tasks.
Useful5/10
Difficulty6/10
Novelty7/10