← 研踪 PaperTrailarXiv:2307.07735 · v4
Faster Algorithms for Structured Linear and Kernel Support Vector Machines
首次提交 2023-07-15 15:19
版本更新 2026-11-16 11:38
雷达观测 2026-11-17 17:12
摘要
Many machine learning problems are quadratic programs, including Support Vector Machines (SVMs). A general quadratic program has input size , and assuming the Strong Exponential Time Hypothesis (SETH), no time algorithm exists when the objective matrix is positive semidefinite (Backurs, Indyk, and Schmidt, NeurIPS'17). SVMs, however, are given by data points of dimension , often much smaller than , and have only 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 , and some feasible point has all entries between and . For linear SVM on -dimensional data, our randomized algorithm runs in expected time when and the data points have norms at most and margin at least , where is the matrix multiplication exponent. Its output satisfies the equality constraint only approximately. For Gaussian kernel SVM, when , the squared dataset radius is and the dual variables lie in a box with , our randomized algorithm runs in expected time for any accuracy . We also prove that, assuming SETH, when the squared dataset radius is , time is required on some inputs to reach error for the program without the bias term. This improves upon the prior best lower bound in both the dimension and the squared dataset radius.
作者备注:ICLR 2025. This version corrects the Gaussian kernel result, which needs accuracy at least $1/\mathrm{poly}(n)$, and the comparison with the lower bound of Backurs, Indyk and Schmidt. Abstract shortened to meet arxiv requirement
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v4 · 2026-11-16 11:38 · 最新观测版本
Faster Algorithms for Structured Linear and Kernel Support Vector Machines
Many machine learning problems are quadratic programs, including Support Vector Machines (SVMs). A general quadratic program has input size , and assuming the Strong Exponential Time Hypothesis (SETH), no time algorithm exists when the objective matrix is positive semidefinite (Backurs, Indyk, and Schmidt, NeurIPS'17). SVMs, however, are given by data points of dimension , often much smaller than , and have only 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 , and some feasible point has all entries between and . For linear SVM on -dimensional data, our randomized algorithm runs in expected time when and the data points have norms at most and margin at least , where is the matrix multiplication exponent. Its output satisfies the equality constraint only approximately. For Gaussian kernel SVM, when , the squared dataset radius is and the dual variables lie in a box with , our randomized algorithm runs in expected time for any accuracy . We also prove that, assuming SETH, when the squared dataset radius is , time is required on some inputs to reach error for the program without the bias term. This improves upon the prior best lower bound in both the dimension and the squared dataset radius.
查看此版本解读 →查看此版本原文 ↗