{"total":21,"rows":[{"id":"2101.09054","title":"Adversarial Laws of Large Numbers and Optimal Regret in Online Classification","created":"2021-01-22","cited_by_count":39,"area":null},{"id":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2207.08268","title":"Online Lewis Weight Sampling","created":"2022-07-17","cited_by_count":15,"area":null},{"id":"2106.14952","title":"Adversarial Robustness of Streaming Algorithms through Importance Sampling","created":"2021-06-28","cited_by_count":13,"area":null},{"id":"2107.14527","title":"A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators","created":"2021-07-30","cited_by_count":9,"area":null},{"id":"2203.01599","title":"Uniform Approximations for Randomized Hadamard Transforms with Applications","created":"2022-03-03","cited_by_count":9,"area":null},{"id":"2202.13736","title":"On the Robustness of CountSketch to Adaptive Inputs","created":"2022-02-28","cited_by_count":5,"area":null},{"id":"2201.00228","title":"The Complexity of Dynamic Least-Squares Regression","created":"2022-01-01","cited_by_count":3,"area":null},{"id":"2303.01709","title":"Streaming Algorithms for Learning with Experts: Deterministic Versus Robust","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2412.14396","title":"Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis","created":"2024-12-18","cited_by_count":3,"area":null},{"id":"2207.00956","title":"Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs","created":"2022-07-03","cited_by_count":2,"area":null},{"id":"2303.16308","title":"Provable Robustness for Streaming Models with a Sliding Window","created":"2023-03-28","cited_by_count":1,"area":null},{"id":"2504.01135","title":"Performative Drift Resistant Classification Using Generative Domain Adversarial Networks","created":"2025-04-01","cited_by_count":1,"area":null},{"id":"2510.07922","title":"Screen Before You Fetch: Compressed Byzantine Screening for Decentralized Learning on the Edge-Cloud Continuum","created":"2025-10-09","cited_by_count":1,"area":null},{"id":"2301.09203","title":"Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model","created":"2023-01-22","cited_by_count":0,"area":null},{"id":"2311.00346","title":"Adversarially Robust Distributed Count Tracking via Partial Differential Privacy","created":"2023-11-01","cited_by_count":0,"area":null},{"id":"2312.01634","title":"Robust Streaming, Sampling, and a Perspective on Online Learning","created":"2023-12-04","cited_by_count":0,"area":null},{"id":"2406.06808","title":"Fast White-Box Adversarial Streaming Without a Random Oracle","created":"2024-06-10","cited_by_count":0,"area":null},{"id":"2411.09979","title":"Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time","created":"2024-11-15","cited_by_count":0,"area":null},{"id":"2507.16345","title":"The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\\ell_2$ Norm Estimation","created":"2025-07-22","cited_by_count":0,"area":null}],"next_cursor":null}