Pages that link to "Item:Q3117600"

The following pages link to Randomized Algorithms for Matrices and Data (Q3117600):

Displaying 50 items.

• Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
• Randomized matrix-free trace and log-determinant estimators (Q2408935) (← links)
• Optimal subsampling for softmax regression (Q2423180) (← links)
• Randomized generalized singular value decomposition (Q2667344) (← links)
• Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem (Q2679692) (← links)
• A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
• The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
• Tikhonov regularization and randomized GSVD (Q2813331) (← links)
• Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
• ASKIT: an efficient, parallel library for high-dimensional kernel summations (Q2830640) (← links)
• Randomized Local Model Order Reduction (Q3174769) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems (Q4556022) (← links)
• (Q4558165) (← links)
• (Q4558208) (← links)
• On b-bit min-wise hashing for large-scale regression and classification with sparse data (Q4558503) (← links)
• (Q4558555) (← links)
• Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
• Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation (Q4584924) (← links)
• Randomized algorithms in numerical linear algebra (Q4594242) (← links)
• Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
• Literature survey on low rank approximation of matrices (Q4603753) (← links)
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
• Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
• Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms (Q4615298) (← links)
• (Q4633019) (← links)
• (Q4633029) (← links)
• (Q4633051) (← links)
• (Q4633055) (← links)
• (Q4633059) (← links)
• (Q4637072) (← links)
• Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
• On the Numerical Rank of Radial Basis Function Kernels in High Dimensions (Q4644416) (← links)
• Using randomization to make recursive matrix algorithms practical (Q4948004) (← links)
• (Q4969055) (← links)
• Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
• Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
• Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
• (Q5005143) (← links)
• Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning (Q5006445) (← links)
• Sublinear Cost Low Rank Approximation via Subspace Sampling (Q5014667) (← links)
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
• (Q5054620) (← links)
• Smoothing Splines Approximation Using Hilbert Curve Basis Selection (Q5057090) (← links)
• Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
• LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model (Q5066455) (← links)
• A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data (Q5070506) (← links)