Unverified
2026
Train an implicit neural field with a regularizer that evaluates its level-set minimality operator after several nonuniform diagonal coordinate dilations. Instead of penalizing only the aggregate operator at the original coordinates, invert the resulting Vandermonde system and penalize every coordinate-pair coefficient separately. This suppresses hidden curvature cancellations and should produce level sets that remain geometrically simple under anisotropic rescaling.
Useful5/10
Difficulty6/10
Novelty8/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
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
Add a geometric loss to a neural scalar field on hyperbolic latent coordinates, requiring the shifted Hessian \(\nabla^2v-vg\) to remain positive definite while matching the self-shrinker curvature equation. A boundary trace on a finite approximation of the ideal boundary conditions the solution, encouraging a canonical hyperbolically convex extension instead of arbitrary interpolation.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent the hidden state of a recurrent or implicit neural block by a convex reachable set and encode its recursive constraints as containment inequalities rather than unrolling a fixed number of steps. Eliminate the set variables to obtain the smallest representable invariant set, which can be used as a tighter robustness certificate, a training regularizer, or a principled initialization for equilibrium solvers.
Useful5/10
Difficulty7/10
Novelty6/10
Unverified
2026
Treat learned features on a mesh as differential forms and pool them against oriented chains using wedge or cap products instead of ordinary coordinate averaging. Couple forward and boundary features with the signed chain differential so that pooling commutes with differentiation, preserving local conservation and orientation information.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's explicit square insertion surgery to generate new quad-mesh examples with altered local valence patterns but unchanged genus, unchanged non-target vertices, and unchanged rotational-holonomy subgroup. Train a mesh GNN with consistency loss or label-preserving augmentation across the original and surgically modified meshes, forcing predictions to depend on global structure rather than accidental local tessellation.
Useful5/10
Difficulty5/10
Novelty7/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
Add a curvature-aware regularizer to a neural scalar field whose level set represents a shape, occupancy boundary, signed distance function, or decision surface. Instead of differentiating a noisy explicit surface or requiring a mesh, evaluate the tangential divergence of ambient test vector fields directly and penalize its deviation from a target weak relation.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace uniform PINN or neural-operator collocation by a graded point distribution concentrated in narrow regions between nearly touching interfaces. Use the paper's distance-dependent mesh scale to determine point spacing, and switch to a gap-dependent minimum scale when the separation becomes too small for the global mesh.
Useful5/10
Difficulty4/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
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
Replace an ordinary input-convex potential with a potential whose Hessian is encouraged to be symmetric positive definite and symplectic. Add a curvature penalty based on the scalar curvature of the Hessian metric, together with a theorem-derived interior target proportional to the inverse squared distance to the domain boundary. This should suppress pathological third-derivative oscillations while preserving nonquadratic structure near boundaries.
Useful5/10
Difficulty7/10
Novelty8/10