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)- Sparse principal component analysis via variable projection
- Stable estimation of a covariance matrix guided by nuclear norm penalties
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition
- Gaussian random projections for Euclidean membership problems
- Random sampling of bandlimited signals on graphs
- Sub-sampled Newton methods
- An improvement of the parameterized frequent directions algorithm
- Energy preserving model order reduction of the nonlinear Schrödinger equation
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- A geometric probability randomized Kaczmarz method for large scale linear systems
- Randomized model order reduction
- 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
- 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
- Geometric component analysis and its applications to data analysis
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection
- Randomized signal processing with continuous frames
- 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
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- Wavelet adaptive proper orthogonal decomposition for large-scale flow data
- Spectral estimation from simulations via sketching
- Error analysis of a model order reduction framework for financial risk analysis
- Randomized quaternion QLP decomposition for low-rank approximation
- An efficient algorithm for computing the approximate t-URV and its applications
- Sketch-based empirical natural gradient methods for deep learning
- Randomized QLP decomposition
- Robust manifold broad learning system for large-scale noisy chaotic time series prediction: a perturbation perspective
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- Adaptive iterative Hessian sketch via A-optimal subsampling
- Newton-type methods for non-convex optimization under inexact Hessian information
- Parameterized low-rank binary matrix approximation
- Randomized algorithms for the low multilinear rank approximations of tensors
- Editorial: Randomized algorithms for training neural networks
- A randomized balanced proper orthogonal decomposition technique
- Insights into randomized algorithms for neural networks: practical issues and common pitfalls
- A consistency theorem for randomized singular value decomposition
- Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Numerically safe Gaussian elimination with no pivoting
- Energy landscape for large average submatrix detection problems in Gaussian random matrices
- Far-field compression for fast kernel summation methods in high dimensions
- Randomized matrix-free trace and log-determinant estimators
- Optimal subsampling for softmax regression
- Randomized generalized singular value decomposition
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- A randomized singular value decomposition for third-order oriented tensors
- Tikhonov regularization and randomized GSVD
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Sketching as a tool for numerical linear algebra
- A statistical perspective on randomized sketching for ordinary least-squares
- Nonparametric stochastic approximation with large step-sizes
- Randomized local model order reduction
- Core-sets: updated survey
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Randomized complete pivoting for solving symmetric indefinite linear systems
- Reverse iterative volume sampling for linear regression
- Fast MCMC sampling algorithms on polytopes
- 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
- Constructing linear-sized spectral sparsification in almost-linear time
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Randomized algorithms in numerical linear algebra
- Practical sketching algorithms for low-rank matrix approximation
- Literature survey on low rank approximation of matrices
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Fast matrix multiplication and its algebraic neighbourhood
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- A bootstrap method for error estimation in randomized matrix multiplication
- Utilizing second order information in minibatch stochastic variance reduced proximal iterations
- Robust frequent directions with application in online learning
- scientific article; zbMATH DE number 6860845 (Why is no real title available?)
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- On the numerical rank of radial basis function kernels in high dimensions
- Wild binary segmentation for multiple change-point detection
- Using randomization to make recursive matrix algorithms practical
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Randomized sketching algorithms for low-memory dynamic optimization
- Sharper bounds for regularized data fitting
- Parameterized low-rank binary matrix approximation
- Low rank approximation of binary matrices: column subset selection and generalizations
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Stochastic gradients for large-scale tensor decomposition
- scientific article; zbMATH DE number 7625175 (Why is no real title available?)
- Smoothing Splines Approximation Using Hilbert Curve Basis Selection
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model
- A nonlinear matrix decomposition for mining the zeros of sparse data
- Convexification with bounded gap for randomly projected quadratic optimization
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
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)
