Imagen de Portada

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gribelyuk, Elena, Lin, Honghao, Woodruff, David P., Yu, Huacheng, Zhou, Samson
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
por: Gribelyuk, Elena, et al.
Publicado: (2025)

Adversarial Robustness on Insertion-Deletion Streams
por: Gribelyuk, Elena, et al.
Publicado: (2026)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
por: Li, Yi, et al.
Publicado: (2022)

$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
por: Lin, Honghao, et al.
Publicado: (2025)

On Sketching Trimmed Statistics
por: Lin, Honghao, et al.
Publicado: (2025)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
por: Woodruff, David P., et al.
Publicado: (2024)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
por: Li, Yi, et al.
Publicado: (2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
por: Gribelyuk, Elena, et al.
Publicado: (2024)

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
por: Lin, Honghao, et al.
Publicado: (2025)

Learning the Positions in CountSketch
por: Li, Yi, et al.
Publicado: (2023)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
por: Sawettamalya, Pachara, et al.
Publicado: (2025)

Consistent Low-Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2026)

Multipass Linear Sketches for Geometric LP-Type Problems
por: Çekirge, N. Efe, et al.
Publicado: (2025)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
por: Velusamy, Santhoshini, et al.
Publicado: (2025)

Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)

Adaptively Robust Resettable Streaming
por: Cohen, Edith, et al.
Publicado: (2026)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
por: Jiang, Cheng, et al.
Publicado: (2026)

Streaming Algorithms with Few State Changes
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Perfect Sampling in Turnstile Streams Beyond Small Moments
por: Woodruff, David P., et al.
Publicado: (2025)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
por: Swartworth, William, et al.
Publicado: (2025)

Better Bounds for the Distributed Experts Problem
por: Woodruff, David P., et al.
Publicado: (2026)

On Sketching Quadratic Forms
por: Andoni, Alexandr, et al.
Publicado: (2015)

Coresets for Multiple $\ell_p$ Regression
por: Woodruff, David P., et al.
Publicado: (2024)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
por: Woodruff, David P., et al.
Publicado: (2023)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

On Fine-Grained Distinct Element Estimation
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
por: Woodruff, David P., et al.
Publicado: (2024)

Learning-Augmented Moment Estimation on Time-Decay Models
por: Nagawanshi, Soham, et al.
Publicado: (2026)

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
por: Cheng, Yu, et al.
Publicado: (2024)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
por: Feng, Shiyuan, et al.
Publicado: (2025)

On Socially Fair Low-Rank Approximation and Column Subset Selection
por: Song, Zhao, et al.
Publicado: (2024)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
por: Ding, Matthew, et al.
Publicado: (2024)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
por: Feng, Shiyuan, et al.
Publicado: (2025)

Online Learning with Limited Information in the Sliding Window Model
por: Braverman, Vladimir, et al.
Publicado: (2026)

Faster Algorithms for Schatten-p Low Rank Approximation
por: Kacham, Praneeth, et al.
Publicado: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Approximating the Top Eigenvector in Random Order Streams
por: Kacham, Praneeth, et al.
Publicado: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
por: Feng, Ying, et al.
Publicado: (2024)