On Socially Fair Low-Rank Approximation and Column Subset Selection
Fuente:
arXiv
Saved in:
| Main Authors: | Song, Zhao, Vakilian, Ali, Woodruff, David P., Zhou, Samson |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Consistent Low-Rank Approximation
by: Woodruff, David P., et al.
Published: (2026)
by: Woodruff, David P., et al.
Published: (2026)
Reweighted Solutions for Weighted Low Rank Approximation
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025)
by: Bhaskara, Aditya, et al.
Published: (2025)
Better Bounds for the Distributed Experts Problem
by: Woodruff, David P., et al.
Published: (2026)
by: Woodruff, David P., et al.
Published: (2026)
Learning the Positions in CountSketch
by: Li, Yi, et al.
Published: (2023)
by: Li, Yi, et al.
Published: (2023)
A Statistical View of Column Subset Selection
by: Sood, Anav, et al.
Published: (2023)
by: Sood, Anav, et al.
Published: (2023)
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)
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
by: Bandyapadhyay, Sayan, 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)
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)
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., et al.
Published: (2024)
Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
by: Kamath, Gautam, et al.
Published: (2025)
by: Kamath, Gautam, et al.
Published: (2025)
Coresets for Multiple $\ell_p$ Regression
by: Woodruff, David P., et al.
Published: (2024)
by: Woodruff, David P., 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)
John Ellipsoids via Lazy Updates
by: Woodruff, David P., et al.
Published: (2025)
by: Woodruff, David P., et al.
Published: (2025)
Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)
by: Song, Zhao, 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)
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)
Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
by: Silwal, Sandeep, et al.
Published: (2025)
by: Silwal, Sandeep, et al.
Published: (2025)
Streaming Algorithms with Few State Changes
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
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)
Scalable Algorithms for Individual Preference Stable Clustering
by: Mosenzon, Ron, et al.
Published: (2024)
by: Mosenzon, Ron, et al.
Published: (2024)
Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
by: Garg, Sachin, et al.
Published: (2025)
by: Garg, Sachin, et al.
Published: (2025)
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
by: Dong, Yinhao, et al.
Published: (2024)
by: Dong, Yinhao, et al.
Published: (2024)
$L_p$ Sampling in Distributed Data Streams with Applications to Adversarial Robustness
by: Lin, Honghao, et al.
Published: (2025)
by: Lin, Honghao, et al.
Published: (2025)
Fair Submodular Cover
by: Chen, Wenjing, et al.
Published: (2024)
by: Chen, Wenjing, et al.
Published: (2024)
LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
by: Kannan, Ravindran, et al.
Published: (2024)
by: Kannan, Ravindran, et al.
Published: (2024)
Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)
by: DePavia, Adela Frances, et al.
Published: (2024)
Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)
by: Giliberti, Jeff, et al.
Published: (2026)
Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
by: Drexler, Lukas, et al.
Published: (2023)
by: Drexler, Lukas, et al.
Published: (2023)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Transductive and Learning-Augmented Online Regression
by: Raman, Vinod, et al.
Published: (2025)
by: Raman, Vinod, et al.
Published: (2025)
Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
by: Maity, Binita, et al.
Published: (2024)
by: Maity, Binita, et al.
Published: (2024)
Tight Sampling Bounds for Eigenvalue Approximation
by: Swartworth, William, et al.
Published: (2024)
by: Swartworth, William, et al.
Published: (2024)
Subset verification and search algorithms for causal DAGs
by: Choo, Davin, et al.
Published: (2023)
by: Choo, Davin, 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)
An Approximation Algorithm for Graph Label Selection
by: John, Josia, et al.
Published: (2026)
by: John, Josia, et al.
Published: (2026)
Online Multi-Class Selection with Group Fairness Guarantee
by: Zargari, Faraz, et al.
Published: (2025)
by: Zargari, Faraz, et al.
Published: (2025)
Similar Items
-
Consistent Low-Rank Approximation
by: Woodruff, David P., et al.
Published: (2026) -
Reweighted Solutions for Weighted Low Rank Approximation
by: Woodruff, David P., et al.
Published: (2024) -
Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025) -
Better Bounds for the Distributed Experts Problem
by: Woodruff, David P., et al.
Published: (2026) -
Learning the Positions in CountSketch
by: Li, Yi, et al.
Published: (2023)