mlsanityData to 14 Oct 2026

On Linear Separability of the MNIST Handwritten Digits Dataset

arXiv 2603.12850 ↗First posted 13 Mar 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

The MNIST dataset containing thousands of handwritten digit images is still a fundamental benchmark for evaluating various pattern-recognition and image-classification models. Linear separability is a key concept in many statistical and machine-learning techniques. Despite the long history of the MNIST dataset and its relative simplicity in size and resolution, the question of whether the dataset is linearly separable has never been fully answered -- scientific and informal sources share conflicting claims. This paper aims to provide a comprehensive empirical investigation to address this question, distinguishing pairwise and one-vs-rest separation of the training, the test and the combined sets, respectively. It reviews the theoretical approaches to assessing linear separability, alongside state-of-the-art methods and tools, then systematically examines all relevant assemblies, and reports the findings.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 25 references that are in the map. First posted on arXiv 13 Mar 2026.

Builds on

8 of 25 references.

References · 8

  1. 2021Convex optimizationcited by 2,515
  2. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
  3. 2017A Rewriting System for Convex Optimization Problemscited by 179
  4. 2024Clarabel: An interior-point solver for conic programs with quadratic objectivescited by 44
  5. 2020An Ensemble of Simple Convolutional Neural Network Models for MNIST Digit Recognitioncited by 30
  6. 2023A Perceptron-based Fine Approximation Technique for Linear Separationcited by 2
  7. 2017A faster dual algorithm for the Euclidean minimum covering ball problemcited by 1
  8. 2020Binary Classification as a Phase Separation Processcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.