math.OCJul 15, 2023

Faster Algorithms for Structured Linear and Kernel Support Vector Machines

Authors: Yuzhou Gu, Zhao Song, Lichen Zhang

Organizations: New York University · Simons Institute for the Theory of Computing, UC Berkeley · Massachusetts Institute of Technology

Abstract

Many machine learning problems are quadratic programs, including Support Vector Machines (SVMs). A general quadratic program has input size Θ(n2)Θ(n^2), and assuming the Strong Exponential Time Hypothesis (SETH), no O(n2−o(1))O(n^{2-o(1)}) time algorithm exists when the objective matrix is positive semidefinite (Backurs, Indyk, and Schmidt, NeurIPS'17). SVMs, however, are given by nn data points of dimension dd, often much smaller than nn, and have only O(1)O(1) equality constraints. In this work, we design the first nearly-linear time algorithm for solving quadratic programs whenever a low-rank factorization of the quadratic objective matrix is given, the number of linear constraints is small, the coefficients of the objective and some optimal solution are bounded by poly(n)\mathrm{poly}(n), and some feasible point has all entries between 1/poly(n)1/\mathrm{poly}(n) and poly(n)\mathrm{poly}(n). For linear SVM on dd-dimensional data, our randomized algorithm runs in expected time O~(nd(ω+1)/2log⁡(n/ε))\widetilde O(nd^{(ω+1)/2}\log(n/ε)) when (d+1)ω−1≤n(d+1)^{ω-1}\le n and the data points have norms at most poly(n)\mathrm{poly}(n) and margin at least 1/poly(n)1/\mathrm{poly}(n), where ω<2.258ω<2.258 is the matrix multiplication exponent. Its output satisfies the equality constraint only approximately. For Gaussian kernel SVM, when d=O(log⁡n)d=O(\log n), the squared dataset radius is o(log⁡n/log⁡log⁡n)o(\log n/\log\log n) and the dual variables lie in a box [0,R]n[0,R]^n with R≤poly(n)R\le\mathrm{poly}(n), our randomized algorithm runs in expected time n1+o(1)n^{1+o(1)} for any accuracy ε≥1/poly(n)ε\ge 1/\mathrm{poly}(n). We also prove that, assuming SETH, when the squared dataset radius is Ω(log⁡2n)Ω(\log^2 n), Ω(n2−o(1))Ω(n^{2-o(1)}) time is required on some inputs to reach error exp⁡(−Θ(log⁡2n))\exp(-Θ(\log^2 n)) for the program without the bias term. This improves upon the prior best lower bound in both the dimension dd and the squared dataset radius.

Figures & tables

Explore similar work

CardsList
  1. Sublinear Time Quantum Sensitivity Sampling

    Sep 20, 2025Zhao Song, David P. Woodruff, Lichen ZhangCoreset SelectionLow-Rank Approximation

  2. Revisited Support Vector Machines: A Unified Joint Optimization Framework with Nyström Approximation for Scalable Adaptive Learning

    Oct 11, 2026Nassou Gongon Benjamin, Noulapeu Ngaffo, Patrick Njionou SadjangNyström MethodSupport Vector Machines