Ellipsoidal Separation Machine

• ESM is a binary classifier that uses a bounded ellipsoid to separate classes by ensuring any segment connecting opposites intersects the ellipsoid.
• It reformulates separation as a semidefinite program, optimizing the ellipsoid size while using geometric scoring for classification with rejection.
• ESM offers robust performance in ambiguous settings through an intrinsic abstention mechanism, though it requires more complex optimization than SVM.

Searching arXiv for the named topic and closely related usages of “ESM”. The Ellipsoidal Separation Machine (ESM) is a binary classifier derived from Separation by a Convex Body (SCB): instead of separating two classes with a hyperplane, it separates them with an ellipsoid. In its canonical formulation, the separator is a bounded convex set chosen so that the segment joining a positive point and a negative point intersects the ellipsoid. The training problem is structurally similar to the Support Vector Machine (SVM) one, is convex, and can be formulated as a Semidefinite Program (SDP); the practical contribution is a full implementation that replaces the intractable large-scale SDP with smaller optimization subproblems and approximate solvers. A defining property of ESM is that it necessarily creates indeterminate points, making it particularly suited to Classification with Rejection (CwR) (Frangioni et al., 28 Jul 2025).

1. Separation by a convex body and the emergence of ESM

ESM instantiates the SCB principle with an ellipsoid. In SCB, a set $\mathcal S$ separates a positive point $x^+$ and a negative point $x^-$ if

$$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$

For two sets $X^+$ and $X^-$, the SCB requirement is imposed for all cross-class pairs. ESM chooses $\mathcal S$ to be an ellipsoid because ellipsoids admit semidefinite representations and therefore connect the geometry of bounded convex separators to tractable convex optimization (Frangioni et al., 28 Jul 2025).

The resulting construction differs fundamentally from hyperplane-based classification. A hyperplane extends unboundedly and assigns every point to one side or the other. An ellipsoid is bounded and local. This changes the semantics of classification: the ellipsoid is not merely a decision surface, but a geometric object that certifies cross-class separation through segment intersection. The 2025 formulation is presented as the first fully functional implementation of the SCB approach for classification with an ellipsoid, thereby turning an earlier convex-geometric idea into a workable training and inference pipeline (Frangioni et al., 28 Jul 2025).

2. Ellipsoidal geometry, scores, and the decision rule

The separator is an ellipsoid

$$\mathcal S=\{x\in\mathbb R^n:(x-\gamma)^\top S(x-\gamma)\le 1\},$$

with $S\succeq 0$ symmetric positive semidefinite and $\gamma\in\mathbb R^n$ the center. The eigenstructure of $x^+$0 determines the axes and shape of the ellipsoid. In the training objective, smaller ellipsoids are preferred, but the ellipsoid must still separate the two classes in the SCB sense (Frangioni et al., 28 Jul 2025).

A distinctive aspect of ESM is that points inside the ellipsoid are removed from the reliable reference sets: $x^+$1 For an unlabeled point $x^+$2, ESM counts how many segments from $x^+$3 to training points of each class intersect the ellipsoid: $x^+$4

$x^+$5

These counts define normalized scores

$x^+$6

with $x^+$7. The classification rule is thresholded by $x^+$8: if $x^+$9, assign $x^-$0; if $x^-$1, assign $x^-$2; otherwise the point is rejected or declared indeterminate (Frangioni et al., 28 Jul 2025).

This decision rule yields a geometry that differs sharply from SVM. In ESM, indeterminacy is not just a narrow strip around a local boundary. It can include points inside $x^-$3, points very far from both classes, and points similarly separated from both classes. In the formulation described for ESM, a point inside the ellipsoid typically satisfies $x^-$4, which directly exhibits the abstention mechanism (Frangioni et al., 28 Jul 2025).

3. Training problem, convex reformulations, and scalable optimization

The naive training model minimizes an ellipsoid size functional under the requirement that every cross-class segment intersects the ellipsoid. With $x^-$5 and interpolation points

$x^-$6

one writes

$x^-$7

subject to

$x^-$8

To handle nonseparable data, ESM introduces slack variables and regularization: $x^-$9 where $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$0 penalizes violated cross-segment intersection constraints and $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$1 penalize training points that fall inside the ellipsoid. The size term is written either as $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$2 or, in an auxiliary SDP representation, as $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$3 (Frangioni et al., 28 Jul 2025).

The central technical difficulty is bilinearity: $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$4 couples with $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$5, and the points $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$6 couple with $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$7 because they depend on $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$8. The paper resolves this through a homogeneous ellipsoid reformulation in $$\operatorname{conv}(\{x^+,x^-\}) \cap \mathcal S \neq \emptyset.$$9,

$X^+$0

with normalization $X^+$1, so that ellipsoid membership is encoded by

$X^+$2

This removes the explicit center $X^+$3 and enables a convex SDP reformulation via auxiliary variables and Schur-complement-type constraints (Frangioni et al., 28 Jul 2025).

The full convex SDP remains expensive because there is one constraint for each pair $X^+$4, the matrix variables live in dimension $X^+$5, and volume-related terms such as $X^+$6 add complexity. The practical solver therefore uses a nonconvex reformulation amenable to a Block-Gauss-Seidel approach alternating between a much smaller SDP and a simple separable Second-Order Cone Program (SOCP). Even the reduced SDP is further relaxed in a Lagrangian way, and the multipliers are updated by fast subgradient-type approaches. In the classification setting, this sacrifices exact optimality for speed while preserving the basic ellipsoidal-separation structure (Frangioni et al., 28 Jul 2025).

4. Classification with rejection and the role of indeterminate points

The reject option is not an auxiliary add-on to ESM; it is intrinsic to the geometry of the model. The ellipsoid defines a bounded separator, and the score construction only yields a class assignment when the evidence is sufficiently asymmetric. Hence ESM necessarily defines indeterminate points, namely points that cannot be reliably classified as belonging to either set (Frangioni et al., 28 Jul 2025).

This makes ESM particularly suitable for Classification with Rejection. In margin-based SVM rejection, abstention is usually implemented by rejecting points close to the separating hyperplane. ESM behaves differently. Its rejection is geometric and global: a point may be rejected because it lies inside the ellipsoid, because it is similarly separated from both classes, or because it is far from the data region and thus not convincingly associated with either side. This suggests a notion of abstention tied to insufficient evidence rather than merely to small local margin (Frangioni et al., 28 Jul 2025).

The practical significance is application-dependent. The formulation identifies ESM as especially attractive when false positives are costly, abstention is valuable, outlier detection matters, or a bounded separator is more appropriate than a hyperplane. The same geometry that yields indeterminacy also differentiates ESM from reparameterized SVM variants: the paper explicitly emphasizes that ESM’s rejection zone behaves quite differently from SVM margins (Frangioni et al., 28 Jul 2025).

5. Empirical behavior and comparison with SVM

The reported evaluation uses both synthetic and real binary datasets. The synthetic experiments are generated with make_classification. The real datasets are taken from the LIBSVM repository: Australian, Breast, Diabetes, Fertility, Heart, Ionosphere, and Liver. Performance is reported with the metrics AR (accuracy with rejection), A (accuracy on classified points), WC (percentage well classified), MC (percentage misclassified), and R (rejection rate). The AR score is

$X^+$7

with rejection cost $X^+$8 (Frangioni et al., 28 Jul 2025).

The baseline comparison is against SVM with polynomial, Gaussian/RBF, and sigmoid kernels, where rejected points are those inside the SVM margin. The empirical conclusions are stated qualitatively rather than as a single universal ranking. ESM is generally competitive with the best SVM variant. On synthetic datasets, it often behaves similarly to sigmoid SVM and tends to reject fewer points than polynomial or Gaussian SVM. On the real datasets, it often trades blows with the best kernel choice and sometimes achieves the best AR. The paper therefore presents ESM as a genuinely different model rather than a mere reformulation of existing margin-based classifiers (Frangioni et al., 28 Jul 2025).

The same experiments also expose the main limitations. Training is more complex than SVM, the full convex formulation does not scale well, and practical use requires hyperparameter tuning over several constants. The classification rule is also more elaborate than the sign of a hyperplane. These limitations are structural consequences of replacing a linear separator with a bounded convex body and of insisting on a principled abstention region (Frangioni et al., 28 Jul 2025).

6. Related uses of ellipsoidal separation and ambiguity of the acronym

The term ESM is not unique to the classifier defined in 2025. In adjacent literatures, “separator,” “ellipse,” “ellipsoid,” and even the acronym “ESM” are used in technically distinct senses.

Usage	Domain	Distinction
Ellipsoidal Separation Machine	Classification	Ellipsoid-based SCB classifier with indeterminate points (Frangioni et al., 28 Jul 2025)
Optimal separator for an ellipse; Application to localization	Interval analysis	Minimal contractor and minimal separator for a planar ellipse, not a machine-learning separator (Jaulin, 2023)
ESM data	Surveillance	“ESM” means Electronic Support Measures, not ellipsoidal classification (Taghavi et al., 2016)

The interval-analysis work on planar ellipses develops a minimal contractor and minimal separator for an ellipse in the plane, exploits the hyperoctahedral group of symmetries, and applies the construction to guaranteed localization with multiple sonars. Its separator is a set-valued operator yielding inner and outer approximations of a feasible set; it is explicitly not a machine-learning separator and is firmly in validated interval set inversion (Jaulin, 2023).

A different but conceptually adjacent line appears in nonlinear predictive control for obstacle avoidance, where vehicle and obstacles are modeled as convex superellipsoids and collision avoidance is encoded through the separating hyperplane theorem, support functions, and a separating axis constrained inside an NMPC problem. This is naturally viewed as an ESM-style separation problem embedded in predictive control, but it is a control formulation rather than a classifier (Moran et al., 2024).

Further afield, an elliptically wound microfluidic device has been described as ESM-like because a periodically varying curvature drives bifurcations in inertial particle equilibria, producing longitudinal clustering and size-based separation along the duct (Selvan et al., 11 Jun 2026). A plausible conceptual relation also exists to HYPERION, a transmitted-THz blind source-separation method that uses the Löwner–John ellipsoid as a geometric preconditioner so that source signatures become vertices of a regular simplex in the preconditioned space (Lin et al., 2021). These neighboring usages share ellipsoidal geometry, but they are not the same object as the Ellipsoidal Separation Machine in binary classification.

In the strict sense established by the classification paper, the Ellipsoidal Separation Machine is therefore a specific SCB-based model: an ellipsoid is optimized so that opposite-class segments intersect it, prediction is made through segment-intersection counts, and rejection is intrinsic rather than heuristic (Frangioni et al., 28 Jul 2025).