Streaming Complexity of SVMs

DOI10.4230/LIPICS.APPROX/RANDOM.2020.50arXiv2007.03633OpenAlexW3082113888MaRDI QIDQ6084413

Yi Li, Sepideh Mahabadi, David P. Woodruff, Unnamed Author, Alexandr Andoni

Publication date: 31 October 2023

Full work available at URL: https://arxiv.org/abs/2007.03633

zbMATH Keywords

point estimationsupport vector machinestreaming algorithmspace lower boundsketching algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
• Tight Bounds for the Subspace Sketch Problem with Applications
• Understanding Machine Learning

This page was built for publication: Streaming Complexity of SVMs