arXiv:2607. 17282v1 Announce Type: new Abstract: Given a binary-labeled linearly separable dataset, and the objective is to compute the maximum-margin separating hyperplane, also known as the hard-margin Support Vector Machine (SVM) classifier.
arXiv:2606. 05814v1 Announce Type: new Abstract: The support vector machine (SVM) is a widely used classifier, but choosing an appropriate loss function remains difficult.
arXiv:2606. 08721v1 Announce Type: new Abstract: Modern neural classifiers commonly rely on linear readouts, yet predictive metrics alone do not characterize the class-wise geometry of the representations on which such readouts operate.
arXiv:2506. 10775v3 Announce Type: replace Abstract: In monotone classification, the input is a multi-set $P$ of points in $\mathbb{R}^d$, each associated with a hidden label from $\{-1, 1\}$.
arXiv:2608. 00949v1 Announce Type: new Abstract: The pinball-loss support vector machine is robust, but its asymmetry parameter is usually fixed in advance.
The paper investigates minimal‑norm interpolation and λ2‑regularized logistic‑loss minimization for binary classification using univariate two‑layer ReLU networks. It provides exact geometric characterizations of optimal classifiers, showing that unpenalized hidden‑layer biases yield continuous piecewise‑affine functions that tightly follow label switches, while penalized biases produce a unique, sparsest classifier with a single kink per same‑label segment. Adding a free affine skip connection does not change these function‑space solutions but guarantees that every KKT point becomes globally optimal, eliminating suboptimal KKT points that can arise without the skip connection.
arXiv:2606. 08993v1 Announce Type: new Abstract: We propose LEAF, a learning-enabled ADMM framework for accelerated convex optimization.
arXiv:2609. 17845v1 Announce Type: cross Abstract: Let the exact homogeneous hard-margin support vector machine be trained on \(m\) independent observations from a Borel probability law on a real Hilbert space.
arXiv:2608. 11567v1 Announce Type: new Abstract: In real-world scenarios, the training data usually contains redundant features, label noise and feature noise, which provide severe challenges for the efficiency of machine learning methods.
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
arXiv:2607. 14889v1 Announce Type: new Abstract: This paper studies an optimal linear combination of binary classifiers based on a logical structuration of the dataset via truth tables.
The paper presents a unified taxonomy that classifies machine‑learning and artificial‑intelligence applications according to mathematical programming paradigms such as linear, quadratic, mixed‑integer, conic, bilevel, and others. It standardizes notation, identifies key inputs, decision variables, and principal formulations for each application, and discusses structural properties, solution strategies, and limitations. The authors compare tractability, relaxation quality, decomposition, approximation guarantees, and scalability across paradigms, emphasizing that mathematical programming serves as a disciplined interface between predictions and constrained decisions rather than a universal modeling claim.
arXiv:2608. 06860v1 Announce Type: cross Abstract: Hyperdimensional computing (HDC) is an approach from the cognitive science literature for solving information processing tasks using data represented as high-dimensional random vectors.