@InProceedings{andoni_et_al:LIPIcs.APPROX/RANDOM.2020.50,
author = {Andoni, Alexandr and Burns, Collin and Li, Yi and Mahabadi, Sepideh and Woodruff, David P.},
title = {{Streaming Complexity of SVMs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {50:1--50:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.50},
URN = {urn:nbn:de:0030-drops-126532},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.50},
annote = {Keywords: support vector machine, streaming algorithm, space lower bound, sketching algorithm, point estimation}
}