A Framework for Adversarially Robust Streaming Algorithms

Omri Ben-Eliezer; Rajesh Jayaram; David P. Woodruff; Eylon Yogev

doi:10.1145/3471485.3471488

A Framework for Adversarially Robust Streaming Algorithms

Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm along the stream and can react in an online manner. While deterministic streaming algorithms are inherently robust, many central problems in the streaming literature do not admit sublinear-space deterministic algorithms; on the other hand, classical space-efficient randomized algorithms for these problems are generally not adversarially robust. This raises the natural question of whether there exist efficient adversarially robust (randomized) streaming algorithms for these problems.

Original language	English
Pages (from-to)	6-13
Number of pages	8
Journal	SIGMOD Record
Volume	50
Issue number	1
DOIs	https://doi.org/10.1145/3471485.3471488
State	Published - Mar 2021

Bibliographical note

Publisher Copyright:
© 2021 is held by the owner/author(s).

Funding

The authors wish to thank Arnold Filtser for invaluable feedback. This work was done in part in the Simons Institute for the Theory of Computing. Part of this work was conducted while Omri Ben-Eliezer was at Tel Aviv University. Ra-jesh Jayaram and David P. Woodruff are supported by the Office of Naval Research (ONR) grant N00014-18-1-2562, and the National Science Foundation (NSF) under Grant No. CCF-1815840. Eylon Yogev is funded by the ISF grants 484/18, 1789/19, Len Blavatnik and the Blavatnik Foundation, The Blavatnik Interdisciplinary Cyber Research Center at Tel Aviv University, and The Raymond and Beverly Sackler Post-Doctoral Scholarship.

Funders	Funder number
Blavatnik Foundation
National Science Foundation	CCF-1815840
Office of Naval Research	N00014-18-1-2562
Directorate for Computer and Information Science and Engineering	1815840
Israel Science Foundation	1789/19, 484/18
Tel Aviv University

Access to Document

10.1145/3471485.3471488

Cite this

@article{52cda040862342deb1482df0ed20df50,

title = "A Framework for Adversarially Robust Streaming Algorithms",

abstract = "We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm along the stream and can react in an online manner. While deterministic streaming algorithms are inherently robust, many central problems in the streaming literature do not admit sublinear-space deterministic algorithms; on the other hand, classical space-efficient randomized algorithms for these problems are generally not adversarially robust. This raises the natural question of whether there exist efficient adversarially robust (randomized) streaming algorithms for these problems.",

author = "Omri Ben-Eliezer and Rajesh Jayaram and Woodruff, {David P.} and Eylon Yogev",

note = "Publisher Copyright: {\textcopyright} 2021 is held by the owner/author(s).",

year = "2021",

month = mar,

doi = "10.1145/3471485.3471488",

language = "אנגלית",

volume = "50",

pages = "6--13",

journal = "SIGMOD Record",

issn = "0163-5808",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - A Framework for Adversarially Robust Streaming Algorithms

AU - Ben-Eliezer, Omri

AU - Jayaram, Rajesh

AU - Woodruff, David P.

AU - Yogev, Eylon

PY - 2021/3

Y1 - 2021/3

N2 - We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm along the stream and can react in an online manner. While deterministic streaming algorithms are inherently robust, many central problems in the streaming literature do not admit sublinear-space deterministic algorithms; on the other hand, classical space-efficient randomized algorithms for these problems are generally not adversarially robust. This raises the natural question of whether there exist efficient adversarially robust (randomized) streaming algorithms for these problems.

AB - We investigate the adversarial robustness of streaming algorithms. In this context, an algorithm is considered robust if its performance guarantees hold even if the stream is chosen adaptively by an adversary that observes the outputs of the algorithm along the stream and can react in an online manner. While deterministic streaming algorithms are inherently robust, many central problems in the streaming literature do not admit sublinear-space deterministic algorithms; on the other hand, classical space-efficient randomized algorithms for these problems are generally not adversarially robust. This raises the natural question of whether there exist efficient adversarially robust (randomized) streaming algorithms for these problems.

UR - http://www.scopus.com/inward/record.url?scp=85108234919&partnerID=8YFLogxK

U2 - 10.1145/3471485.3471488

DO - 10.1145/3471485.3471488

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85108234919

SN - 0163-5808

VL - 50

SP - 6

EP - 13

JO - SIGMOD Record

JF - SIGMOD Record

IS - 1

ER -

A Framework for Adversarially Robust Streaming Algorithms

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this