Fast approximation of matrix coherence and statistical leverage
From MaRDI portal
Recommendations
- Randomized Algorithms for Matrices and Data
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast monte-carlo algorithms for finding low-rank approximations
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- A fast randomized algorithm for the approximation of matrices
Cited in
(89)- Generalized linear models for massive data via doubly-sketching
- Approximate Newton methods
- A block-randomized stochastic method with importance sampling for CP tensor decomposition
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Distributed subdata selection for big data via sampling-based approach
- Orthogonal subsampling for big data linear regression
- Optimal sampling designs for multidimensional streaming time series with application to power grid sensor data
- Divide-and-conquer information-based optimal subdata selection algorithm
- Far-field compression for fast kernel summation methods in high dimensions
- Leveraging for big data regression
- scientific article; zbMATH DE number 7307477 (Why is no real title available?)
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Random sampling of bandlimited signals on graphs
- Minimum cost flow in the CONGEST model
- A bootstrap method for error estimation in randomized matrix multiplication
- A statistical perspective on algorithmic leveraging
- Robust and efficient subsampling algorithms for massive data logistic regression
- Bounded-memory adjusted scores estimation in generalized linear models with large data sets
- Poisson subsampling-based estimation for growing-dimensional expectile regression in massive data
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Graph coarsening: from scientific computing to machine learning
- scientific article; zbMATH DE number 6982912 (Why is no real title available?)
- Weighted SGD for \(\ell_p\) regression with randomized preconditioning
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Distributed optimal subsampling for quantile regression with massive data
- Optimal subsampling for large sample logistic regression
- More efficient estimation for logistic regression with optimal subsamples
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Functional principal subspace sampling for large scale functional data analysis
- Optimal Poisson subsampling for softmax regression
- Sampled Tikhonov regularization for large linear inverse problems
- Optimal subsampling for multiplicative regression with massive data
- Conditioning of leverage scores and computation by QR decomposition
- Robust CUR Decomposition: Theory and Imaging Applications
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- Distributed subsampling for multiplicative regression
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Linear dimension reduction approximately preserving a function of the $1$-norm
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
- Smoothing Splines Approximation Using Hilbert Curve Basis Selection
- Frequent directions: simple and deterministic matrix sketching
- Robust frequent directions with application in online learning
- Optimal subsampling algorithms for composite quantile regression in massive data
- On the inversion-free Newton's method and its applications
- Block basis factorization for scalable kernel evaluation
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Inversion-free subsampling Newton's method for large sample logistic regression
- On the numerical rank of radial basis function kernels in high dimensions
- A literature survey of matrix methods for data science
- Practical leverage-based sampling for low-rank tensor decomposition
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Subsampling spectral clustering for stochastic block models in large-scale networks
- A stochastic perturbation analysis of the QR decomposition and its applications
- Importance sampling in signal processing applications
- Randomized Dynamic Mode Decomposition
- Optimal subsampling for composite quantile regression model in massive data
- Subsampling in longitudinal models
- Optimal subsampling for functional quantile regression
- Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- Core-elements for large-scale least squares estimation
- Optimal Sampling for Generalized Linear Models Under Measurement Constraints
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- Reverse iterative volume sampling for linear regression
- Randomized Nyström Preconditioning
- Model-robust subdata selection for big data
- scientific article; zbMATH DE number 6860845 (Why is no real title available?)
- Randomized Quasi-Optimal Local Approximation Spaces in Time
- Compressed and Penalized Linear Regression
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Randomized local model order reduction
- scientific article; zbMATH DE number 7625175 (Why is no real title available?)
- Tracking tensor ring decompositions of streaming tensors
- Optimal Poisson subsampling decorrelated score for high-dimensional generalized linear models
- Max-Plus Algebraic Statistical Leverage Scores
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Numerical Considerations and a new implementation for invariant coordinate selection
- Adaptive iterative Hessian sketch via A-optimal subsampling
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- Optimal subsampling algorithms for big data regressions
- Kernel conjugate gradient methods with random projections
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Randomized algorithms in numerical linear algebra
- A note on centering in subsample selection for linear regression
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
This page was built for publication: Fast approximation of matrix coherence and statistical leverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405231)
