Imagen de Portada

John Ellipsoids via Lazy Updates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Woodruff, David P., Yasuda, Taisuke
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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)

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

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

Fast John Ellipsoid Computation with Differential Privacy Optimization
por: Li, Xiaoyu, et al.
Publicado: (2024)

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
por: Kamath, Gautam, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

Guessing Efficiently for Constrained Subspace Approximation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, et al.
Publicado: (2024)

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

Quantum Speedups for Approximating the John Ellipsoid
por: Li, Xiaoyu, et al.
Publicado: (2024)

Sublinear Time Quantum Sensitivity Sampling
por: Song, Zhao, et al.
Publicado: (2025)

Faster Algorithm for Structured John Ellipsoid Computation
por: Cao, Yang, et al.
Publicado: (2022)

Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
por: Gao, Chao, et al.
Publicado: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

Private Online Learning via Lazy Algorithms
por: Asi, Hilal, et al.
Publicado: (2024)

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

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
por: Braverman, Vladimir, et al.
Publicado: (2024)

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

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)

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

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

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
por: Chen, Hongjie, et al.
Publicado: (2024)

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

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

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

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

Streaming Algorithms with Few State Changes
por: Jayaram, Rajesh, 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)

Stochastic Matching via Local Sparsification
por: Ahmadian, Sara, et al.
Publicado: (2026)