Imagen de Portada

Optimal Communication for Classic Functions in the Coordinator Model and Beyond

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Esfandiari, Hossein, Kacham, Praneeth, Mirrokni, Vahab, Woodruff, David P., Zhong, Peilin
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

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

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

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

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

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

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
por: Ene, Alina, et al.
Publicado: (2025)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
por: Kannan, Ravindran, et al.
Publicado: (2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
por: Azarmehr, Amir, et al.
Publicado: (2024)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
por: Epasto, Alessandro, et al.
Publicado: (2020)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, 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)

Approximately Optimal Core Shapes for Tensor Decompositions
por: Ghadiri, Mehrdad, et al.
Publicado: (2023)

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
por: Javanmard, Adel, et al.
Publicado: (2024)

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

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

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

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

Perturb-and-Project: Differentially Private Similarities and Marginals
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

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

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

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

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

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

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
por: Silwal, Sandeep, et al.
Publicado: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
por: Dhulipala, Laxman, et al.
Publicado: (2024)

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

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

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

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

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

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

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
por: Zandieh, Amir, et al.
Publicado: (2025)

PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels
por: Kacham, Praneeth, et al.
Publicado: (2023)

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

Replicable Composition
por: Banihashem, Kiarash, et al.
Publicado: (2026)

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

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

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