English
Related papers

Related papers: The White-Box Adversarial Data Stream Model

200 papers

We study streaming algorithms in the white-box adversarial stream model, where the internal state of the streaming algorithm is revealed to an adversary who adaptively generates the stream updates, but the algorithm obtains fresh randomness…

Data Structures and Algorithms · Computer Science 2023-07-10 Ying Feng , David P. Woodruff

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…

Data Structures and Algorithms · Computer Science 2022-07-04 Omri Ben-Eliezer , Rajesh Jayaram , David P. Woodruff , Eylon Yogev

In the adversarially robust streaming model, a stream of elements is presented to an algorithm and is allowed to depend on the output of the algorithm at earlier times during the stream. In the classic insertion-only model of data streams,…

Data Structures and Algorithms · Computer Science 2022-10-24 David P. Woodruff , Samson Zhou

Robust streaming, the study of streaming algorithms that provably work when the stream is generated by an adaptive adversary, has seen tremendous progress in recent years. However, fundamental barriers remain: the best known algorithm for…

Data Structures and Algorithms · Computer Science 2025-11-04 Omri Ben-Eliezer , Krzysztof Onak , Sandeep Silwal

In this paper, we study streaming and online algorithms in the context of randomness in the input. For several problems, a random order of the input sequence---as opposed to the worst-case order---appears to be a necessary evil in order to…

Data Structures and Algorithms · Computer Science 2020-04-28 Paritosh Garg , Sagar Kale , Lars Rohwedder , Ola Svensson

Recently, the question of adversarially robust streaming, where the stream is allowed to depend on the randomness of the streaming algorithm, has gained a lot of attention. In this work, we consider a strong white-box adversarial model…

Data Structures and Algorithms · Computer Science 2024-06-12 Ying Feng , Aayush Jain , David P. Woodruff

Many problems on data streams have been studied at two extremes of difficulty: either allowing randomized algorithms, in the static setting (where they should err with bounded probability on the worst case stream); or when only…

Data Structures and Algorithms · Computer Science 2022-11-11 Manuel Stoeckl

Streaming algorithms are typically analyzed in the oblivious setting, where we assume that the input stream is fixed in advance. Recently, there is a growing interest in designing adversarially robust streaming algorithms that must maintain…

Data Structures and Algorithms · Computer Science 2023-01-24 Menachem Sadigurschi , Moshe Shechner , Uri Stemmer

A streaming algorithm is adversarially robust if it is guaranteed to perform correctly even in the presence of an adaptive adversary. Recently, several sophisticated frameworks for robustification of classical streaming algorithms have been…

Data Structures and Algorithms · Computer Science 2021-09-09 Omri Ben-Eliezer , Talya Eden , Krzysztof Onak

In the adversarial streaming model, the input is a sequence of adaptive updates that defines an underlying dataset and the goal is to approximate, collect, or compute some statistic while using space sublinear in the size of the dataset. In…

Data Structures and Algorithms · Computer Science 2024-12-10 David P. Woodruff , Samson Zhou

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…

Machine Learning · Computer Science 2021-10-27 Vladimir Braverman , Avinatan Hassidim , Yossi Matias , Mariano Schain , Sandeep Silwal , Samson Zhou

We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder et al. (FOCS'12) and Censor-Hillel et al. (ALGOSENSORS'17), we…

Data Structures and Algorithms · Computer Science 2024-12-02 Raghuvansh R. Saxena , Noah G. Singer , Madhu Sudan , Santhoshini Velusamy

Classical streaming algorithms operate under the (not always reasonable) assumption that the input stream is fixed in advance. Recently, there is a growing interest in designing robust streaming algorithms that provide provable guarantees…

Data Structures and Algorithms · Computer Science 2022-09-27 Idan Attias , Edith Cohen , Moshe Shechner , Uri Stemmer

This paper studies the adversarial-robustness of importance-sampling (aka sensitivity sampling); a useful algorithmic technique that samples elements with probabilities proportional to some measure of their importance. A streaming or online…

Data Structures and Algorithms · Computer Science 2025-12-11 Yotam Kenneth-Mordoch , Shay Sapir

Many streaming algorithms provide only a high-probability relative approximation. These two relaxations, of allowing approximation and randomization, seem necessary -- for many streaming problems, both relaxations must be employed…

Data Structures and Algorithms · Computer Science 2023-05-16 Vladimir Braverman , Robert Krauthgamer , Aditya Krishnan , Shay Sapir

A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously, by an adaptive adversary. We establish a connection between adversarial robustness of…

Data Structures and Algorithms · Computer Science 2020-04-14 Avinatan Hassidim , Haim Kaplan , Yishay Mansour , Yossi Matias , Uri Stemmer

In this paper, we study streaming algorithms that minimize the number of changes made to their internal state (i.e., memory contents). While the design of streaming algorithms typically focuses on minimizing space and update time, these…

Data Structures and Algorithms · Computer Science 2024-06-12 Rajesh Jayaram , David P. Woodruff , Samson Zhou

Adversarial attacks expose important vulnerabilities of deep learning models, yet little attention has been paid to settings where data arrives as a stream. In this paper, we formalize the online adversarial attack problem, emphasizing two…

In many machine learning applications, it is important to explain the predictions of a black-box classifier. For example, why does a deep neural network assign an image to a particular class? We cast interpretability of black-box…

Machine Learning · Statistics 2017-11-27 Ethan R. Elenberg , Alexandros G. Dimakis , Moran Feldman , Amin Karbasi

We study the problem of attacking video recognition models in the black-box setting, where the model information is unknown and the adversary can only make queries to detect the predicted top-1 class and its probability. Compared with the…

Computer Vision and Pattern Recognition · Computer Science 2019-11-22 Zhipeng Wei , Jingjing Chen , Xingxing Wei , Linxi Jiang , Tat-Seng Chua , Fengfeng Zhou , Yu-Gang Jiang
‹ Prev 1 2 3 10 Next ›