Polynomial Tube Regularizer
Implementation & benchmark of arXiv:2607.24487 — Conic reach and polynomial parallel volume in the plane
Source paper: Conic reach and polynomial parallel volume in the plane arXiv:2607.24487 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Regularize a two-dimensional latent class support or decision-boundary projection by requiring its measured small-radius tube area to follow the quadratic law predicted for conic geometry. Penalize the fitted linear and quadratic coefficients only weakly, but strongly penalize nonquadratic residuals and rapidly changing coefficients across training checkpoints. The intended effect is to remove cusps, tangential near-contacts, and narrow gaps without directly imposing smoothness on the network parameters.
Formulas
Mathematical statement
For a planar cone C with link K on the unit circle, let m be the number of complementary gaps of K, let their angular widths be theta_i, and define Delta(theta)=tan(theta/2) for 0<theta<pi and Delta(theta)=+infinity for pi<=theta<=2pi. If Delta_min=min_i Delta(theta_i), r_0 is the localization radius, and T_{C,r_0}(t) is the Lebesgue area of points with unique nearest point in C at distance in (0,t] whose projection lies in the radius-r_0 core, then the paper proves, for 0<t<=r_0 Delta_min, T_{C,r_0}(t)=2 m r_0 t + (gamma_C-sum_{i:theta_i<pi} cot(theta_i/2)) t^2. Here gamma_C=1/2 H^1({u on S^1: d_{S^1}(u,K)>=pi/2}), with gamma_C=pi when K is empty. The paper also states the one-dimensional converse: if a monotone wall-fiber cut function delta(a) produces exactly quadratic integral I(t)=integral_0^{r_0} min(t,delta(a)) da near a singular point, then delta(a)=c a locally. We adapt this by estimating empirical tube areas V(t) and penalizing their deviation from a fitted quadratic over radii below an empirical gap scale.
Implementation notes
Integrate this at the output of a designated two-dimensional projection head, immediately before the classification loss. For each minibatch, obtain projected points z_i in R^2 and either a soft class support, or a soft decision-boundary point cloud by selecting samples whose predicted class margin is below a threshold. Use a fixed grid of radii T={t_1,...,t_K}, with t_K no larger than roughly one quarter of the median k-nearest-neighbor distance. Estimate the tube area with a differentiable soft union: V_hat(t)=A_box/N_grid sum_g [1-exp(-sum_i exp(-(||x_g-z_i||^2)/(2 sigma^2))/tau)] over a fixed 2D grid covering the projected data. Alternatively, for a cheaper MVP, use Monte Carlo probe points and the same soft occupancy expression. Fit (a1_hat,a2_hat) by differentiable least squares to the values V_hat(t_k), then add L_tube to cross-entropy. Estimate the minimum gap scale Delta_hat_min from angular gaps between vectors z_i-c around each local high-curvature or low-density center c; stop gradients through this estimate and use it only in the hinge term. The theorem supplies the target degree-two law and the cone coefficient interpretation; the grid estimate, radius range, and gap estimate are empirical approximations. Start with a 2D MLP projection on CIFAR-10 or two-moons, comparing an MLP with cross-entropy against the same model with lambda_tube in {1e-3,1e-2,1e-1}. Measure test accuracy, adversarial accuracy under small input perturbations, margin collapse, and tube-curve residual at held-out radii. The first success signal is lower nonquadratic tube residual and improved robustness at unchanged clean accuracy; reject the method if it merely contracts embeddings or hurts class separation.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.