{"total":17,"rows":[{"id":"2210.03961","title":"Dynamic Tensor Product Regression","created":"2022-10-08","cited_by_count":17,"area":null},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2111.10352","title":"On the power of adaptivity in statistical adversaries","created":"2021-11-19","cited_by_count":12,"area":null},{"id":"2201.08704","title":"Adaptive Data Analysis with Correlated Observations","created":"2022-01-21","cited_by_count":9,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"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":"2305.15452","title":"Adaptive Data Analysis in a Balanced Adversarial Model","created":"2023-05-24","cited_by_count":5,"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":"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":"2406.03152","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","created":"2024-06-05","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},{"id":"2509.16915","title":"Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming","created":"2025-09-21","cited_by_count":0,"area":null},{"id":"2607.07085","title":"Is Randomness Necessary for Adaptive Data Analysis?","created":"2026-07-08","cited_by_count":0,"area":null}],"next_cursor":null}