Fully dynamic submodular maximization over matroids

P Dütting, F Fusco, S Lattanzi… - International …, 2023 - proceedings.mlr.press
Maximizing monotone submodular functions under a matroid constraint is a classic
algorithmic problem with multiple applications in data mining and machine learning. We …

Tight bounds for adversarially robust streams and sliding windows via difference estimators

DP Woodruff, S Zhou - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
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 …

Adversarial robustness of streaming algorithms through importance sampling

V Braverman, A Hassidim, Y Matias… - Advances in …, 2021 - proceedings.neurips.cc
Robustness against adversarial attacks has recently been at the forefront of algorithmic
design for machine learning tasks. In the adversarial streaming model, an adversary gives …

The white-box adversarial data stream model

M Ajtai, V Braverman, TS Jayram, S Silwal… - Proceedings of the 41st …, 2022 - dl.acm.org
There has been a flurry of recent literature studying streaming algorithms for which the input
stream is chosen adaptively by a black-box adversary who observes the output of the …

When are non-parametric methods robust?

R Bhattacharjee, K Chaudhuri - International Conference on …, 2020 - proceedings.mlr.press
A growing body of research has shown that many classifiers are susceptible to adversarial
examples–small strategic modifications to test inputs that lead to misclassification. In this …

Streaming algorithms for learning with experts: Deterministic versus robust

DP Woodruff, F Zhang, S Zhou - arXiv preprint arXiv:2303.01709, 2023 - arxiv.org
In the online learning with experts problem, an algorithm must make a prediction about an
outcome on each of $ T $ days (or times), given a set of $ n $ experts who make predictions …

Deletion robust submodular maximization over matroids

P Dütting, F Fusco, S Lattanzi… - International …, 2022 - proceedings.mlr.press
Maximizing a monotone submodular function is a fundamental task in machine learning. In
this paper we study the deletion robust version of the problem under the classic matroids …

Robust Spatiotemporal Traffic Forecasting with Reinforced Dynamic Adversarial Training

F Liu, W Zhang, H Liu - Proceedings of the 29th ACM SIGKDD …, 2023 - dl.acm.org
Machine learning-based forecasting models are commonly used in Intelligent Transportation
Systems (ITS) to predict traffic patterns and provide city-wide services. However, most of the …

“bring your own greedy”+ max: near-optimal 1/2-approximations for submodular knapsack

G Yaroslavtsev, S Zhou… - … Conference on Artificial …, 2020 - proceedings.mlr.press
The problem of selecting a small-size representative summary of a large dataset is a
cornerstone of machine learning, optimization and data science. Motivated by applications …

On robust streaming for learning with experts: algorithms and lower bounds

D Woodruff, F Zhang, S Zhou - Advances in Neural …, 2023 - proceedings.neurips.cc
In the online learning with experts problem, an algorithm makes predictions about an
outcome on each of $ T $ days, given a set of $ n $ experts who make predictions on each …