Saved in:
Bibliographic Details
Main Authors: Blanco, Víctor, Kothari, Harshit, Luedtke, James
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.05047
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918155158290432
author Blanco, Víctor
Kothari, Harshit
Luedtke, James
author_facet Blanco, Víctor
Kothari, Harshit
Luedtke, James
contents In this paper, we propose a new mathematical optimization model for multiclass classification based on arrangements of hyperplanes. Our approach preserves the core support vector machine (SVM) paradigm of maximizing class separation while minimizing misclassification errors, and it is computationally more efficient than a previous formulation. We present a kernel-based extension that allows it to construct nonlinear decision boundaries. Furthermore, we show how the framework can naturally incorporate alternative geometric structures, including classification trees, $\ell_p$-SVMs, and models with discrete feature selection. To address large-scale instances, we develop a dynamic clustering matheuristic that leverages the proposed MIP formulation. Extensive computational experiments demonstrate the efficiency of the proposed model and dynamic clustering heuristic, and we report competitive classification performance on both synthetic datasets and real-world benchmarks from the UCI Machine Learning Repository, comparing our method with state-of-the-art implementations available in scikit-learn.
format Preprint
id arxiv_https___arxiv_org_abs_2510_05047
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements
Blanco, Víctor
Kothari, Harshit
Luedtke, James
Optimization and Control
Machine Learning
In this paper, we propose a new mathematical optimization model for multiclass classification based on arrangements of hyperplanes. Our approach preserves the core support vector machine (SVM) paradigm of maximizing class separation while minimizing misclassification errors, and it is computationally more efficient than a previous formulation. We present a kernel-based extension that allows it to construct nonlinear decision boundaries. Furthermore, we show how the framework can naturally incorporate alternative geometric structures, including classification trees, $\ell_p$-SVMs, and models with discrete feature selection. To address large-scale instances, we develop a dynamic clustering matheuristic that leverages the proposed MIP formulation. Extensive computational experiments demonstrate the efficiency of the proposed model and dynamic clustering heuristic, and we report competitive classification performance on both synthetic datasets and real-world benchmarks from the UCI Machine Learning Repository, comparing our method with state-of-the-art implementations available in scikit-learn.
title A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements
topic Optimization and Control
Machine Learning
url https://arxiv.org/abs/2510.05047