Abstract We introduce a class of random polytopes which simultaneously generalizes several known constructions. While being fairly general, these polytopes are also computationally exceptionally benign. We indicate how these properties can be exploited for classification and clustering tasks in data analysis. Crucially, our construction lets users smoothly trade off between a tighter description of the data and faster computation.
Explore similar work May 28, 2026 · Yiran Wang, Guido Montúfar Triangulations Polytopes
Jul 3, 2026 · Matthijs Ebbens, Jie Lu, Alexander Munteanu Dimensionality Reduction Curves
Jul 5, 2026 · Ishani Karmarkar, Liam O'Carroll, Aaron Sidford Binary Classification Parallel
May 28, 2026 · cs.LG J/K move · Enter open · S save
Yiran Wang, Guido Montúfar
UCLA · MPI MiS
We introduce TriSearch, a reinforcement learning framework for optimizing objectives over triangulations of a polytope via bistellar flips. The key idea is a circuit-supported subtriangulation action representation: feasible flips are encoded by their supporting circuit and realized local subtriangulation, enabling a learned policy to rank them using local geometric and combinatorial features. This yields a dimension-agnostic interface and enables efficient traversal of the flip graph without explicit enumeration of the full triangulation space. Instantiated in 3D and 4D, TriSearch generalizes zero-shot from small training instances to larger polytopes with exponentially larger search spaces. It achieves top performance on metric objectives in 3D and, in 4D, discovers more distinct Fine, Regular, Star triangulations of reflexive polytopes, corresponding to Calabi-Yau threefolds, than existing samplers under a fixed budget.