Beats tuned baseline
2026
Minkowski-Additive Convex Latents
Store a convex object as a direction-indexed vertex tuple and implement composition of objects through componentwise Minkowski addition and nonnegative scaling. This creates a structured residual or compositional layer where convexification is nonexpansive, making perturbation amplification controllable and avoiding repeated generic geometric optimization.
Paper: Galerkin approximations to the space of convex bodies by polytopes in nondegenerate V-representation
arXiv:2608.26615