Log-Concavity of Conic Intrinsic Volumes
arXiv:2607.17278
2026
Regularization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper supplies a dimension-aware shape constraint for the Gaussian geometry of convex cones: their intrinsic-volume distribution is not merely log-concave, but satisfies an explicit strengthened inequality with dimension-dependent factors. This can be transferred to neural networks whose decisions partition feature space into homogeneous polyhedral cones, especially hard MoE routers and conic classifiers. The most practical use is a regularizer or diagnostic computed from Monte Carlo Gaussian projections, discouraging routers from creating geometrically pathological decision regions while preserving controlled distributions over boundary dimensions.
Ideas from this paper
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