Floating-Body Robust Embedding Core
Implementation & benchmark of arXiv:2607.02400 — From Ham-Sandwich to Centerpoints: Semialgebraic Algorithms for Cutting Polytopal Measures
Source paper: From Ham-Sandwich to Centerpoints: Semialgebraic Algorithms for Cutting Polytopal Measures arXiv:2607.02400 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
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.
Formulas
Mathematical statement
For a convex polytope P\subset\mathbb R^d, define C_P(u,t)=\operatorname{vol}(P\cap\{x:u^{\mathsf T}x\le t\}). The floating body at level \alpha is the intersection of all halfspaces that remain after removing every cap of volume at most \alpha\operatorname{vol}(P): F_\alpha(P)=\bigcap_{C_P(u,t)\le\alpha\operatorname{vol}(P)}\{x\in P:u^{\mathsf T}x\ge t\}, with both orientations u included. The paper states that the centerpoint set of a convex polytope equals the floating body at level \alpha=1/(d+1). Thus any c\in F_{1/(d+1)}(P) has the depth guarantee that every halfspace containing c retains at least 1/(d+1) of the measure. For finite neural embeddings, estimate the cap thresholds t_\alpha(u) from a convex hull or robust polytope approximation and penalize embeddings or prototypes lying outside the sampled halfspace intersection.
Implementation notes
Attach the method to class prototypes or domain centroids in a representation-learning model. Project each embedding h\in\mathbb R^D to x=Wh\in\mathbb R^d with d=2 or 3, and maintain a reservoir of projected embeddings per class. Approximate each cloud by its convex hull; for an MVP, use a box or an ellipsoid, while the full method uses a polygon or polyhedron. Sample 64--256 directions u, including hull facet normals and random unit vectors. For each u, find t_alpha(u) by bisection so that C_P(u,t_alpha)=alpha vol(P), computing cap volumes by clipping the polygon or polyhedron. Represent the estimated floating body by inequalities u^T c\ge t_alpha(u). Obtain the prototype c by minimizing ||c-mean(P)||^2 subject to these inequalities, or use the displayed hinge penalty with detached thresholds. Use alpha=1/(d+1) as the centerpoint-inspired default; sweep nearby values for robustness. Update the geometry every 100--1000 steps rather than every batch. The paper determines the depth criterion and cap construction; finite reservoirs, direction sampling, and differentiable surrogates are empirical approximations. First test a small ResNet on CIFAR-10 with 2D projection heads, comparing ordinary means, coordinate-trimmed means, and geometric medians. Add 5--20% one-sided outliers or corrupted augmentations. Measure clean and corrupted accuracy, prototype drift, and training stability. Success is improved corrupted accuracy with clean accuracy within 0.2 percentage points of the mean-prototype baseline.
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.