Imagen de Portada

Multipass Linear Sketches for Geometric LP-Type Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Çekirge, N. Efe, Gay, William, Woodruff, David P.
Formato:	Preprint
Publicado:	2025
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

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

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

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

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

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
por: Gribelyuk, Elena, et al.
Publicado: (2024)

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

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

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

Range Counting Oracles for Geometric Problems
por: Driemel, Anne, et al.
Publicado: (2025)

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

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

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

Sketching approximations and LP approximations for finite CSPs are related
por: Singer, Noah G., et al.
Publicado: (2025)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
por: Esfandiari, Hossein, et al.
Publicado: (2024)

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

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

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

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

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

Approximating the Top Eigenvector in Random Order Streams
por: Kacham, Praneeth, 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)

Almost Linear Size Edit Distance Sketch
por: Koucký, Michal, et al.
Publicado: (2024)

Learning Multiple Secrets in Mastermind
por: Prabhu, Milind, et al.
Publicado: (2024)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
por: Buchem, Moritz, et al.
Publicado: (2024)

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

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

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

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

SVD Provably Denoises Nearest Neighbor Data
por: Kannan, Ravindran, et al.
Publicado: (2026)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

Search Trees on Trees via LP
por: Sadeh, Yaniv, et al.
Publicado: (2025)

Understanding the Cluster LP for Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2024)

The Case for External Graph Sketching
por: Bender, Michael A., et al.
Publicado: (2025)

John Ellipsoids via Lazy Updates
por: Woodruff, David P., et al.
Publicado: (2025)

Lower Bounds on Adaptive Sensing for Matrix Recovery
por: Kacham, Praneeth, et al.
Publicado: (2023)

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

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

Reweighted Solutions for Weighted Low Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2024)