mlsanityData to 14 Oct 2026

Modeling high dimensional point clouds with the spherical cluster model

arXiv 2512.21960 ↗First posted 26 Dec 2025stat.ME cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A parametric cluster model is a statistical model providing geometric insights onto the points defining a cluster. The em spherical cluster model (SC) approximates a finite point set Psubset ℝd by a sphere S(c,r) as follows. Taking r as a fraction η∈(0,1) (hyper-parameter) of the std deviation of distances between the center c and the data points, the cost of the SC model is the sum over all data points lying outside the sphere S of their power distance with respect to S. The center c of the SC model is the point minimizing this cost. Note that η=0 yields the celebrated center of mass used in KMeans clustering. We make three contributions. First, we show fitting a spherical cluster yields a strictly convex but not smooth combinatorial optimization problem. Second, we present an exact solver using the Clarke gradient on a suitable stratified cell complex defined from an arrangement of hyper-spheres. Finally, we present experiments on a variety of datasets ranging in dimension from d=9 to d=10,000, with two main observations. First, the exact algorithm is orders of magnitude faster than BFGS based heuristics for datasets of small/intermediate dimension and small values of η, and for high dimensional datasets (say d>100) whatever the value of η. Second, the center of the SC model behave as a parameterized high-dimensional median. The SC model is of direct interest for high dimensional multivariate data analysis, and the application to the design of mixtures of SC will be reported in a companion paper.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 43 references that are in the map. First posted on arXiv 26 Dec 2025.

Builds on

7 of 43 references.

References · 7

  1. 2014Convex Optimization: Algorithms and Complexitycited by 575
  2. 2016Geometric Median in Nearly Linear Timecited by 39
  3. 2018On Geometric Analysis of Affine Sparse Subspace Clusteringcited by 12
  4. 2021A Gradient Sampling Algorithm for Stratified Maps with Applications to Topological Data Analysiscited by 5
  5. 2023Global convergence of the gradient method for functions definable in o-minimal structurescited by 5
  6. 2015Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributionscited by 2
  7. 2025Improved seeding strategies for k-means and k-GMMcited by 1

Built on by

Not cited yet.