Cover Image

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jambulapati, Arun, Kumar, Syamantak, Li, Jerry, Pandey, Shourya, Pensia, Ankit, Tian, Kevin
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributed Least Squares in Small Space via Sketching and Bias Reduction
by: Garg, Sachin, et al.
Published: (2024)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
by: Kumar, Syamantak, et al.
Published: (2026)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

Testing Calibration in Nearly-Linear Time
by: Hu, Lunjia, et al.
Published: (2024)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
by: Pittas, Thanasis, et al.
Published: (2024)

SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
by: Diakonikolas, Ilias, et al.
Published: (2024)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
by: Watanabe, Kazuki, et al.
Published: (2024)

Optimal Embedding Dimension for Sparse Subspace Embeddings
by: Chenakkod, Shabarish, et al.
Published: (2023)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
by: Chenakkod, Shabarish, et al.
Published: (2026)

On the Robustness of the Successive Projection Algorithm
by: Barbarino, Giovanni, et al.
Published: (2024)

Query Efficient Structured Matrix Learning
by: Amsel, Noah, et al.
Published: (2025)

Arithmetical Binary Decision Tree Traversals
by: Zhang, Jinxiong
Published: (2022)

Eulerian Graph Sparsification by Effective Resistance Decomposition
by: Jambulapati, Arun, et al.
Published: (2024)

Spike-and-Slab Posterior Sampling in High Dimensions
by: Kumar, Syamantak, et al.
Published: (2025)

Expander Decomposition with Almost Optimal Overhead
by: Bansal, Nikhil, et al.
Published: (2026)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Finer-Grained Hardness of Kernel Density Estimation
by: Alman, Josh, et al.
Published: (2024)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
by: Doney, Kyle, et al.
Published: (2025)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
by: Diakonikolas, Ilias, et al.
Published: (2024)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

Well-Conditioned Oblivious Perturbations in Linear Space
by: Chenakkod, Shabarish, et al.
Published: (2026)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
by: Chenakkod, Shabarish, et al.
Published: (2025)