$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
Fuente:
arXiv
Saved in:
| Main Authors: | Lin, Honghao, Song, Zhao, Woodruff, David P., Xie, Shenghao, Zhou, Samson |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Perfect Sampling in Turnstile Streams Beyond Small Moments
by: Woodruff, David P., et al.
Published: (2025)
by: Woodruff, David P., et al.
Published: (2025)
Perfect $L_p$ Sampling with Polylogarithmic Update Time
by: Swartworth, William, et al.
Published: (2025)
by: Swartworth, William, et al.
Published: (2025)
Adversarial Robustness on Insertion-Deletion Streams
by: Gribelyuk, Elena, et al.
Published: (2026)
by: Gribelyuk, Elena, et al.
Published: (2026)
Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
by: Gribelyuk, Elena, et al.
Published: (2025)
by: Gribelyuk, Elena, et al.
Published: (2025)
A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
by: Gribelyuk, Elena, et al.
Published: (2024)
by: Gribelyuk, Elena, et al.
Published: (2024)
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
by: Li, Yi, et al.
Published: (2022)
by: Li, Yi, et al.
Published: (2022)
Streaming Algorithms with Few State Changes
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
Better Bounds for the Distributed Experts Problem
by: Woodruff, David P., et al.
Published: (2026)
by: Woodruff, David P., et al.
Published: (2026)
Consistent Low-Rank Approximation
by: Woodruff, David P., et al.
Published: (2026)
by: Woodruff, David P., et al.
Published: (2026)
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
On Sketching Trimmed Statistics
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
Distributed Algorithms for Euclidean Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2026)
by: Cohen-Addad, Vincent, et al.
Published: (2026)
Space Complexity of Minimum Cut Problems in Single-Pass Streams
by: Ding, Matthew, et al.
Published: (2024)
by: Ding, Matthew, et al.
Published: (2024)
On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)
by: Song, Zhao, et al.
Published: (2024)
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
by: Kacham, Praneeth, et al.
Published: (2023)
by: Kacham, Praneeth, et al.
Published: (2023)
Approximating the Top Eigenvector in Random Order Streams
by: Kacham, Praneeth, et al.
Published: (2024)
by: Kacham, Praneeth, et al.
Published: (2024)
Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)
by: Li, Yi, et al.
Published: (2024)
Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
by: Cheng, Yu, et al.
Published: (2024)
by: Cheng, Yu, et al.
Published: (2024)
Transductive and Learning-Augmented Online Regression
by: Raman, Vinod, et al.
Published: (2025)
by: Raman, Vinod, et al.
Published: (2025)
Fast White-Box Adversarial Streaming Without a Random Oracle
by: Feng, Ying, et al.
Published: (2024)
by: Feng, Ying, et al.
Published: (2024)
Sharper Bounds for $\ell_p$ Sensitivity Sampling
by: Woodruff, David P., et al.
Published: (2023)
by: Woodruff, David P., et al.
Published: (2023)
Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
High-Dimensional Geometric Streaming for Nearly Low Rank Data
by: Esfandiari, Hossein, et al.
Published: (2024)
by: Esfandiari, Hossein, et al.
Published: (2024)
Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
Faster Algorithms for Schatten-p Low Rank Approximation
by: Kacham, Praneeth, et al.
Published: (2024)
by: Kacham, Praneeth, et al.
Published: (2024)
Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Learning the Positions in CountSketch
by: Li, Yi, et al.
Published: (2023)
by: Li, Yi, et al.
Published: (2023)
Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)
by: Song, Zhao, et al.
Published: (2025)
Robust Streaming Against Low-Memory Adversaries
by: Ben-Eliezer, Omri, et al.
Published: (2025)
by: Ben-Eliezer, Omri, et al.
Published: (2025)
Online Learning with Limited Information in the Sliding Window Model
by: Braverman, Vladimir, et al.
Published: (2026)
by: Braverman, Vladimir, et al.
Published: (2026)
Learning-Augmented Moment Estimation on Time-Decay Models
by: Nagawanshi, Soham, et al.
Published: (2026)
by: Nagawanshi, Soham, et al.
Published: (2026)
Coresets for Multiple $\ell_p$ Regression
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
On Fine-Grained Distinct Element Estimation
by: Diakonikolas, Ilias, et al.
Published: (2025)
by: Diakonikolas, Ilias, et al.
Published: (2025)
A New Information Complexity Measure for Multi-pass Streaming with Applications
by: Braverman, Mark, et al.
Published: (2024)
by: Braverman, Mark, et al.
Published: (2024)
SVD Provably Denoises Nearest Neighbor Data
by: Kannan, Ravindran, et al.
Published: (2026)
by: Kannan, Ravindran, et al.
Published: (2026)
On the Adversarial Robustness of Online Importance Sampling
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
Similar Items
-
Perfect Sampling in Turnstile Streams Beyond Small Moments
by: Woodruff, David P., et al.
Published: (2025) -
Perfect $L_p$ Sampling with Polylogarithmic Update Time
by: Swartworth, William, et al.
Published: (2025) -
Adversarial Robustness on Insertion-Deletion Streams
by: Gribelyuk, Elena, et al.
Published: (2026) -
Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025) -
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
by: Gribelyuk, Elena, et al.
Published: (2025)