Randomized Algorithms for Matrices and Data
From MaRDI portal
Recommendations
- Randomized methods for matrix computations
- Randomized algorithms in numerical linear algebra
- Machine Learning: ECML 2004
- A randomized algorithm for the decomposition of matrices
- Randomized algorithms for the low-rank approximation of matrices
- Randomized numerical linear algebra: Foundations and algorithms
- Using randomization to make recursive matrix algorithms practical
- scientific article; zbMATH DE number 3930719
Cited in
(only showing first 100 items - show all)- Generalized linear models for massive data via doubly-sketching
- Fast MCMC sampling algorithms on polytopes
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- Householder QR factorization with randomization for column pivoting (HQRRP)
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Insights into randomized algorithms for neural networks: practical issues and common pitfalls
- A random sampling algorithm for fully-connected tensor network decomposition with applications
- An efficient algorithm for computing the approximate t-URV and its applications
- Fast approximation of matrix coherence and statistical leverage
- Model-free global likelihood subsampling for massive data
- Two-sample testing of high-dimensional linear regression coefficients via complementary sketching
- Single-pass randomized QLP decomposition for low-rank approximation
- Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- Optimal subsampling for softmax regression
- A geometric probability randomized Kaczmarz method for large scale linear systems
- Randomized QLP decomposition
- Lectures on randomized numerical linear algebra
- Stochastic gradients for large-scale tensor decomposition
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Far-field compression for fast kernel summation methods in high dimensions
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Operator Approximation for Processing of Large Random Data Sets
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Sub-sampled Newton methods
- An improvement of the parameterized frequent directions algorithm
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Constructing linear-sized spectral sparsification in almost-linear time
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Single-pass Nyström approximation in mixed precision
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Random sampling of bandlimited signals on graphs
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- A randomized singular value decomposition for third-order oriented tensors
- Minimum cost flow in the CONGEST model
- A bootstrap method for error estimation in randomized matrix multiplication
- Fast matrix multiplication and its algebraic neighbourhood
- Randomized numerical linear algebra: Foundations and algorithms
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- A statistical perspective on randomized sketching for ordinary least-squares
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- A statistical perspective on algorithmic leveraging
- Structure preserving reduced order modeling for gradient systems
- Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition
- Wavelet adaptive proper orthogonal decomposition for large-scale flow data
- Randomized matrix-free trace and log-determinant estimators
- On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Randomized complete pivoting for solving symmetric indefinite linear systems
- Low-Rank Binary Matrix Approximation in Column-Sum Norm.
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- Stochastic configuration network based cascade generalized predictive control of main steam temperature in power plants
- Relations among some low-rank subspace recovery models
- Sharper bounds for regularized data fitting
- Low rank approximation of binary matrices: column subset selection and generalizations
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Sketching as a tool for numerical linear algebra
- Randomized tensor decomposition for large-scale data assimilation problems for carbon dioxide sequestration
- A nonlinear matrix decomposition for mining the zeros of sparse data
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition
- Gaussian random projections for Euclidean membership problems
- More efficient estimation for logistic regression with optimal subsamples
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- Spectral estimation from simulations via sketching
- Optimal Poisson subsampling for softmax regression
- Two-sided randomized algorithms for approximate \(K\)-term t-SVD
- Conditioning of leverage scores and computation by QR decomposition
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Randomized signal processing with continuous frames
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Convexification with bounded gap for randomly projected quadratic optimization
- Numerically safe Gaussian elimination with no pivoting
- Parameterized low-rank binary matrix approximation
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- Newton-type methods for non-convex optimization under inexact Hessian information
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten p-norms
- Utilizing second order information in minibatch stochastic variance reduced proximal iterations
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- 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
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- On approximating matrix norms in data streams
- Robust frequent directions with application in online learning
- Block basis factorization for scalable kernel evaluation
- Subspace Iteration Randomization and Singular Value Problems
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Model order reduction with oblique projections for large scale wave propagation
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Practical sketching algorithms for low-rank matrix approximation
- Error analysis of a model order reduction framework for financial risk analysis
- On the numerical rank of radial basis function kernels in high dimensions
- A literature survey of matrix methods for data science
Describes a project that uses
Uses Software
This page was built for publication: Randomized Algorithms for Matrices and Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117600)
