CUR matrix decompositions for improved data analysis
From MaRDI portal
(Redirected from Publication:134075)
Recommendations
- Relative-Error CUR Matrix Decompositions
- A generalized CUR decomposition for matrix pairs
- Efficient algorithms for CUR and interpolative matrix decompositions
- Perspectives on CUR decompositions
- Tensor-CUR Decompositions for Tensor-Based Data
- Towards more efficient SPSD matrix approximation and CUR matrix decomposition
- Data Analysis, Matrix Decompositions, and Generalized Inverse
Cites work
- A theory of pseudoskeleton approximations
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Fast monte-carlo algorithms for finding low-rank approximations
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Relative-Error CUR Matrix Decompositions
Cited in
(only showing first 100 items - show all)- dCUR
- Pseudo-skeleton approximations with better accuracy estimates
- A convex semi-nonnegative matrix factorisation approach to fuzzy c-means clustering
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- Inexact proximal stochastic gradient method for convex composite optimization
- Regression-aware decompositions
- Forecasting using random subspace methods
- A parametric and non-intrusive reduced order model of car crash simulation
- A continuous analogue of the tensor-train decomposition
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Geometric component analysis and its applications to data analysis
- An extended DEIM algorithm for subset selection and class identification
- ORCA: outlier detection and robust clustering for attributed graphs
- A reduced model using random forest: application on car crash optimization
- Deep composition of tensor-trains using squared inverse Rosenblatt transports
- Hybrid CUR-type decomposition of tensors in the Tucker format
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Spectral estimation from simulations via sketching
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
- Regularized greedy column subset selection
- Reduced order modelling of nonlinear cross-diffusion systems
- Linear-time CUR approximation of BEM matrices
- Perspectives on CUR decompositions
- Efficient algorithms for CUR and interpolative matrix decompositions
- A fast block low-rank dense solver with applications to finite-element matrices
- Far-field compression for fast kernel summation methods in high dimensions
- Feature selection for linear SVM with provable guarantees
- Structural conditions for projection-cost preservation via randomized matrix multiplication
- Optimal subsampling for softmax regression
- Relaxed leverage sampling for low-rank matrix completion
- Structure-preserving reduced-order modeling of Korteweg-de Vries equation
- Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases
- Generalized pseudoskeleton decompositions
- A GPU parallel randomized CUR compression method for the method of moments
- Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition
- Lower bounds on the rank and symmetric rank of real tensors
- Feature selection with SVD entropy: some modification and extension
- A DEIM induced CUR factorization
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Understanding singular vectors
- Randomized local model order reduction
- 6 The Loewner framework for system identification and reduction
- Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation
- Practical acceleration for computing the HITS expertrank vectors
- Training Gaussian mixture models at scale via coresets
- Computing localized representations of the Kohn-Sham subspace via randomization and refinement
- Online interpolation point refinement for reduced-order models using a genetic algorithm
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Literature survey on low rank approximation of matrices
- System identification via CUR-factored Hankel approximation
- Recovering PCA and sparse PCA via hybrid-(_1,_2) sparse sampling of data elements
- Optimal subsampling for large sample logistic regression
- Towards a unified analysis of random Fourier features
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- CUR LRA at Sublinear Cost Based on Volume Maximization
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- A generalized CUR decomposition for matrix pairs
- Fast quantum algorithms for least squares regression and statistic leverage scores
- Tensor CUR decomposition under T-product and its perturbation
- On expected error of randomized Nyström kernel regression
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- Interpolative Decomposition Butterfly Factorization
- Analytical low-rank compression via proxy point selection
- Interpolation-based model order reduction for polynomial systems
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- The nonequilibrium quantum many-body problem as a paradigm for extreme data science
- More efficient estimation for logistic regression with optimal subsamples
- Allocation Strategies for High Fidelity Models in the Multifidelity Regime
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
- Butterfly factorization
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Tensor-CUR Decompositions for Tensor-Based Data
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Optimal column-based low-rank matrix reconstruction
- Perturbations of CUR Decompositions
- Robust CUR Decomposition: Theory and Imaging Applications
- Bridging and Improving Theoretical and Computational Electrical Impedance Tomography via Data Completion
- Molecular modeling by machine learning
- Randomized numerical linear algebra: Foundations and algorithms
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Coseparable Nonnegative Matrix Factorization
- A literature survey of matrix methods for data science
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- A Hybrid DEIM and Leverage Scores Based Method for CUR Index Selection
- Randomized Quasi-Optimal Local Approximation Spaces in Time
- An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation
- \(\mathrm{C_{enet}Biplot}\): a new proposal of sparse and orthogonal biplots methods by means of elastic net CSVD
- A Model-free Variable Screening Method Based on Leverage Score
- Localized Model Reduction for Nonlinear Elliptic Partial Differential Equations: Localized Training, Partition of Unity, and Adaptive Enrichment
This page was built for publication: CUR matrix decompositions for improved data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q134075)
