No article text was recorded for this version.
spectral gap sensitivity
Version 2 of 2312 papers427 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Spectral Clustering via the Power Method - Provably
- Blog: Cubically Convergent Iterations for Invariant Subspace Computation
- Blog: Faster Noisy Power Method
- Blog: On the Approximation of Toeplitz Operators for Nonparametric $\mathcal{H}_\infty$-norm Estimation
- Blog: Stochastic PCA with $\ell_2$ and $\ell_1$ Regularization
- Blog: Minimax Rates of Estimation for Sparse PCA in High Dimensions
- Blog: Scalable Spectral Clustering Using Random Binning Features
- Blog: Scalable Spectral Clustering Using Random Binning Features
- Blog: The Fast Convergence of Incremental PCA
- Blog: Practical and Fast Momentum-Based Power Methods
- Blog: Streaming Kernel PCA Algorithm With Small Space
- Blog: Approximate Spectral Clustering via Randomized Sketching
- Blog: On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
- Blog: Principal Component Projection Without Principal Component Analysis
- Blog: Second order accurate distributed eigenvector computation for extremely large matrices
- Blog: Glued Matrices and the MRRR Algorithm
- Blog: Noisy Accelerated Power Method for Eigenproblems with Applications
- Blog: On the Riemannian Search for Eigenvector Computation
- Blog: Convergence of Stochastic Gradient Descent for PCA
- Blog: Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition
- Blog: The self-consistent field iteration for p-spectral clustering
- Blog: Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
- Blog: Fast and Simple PCA via Convex Optimization
- Blog: The Noisy Power Method: A Meta Algorithm with Applications
- Blog: Solving high-dimensional eigenvalue problems using deep neural networks: A diffusion Monte Carlo like approach
- Blog: Ergodicity in Stationary Graph Processes: A Weak Law of Large Numbers
- Blog: Faster Eigenvector Computation via Shift-and-Invert Preconditioning
- Blog: Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems
- Blog: Fast Approximate Spectral Clustering for Dynamic Networks
- Blog: Spectral division methods for block generalized Schur decompositions
- Blog: Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm
- Blog: Robust Streaming PCA
- Blog: Fast and Simple Spectral Clustering in Theory and Practice
- Blog: Random Walks, Faber Polynomials and Accelerated Power Methods
- Blog: Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity
- Blog: Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition
- Blog: Principal Component Projection Without Principal Component Analysis
- Blog: Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis
- Blog: A Blind Block Term Decomposition of High Order Tensors
- Blog: The Noisy Power Method: A Meta Algorithm with Applications
- Blog: Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
- Blog: Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
- Blog: Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates
- Blog: Coded aperture ptychography: uniqueness and reconstruction
- Blog: Structural Convergence Results for Low-Rank Approximations from Block Krylov Spaces
- Blog: Analysis of stochastic Lanczos quadrature for spectrum approximation
- Blog: Greedy Approaches to Symmetric Orthogonal Tensor Decomposition
- Blog: Faster Low-rank Approximation using Adaptive Gap-based Preconditioning
- Blog: Matrix Eigen-decomposition via Doubly Stochastic Riemannian Optimization
- Blog: Tackling Small Eigen-Gaps: Fine-Grained Eigenvector Estimation and Inference Under Heteroscedastic Noise
- Blog: Active Slices for Sliced Stein Discrepancy
- Blog: High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm
- Blog: Sparse constrained projection approximation subspace tracking
- Blog: Stochastic Variance Reduced Riemannian Eigensolver
- Blog: Approximating the Top Eigenvector in Random Order Streams
- Blog: Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis
- Blog: Approximating Eigenvectors by Subsampling
- Blog: A (simple) classical algorithm for estimating Betti numbers
- Blog: Fast Rates for Regularized Objectives
- Blog: Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation
Showing 60 of 312 papers.
History & citation
Current · Permanent link
- Spectral Gap Dilation for Faster Eigenvector Computation merged into this direction (60% overlap)
- Gap Independent Convergence for Spectral Algorithms merged into this direction (86% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_spectral_gap_sensitivity_fc10c69e,
title = {spectral gap sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-gap-sensitivity/rdr_fc10c69e342a45368fa4834bb5fc8d36},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_spectral_gap_sensitivity_fc10c69e_v2,
title = {spectral gap sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/spectral-gap-sensitivity/rdr_fc10c69e342a45368fa4834bb5fc8d36/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}