Fetching the paper…
Reading the bibliography…
In this paper, we introduce adversarially robust streaming algorithms for central machine learning and algorithmic tasks, such as regression and clustering, as well as their more general counterparts, subspace embedding, low-rank approximation, and coreset construction.
On tail probabilities for martingales
David A. Freedman · 1975
Earlier work this paper cites.
Finding repeated elements
Jayadev Misra and David Gries · 1982
Earlier work this paper cites.
Approximating s-t minimum cuts in Õ ( n 2 {}^{\mbox{2}} ) time
András A. Benczúr and David R. Karger · 1996
Earlier work this paper cites.
Sampling algorithms: Lower bounds and applications
Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar · 2001
Earlier work this paper cites.
Maintaining stream statistics over sliding windows
Mayur Datar, Aristides Gionis, Piotr Indyk, and Rajeev Motwani · 2002
Earlier work this paper cites.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2008
Earlier work this paper cites.
Graph sparsification in the semi-streaming model
Kook Jin Ahn and Sudipto Guha · 2009
Earlier work this paper cites.
Coresets and sketches for high dimensional subspace approximation problems
Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P. Woodruff · 2010
Earlier work this paper cites.
Graph sparsification via refinement sampling
Ashish Goel, Michael Kapralov, and Sanjeev Khanna · 2010
Earlier work this paper cites.
Online streaming feature selection
Xindong Wu, Kui Yu, Hao Wang, and Wei Ding · 2010
Earlier work this paper cites.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Earlier work this paper cites.
Local graph sparsification for scalable clustering
Venu Satuluri, Srinivasan Parthasarathy, and Yiye Ruan · 2011
Earlier work this paper cites.
Streamkm++: A clustering algorithm for data streams
Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler · 2012
Earlier work this paper cites.
Sketch algorithms for estimating point queries in nlp
Amit Goyal, Hal Daumé, and Graham Cormode · 2012
Earlier work this paper cites.
A near-linear algorithm for projective clustering integer points
Kasturi R. Varadarajan and Xin Xiao · 2012
Earlier work this paper cites.
On the sensitivity of shape fitting problems
Kasturi R. Varadarajan and Xin Xiao · 2012
Earlier work this paper cites.
How robust are linear sketches to adaptive inputs?
Moritz Hardt and David P. Woodruff · 2013
Earlier work this paper cites.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Earlier work this paper cites.
Explaining and harnessing adversarial examples
Ian J. Goodfellow, Jonathon Shlens, and Christian Szegedy · 2015
Earlier work this paper cites.
The network data repository with interactive graph analytics and visualization
Ryan A. Rossi and Nesreen K. Ahmed · 2015
Earlier work this paper cites.
New frameworks for offline and streaming coreset constructions
Vladimir Braverman, Dan Feldman, and Harry Lang · 2016
Earlier work this paper cites.
Online row sampling
Michael B. Cohen, Cameron Musco, and Jakub W. Pachocki · 2016
Cited alongside, same era.
Frequent directions: Simple and deterministic matrix sketching
Mina Ghashami, Edo Liberty, Jeff M. Phillips, and David P. Woodruff · 2016
Cited alongside, same era.
Coresets for scalable bayesian logistic regression
Jonathan H. Huggins, Trevor Campbell, and Tamara Broderick · 2016
Cited alongside, same era.
One sketch to rule them all: Rethinking network flow monitoring with univmon
Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman · 2016
Cited alongside, same era.
Apache spark: A unified engine for big data processing
Matei Zaharia, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, and Ion Stoica · 2016
Cited alongside, same era.
Apache spark: A unified engine for big data processing
Dynamic streaming spectral sparsification in nearly linear time and space
Michael Kapralov, Navid Nouri, Aaron Sidford, and Jakab Tardos · 2019
Later among the works it cites.
Robustness may be at odds with accuracy
Dimitris Tsipras, Shibani Santurkar, Logan Engstrom, Alexander Turner, and Aleksander Madry · 2019
Later among the works it cites.
Near optimal linear algebra in the online and sliding window models
Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, and Samson Zhou · 2020
Later among the works it cites.
A framework for adversarially robust streaming algorithms
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, and Eylon Yogev · 2020
Later among the works it cites.
The adversarial robustness of sampling
Omri Ben-Eliezer and Eylon Yogev · 2020
Later among the works it cites.
Differentially private release of synthetic graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matei Zaharia, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, and Ion Stoica · 2016
Cited alongside, same era.
Robust submodular maximization: A non-uniform partitioning approach
Ilija Bogunovic, Slobodan Mitrovic, Jonathan Scarlett, and Volkan Cevher · 2017
Cited alongside, same era.
Input sparsity time low-rank approximation via ridge leverage score sampling
Michael B. Cohen, Cameron Musco, and Christopher Musco · 2017
Cited alongside, same era.
Towards evaluating the robustness of neural networks
Nicholas Carlini and David A. Wagner · 2017
Cited alongside, same era.
Practical coreset constructions for machine learning
Olivier Bachem Mario Lucic and Andreas Krause · 2017
Cited alongside, same era.
Streaming robust submodular maximization: A partitioned thresholding approach
Slobodan Mitrovic, Ilija Bogunovic, Ashkan Norouzi-Fard, Jakub Tarnawski, and Volkan Cevher · 2017
Cited alongside, same era.
Synthesizing robust adversarial examples
Anish Athalye, Logan Engstrom, Andrew Ilyas, and Kevin Kwok · 2018
Cited alongside, same era.
Marek Eliás, Michael Kapralov, Janardhan Kulkarni, and Yin Tat Lee · 2020
Later among the works it cites.
Introduction to core-sets: an updated survey
Dan Feldman · 2020
Later among the works it cites.
Adversarially robust streaming algorithms via differential privacy
Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, and Uri Stemmer · 2020
Later among the works it cites.
Coresets for clustering in euclidean spaces: importance sampling is nearly optimal
Lingxiao Huang and Nisheeth K. Vishnoi · 2020
Later among the works it cites.
Github, 2020
Giuliano Oliveira De Macedo · 2020
Later among the works it cites.
River: machine learning for streaming data in python, 2020
Jacob Montiel, Max Halford, Saulo Martiello Mastelini, Geoffrey Bolmier, Raphael Sourty, Robin Vaysse, Adil Zouitine, Heitor Murilo Gomes, Jesse Read, Talel Abdessalem, and Albert Bifet · 2020
Later among the works it cites.
Data-independent neural pruning via coresets
Ben Mussay, Margarita Osadchy, Vladimir Braverman, Samson Zhou, and Dan Feldman · 2020
Later among the works it cites.
Small-gan: Speeding up GAN training using core-sets
Samarth Sinha, Han Zhang, Anirudh Goyal, Yoshua Bengio, Hugo Larochelle, and Augustus Odena · 2020
Later among the works it cites.
On coresets for support vector machines
Murad Tukan, Cenk Baykal, Dan Feldman, and Daniela Rus · 2020
Later among the works it cites.
Tight bounds for adversarially robust streams and sliding windows via difference estimators
David P. Woodruff and Samson Zhou · 2020
Later among the works it cites.
Robust graph representation learning via neural sparsification
Cheng Zheng, Bo Zong, Wei Cheng, Dongjin Song, Jingchao Ni, Wenchao Yu, Haifeng Chen, and Wei Wang · 2020
Later among the works it cites.
Adversarial laws of large numbers and optimal regret in online classification
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, and Eylon Yogev · 2021
Closest in time.
Learning with feature evolvable streams
Bo-Jian Hou, Lijun Zhang, and Zhi-Hua Zhou · 2021
Closest in time.
Separating adaptive streaming from oblivious streaming
Haim Kaplan, Yishay Mansour, Kobbi Nissim, and Uri Stemmer · 2021
Closest in time.
At-the-time and back-in-time persistent sketches
Benwei Shi, Zhuoyue Zhao, Yanqing Peng, Feifei Li, and Jeff M. Phillips · 2021
Closest in time.