A literature survey of matrix methods for data science

DOI10.1002/GAMM.202000013arXiv1912.07896OpenAlexW2995201243MaRDI QIDQ6068265

Martin Stoll

Publication date: 15 December 2023

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.07896

zbMATH Keywords

numerical linear algebradata science

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Artificial intelligence (68Txx) Basic linear algebra (15Axx)

Cites Work

• Generalizing Diffuse Interface Methods on Graphs: Nonsmooth Potentials and Hypergraphs
• A Practical Randomized CP Tensor Decomposition
• Gaussian Markov Random Fields
• Iterative Methods for Total Variation Denoising
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data
• An Introduction to Statistical Learning
• On Tensors, Sparsity, and Nonnegative Factorizations
• Randomized methods for matrix computations
• NMF with Sparse Regularizations in Transformed Domains
• Free Energy of a Nonuniform System. I. Interfacial Free Energy
• Scalable $M$-Channel Critically Sampled Filter Banks for Graph Signals
• Deep Learning: An Introduction for Applied Mathematicians
• Approximation of high-dimensional parametric PDEs
• Subspace Iteration Randomization and Singular Value Problems
• A High Performance QDWH-SVD Solver Using Hardware Accelerators
• Sparse grids
• Tensor-CUR Decompositions for Tensor-Based Data
• Deep learning in fluid dynamics
• Adaptive Hypergraph Learning and its Application in Image Classification
• Advanced Lectures on Machine Learning
• Functions of Matrices
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Calculation of Gauss Quadrature Rules
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Eigenvector-Based Centrality Measures for Temporal Networks
• Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen–Loève expansion
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Perturbations of CUR Decompositions
• Randomized numerical linear algebra: Foundations and algorithms
• A randomized algorithm for approximate string matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Sampling of Gaussian Markov Random Fields
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor Decompositions and Applications
• Algorithm AS 136: A K-Means Clustering Algorithm
• Tensor-Train Decomposition
• CUR matrix decompositions for improved data analysis
• The Little Engine that Could: Regularization by Denoising (RED)
• A Krylov-Schur approach to the truncated SVD
• Faster least squares approximation
• Laplacian centrality: A new centrality measure for weighted networks
• A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
• Approximation of the scattering amplitude and linear systems
• Kernel methods in machine learning
• Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression
• Quadrature rule-based bounds for functions of adjacency matrices
• Randomized Kaczmarz solver for noisy linear systems
• Algorithms and applications for approximate nonnegative matrix factorization
• Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm
• The truncated SVD as a method for regularization
• Mosaic-skeleton approximations
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Pseudo-skeleton approximations by matrices of maximal volume
• Pseudo-skeleton approximations with better accuracy estimates
• Nodal decompositions of graphs
• Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• Principal component analysis.
• Support-vector networks
• Column subset selection is NP-complete
• Joint sparse principal component analysis
• Bounding matrix functionals via partial global block Lanczos decomposition
• Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
• The deformed consensus protocol
• Efficient algorithms for CUR and interpolative matrix decompositions
• Estimating the Estrada index
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• Clustering of time series data -- a survey
• Matrix Algorithms
• A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems
• Approximating Spectral Densities of Large Matrices
• A DEIM Induced CUR Factorization
• HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
• Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
• Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
• A literature survey of low-rank tensor approximation techniques
• Regularization with randomized SVD for large-scale discrete inverse problems
• Stability of Two Direct Methods for Bidiagonalization and Partial Least Squares
• Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores
• Computational Advertising: Techniques for Targeting Relevant Ads
• A-Optimal Design of Experiments for Infinite-Dimensional Bayesian Linear Inverse Problems with Regularized $\ell_0$-Sparsification
• Principal component analysis: a review and recent developments
• Spectral redemption in clustering sparse networks
• Optimal CUR Matrix Decompositions
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
• Numerical Methods for Large Eigenvalue Problems
• Nonlinear Model Reduction via Discrete Empirical Interpolation
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• Network Properties Revealed through Matrix Functions
• A new investigation of the extended Krylov subspace method for matrix function evaluations
• On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$
• Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval
• Randomized Algorithms for Matrices and Data
• An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations
• Large-Scale Machine Learning with Stochastic Gradient Descent
• Kernel techniques: From machine learning to meshless methods
• Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
• Randomized Iterative Methods for Linear Systems
• Inpainting of Binary Images Using the Cahn–Hilliard Equation
• On the Complexity of Nonnegative Matrix Factorization
• Greedy approximation
• Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• Approximating Matrix Multiplication for Pattern Recognition Tasks
• On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• ARPACK Users' Guide
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• A Multilinear Singular Value Decomposition
• Sparse and Non-Negative BSS for Noisy Data
• Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature
• Faster Kernel Ridge Regression Using Sketching and Preconditioning
• Progressive Image Denoising Through Hybrid Graph Laplacian Regularization: A Unified Framework
• A General Framework for Regularized, Similarity-Based Image Restoration
• Literature survey on low rank approximation of matrices
• Stable architectures for deep neural networks
• Sparse Solutions in Optimal Control of PDEs with Uncertain Parameters: The Linear Case
• CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters

This page was built for publication: A literature survey of matrix methods for data science