scientific article; zbMATH DE number 7051267

zbMath1420.68235MaRDI QIDQ4633910

Christos Boutsidis, Michael W. Mahoney, Petros Drineas

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496875

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (53)

An Offline-Online Decomposition Method for Efficient Linear Bayesian Goal-Oriented Optimal Experimental Design: Application to Optimal Sensor Placement ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Optimal column subset selection for image classification by genetic algorithms ⋮ Data representation using robust nonnegative matrix factorization for edge computing ⋮ Randomized Local Model Order Reduction ⋮ Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores ⋮ Column subset selection problem is UG-hard ⋮ Unnamed Item ⋮ Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ A training set subsampling strategy for the reduced basis method ⋮ A non-intrusive multifidelity method for the reduced order modeling of nonlinear problems ⋮ Subspaces Analysis for Random Projection UTV Framework ⋮ One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering ⋮ A literature survey of matrix methods for data science ⋮ Importance sampling in signal processing applications ⋮ Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction ⋮ A note on subset selection for matrices ⋮ Unnamed Item ⋮ Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition ⋮ Adaptive symplectic model order reduction of parametric particle-based Vlasov–Poisson equation ⋮ Literature survey on low rank approximation of matrices ⋮ Optimal CUR Matrix Decompositions ⋮ Regularized greedy column subset selection ⋮ A note on sparse least-squares regression ⋮ Column subset selection is NP-complete ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Effectively Subsampled Quadratures for Least Squares Polynomial Approximations ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ An improvement of the parameterized frequent directions algorithm ⋮ Fast quantum algorithms for least squares regression and statistic leverage scores ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ Unnamed Item ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm ⋮ Geometric component analysis and its applications to data analysis ⋮ Linear-time CUR approximation of BEM matrices ⋮ Random Projections for Low Multilinear Rank Tensors ⋮ Perspectives on CUR decompositions ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Allocation Strategies for High Fidelity Models in the Multifidelity Regime ⋮ ALORA: affine low-rank approximations ⋮ Column subset selection via sparse approximation of SVD ⋮ Clustered Matrix Approximation ⋮ An ensemble feature ranking algorithm for clustering analysis ⋮ High-dimensional model recovery from random sketched data by exploring intrinsic sparsity ⋮ 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 ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: