scientific article; zbMATH DE number 6276220
From MaRDI portal
Publication:5405231
zbMath1437.65030arXiv1109.3843MaRDI QIDQ5405231
Michael W. Mahoney, Malik Magdon-Ismail, David P. Woodruff, Petros Drineas
Publication date: 1 April 2014
Full work available at URL: https://arxiv.org/abs/1109.3843
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (89)
Numerical Considerations and a new implementation for invariant coordinate selection ⋮ Graph coarsening: from scientific computing to machine learning ⋮ Distributed subdata selection for big data via sampling-based approach ⋮ Functional principal subspace sampling for large scale functional data analysis ⋮ Randomized Local Model Order Reduction ⋮ Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores ⋮ Smoothing Splines Approximation Using Hilbert Curve Basis Selection ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Inversion-free subsampling Newton's method for large sample logistic regression ⋮ Optimal Sampling for Generalized Linear Models Under Measurement Constraints ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Unnamed Item ⋮ Optimal subsampling for composite quantile regression model in massive data ⋮ Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ Optimal subsampling for multiplicative regression with massive data ⋮ A literature survey of matrix methods for data science ⋮ Subsampling spectral clustering for stochastic block models in large-scale networks ⋮ Randomized algorithms in numerical linear algebra ⋮ Random sampling of bandlimited signals on graphs ⋮ Randomized Quasi-Optimal Local Approximation Spaces in Time ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ Generalized linear models for massive data via doubly-sketching ⋮ Unnamed Item ⋮ A block-randomized stochastic method with importance sampling for CP tensor decomposition ⋮ Optimal subsampling algorithms for composite quantile regression in massive data ⋮ Optimal sampling designs for multidimensional streaming time series with application to power grid sensor data ⋮ Max-Plus Algebraic Statistical Leverage Scores ⋮ Adaptive iterative Hessian sketch via \(A\)-optimal subsampling ⋮ Minimum cost flow in the CONGEST model ⋮ Importance sampling in signal processing applications ⋮ Subsampling in longitudinal models ⋮ Randomized Nyström Preconditioning ⋮ Unnamed Item ⋮ Optimal subsampling for functional quantile regression ⋮ Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition ⋮ Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence ⋮ Linear dimension reduction approximately preserving a function of the $1$-norm ⋮ Kernel conjugate gradient methods with random projections ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation ⋮ On the Numerical Rank of Radial Basis Function Kernels in High Dimensions ⋮ Fast quantum algorithms for least squares regression and statistic leverage scores ⋮ Unnamed Item ⋮ Orthogonal subsampling for big data linear regression ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Block Basis Factorization for Scalable Kernel Evaluation ⋮ A note on centering in subsample selection for linear regression ⋮ Robust and efficient subsampling algorithms for massive data logistic regression ⋮ Poisson subsampling-based estimation for growing-dimensional expectile regression in massive data ⋮ Bounded-memory adjusted scores estimation in generalized linear models with large data sets ⋮ Randomized Dynamic Mode Decomposition ⋮ Distributed optimal subsampling for quantile regression with massive data ⋮ Optimal Poisson subsampling for softmax regression ⋮ \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores ⋮ Leveraging for big data regression ⋮ Distributed subsampling for multiplicative regression ⋮ On the inversion-free Newton's method and its applications ⋮ A stochastic perturbation analysis of the QR decomposition and its applications ⋮ Optimal Subsampling for Large Sample Logistic Regression ⋮ Efficient bounds and estimates for canonical angles in randomized subspace approximations ⋮ Core-elements for large-scale least squares estimation ⋮ Tracking tensor ring decompositions of streaming tensors ⋮ Optimal Poisson subsampling decorrelated score for high-dimensional generalized linear models ⋮ The Fast Cauchy Transform and Faster Robust Linear Regression ⋮ Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions ⋮ Sampled Tikhonov regularization for large linear inverse problems ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Compressed and Penalized Linear Regression ⋮ Model-robust subdata selection for big data ⋮ Information-Based Optimal Subdata Selection for Big Data Linear Regression ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data ⋮ Divide-and-conquer information-based optimal subdata selection algorithm ⋮ Unnamed Item ⋮ Conditioning of Leverage Scores and Computation by QR Decomposition ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Robust CUR Decomposition: Theory and Imaging Applications ⋮ Unnamed Item ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
Uses Software
This page was built for publication:
