Pages that link to "Item:Q3117600"

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

Displaying 50 items.

• Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
• Nonparametric stochastic approximation with large step-sizes (Q309706) (← links)
• Wild binary segmentation for multiple change-point detection (Q482881) (← links)
• High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (Q831251) (← links)
• Model order reduction with oblique projections for large scale wave propagation (Q891290) (← links)
• Stable estimation of a covariance matrix guided by nuclear norm penalties (Q1623701) (← links)
• Gaussian random projections for Euclidean membership problems (Q1634768) (← links)
• Random sampling of bandlimited signals on graphs (Q1690709) (← links)
• Sub-sampled Newton methods (Q1739039) (← links)
• An improvement of the parameterized frequent directions algorithm (Q1741237) (← links)
• Energy preserving model order reduction of the nonlinear Schrödinger equation (Q1756920) (← links)
• On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems (Q1988352) (← links)
• A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
• Randomized model order reduction (Q2000522) (← links)
• Structure preserving reduced order modeling for gradient systems (Q2008502) (← links)
• Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition (Q2009116) (← links)
• Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation (Q2027783) (← links)
• Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms (Q2029823) (← links)
• Geometric component analysis and its applications to data analysis (Q2036489) (← links)
• An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
• Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection (Q2056283) (← links)
• Randomized signal processing with continuous frames (Q2066256) (← links)
• Model-free global likelihood subsampling for massive data (Q2104012) (← links)
• Two-sample testing of high-dimensional linear regression coefficients via complementary sketching (Q2105203) (← links)
• Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
• Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
• A probabilistic algorithm for aggregating vastly undersampled large Markov chains (Q2115692) (← links)
• Wavelet adaptive proper orthogonal decomposition for large-scale flow data (Q2124744) (← links)
• Spectral estimation from simulations via sketching (Q2133499) (← links)
• Error analysis of a model order reduction framework for financial risk analysis (Q2153946) (← links)
• Randomized quaternion QLP decomposition for low-rank approximation (Q2162234) (← links)
• An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
• Sketch-based empirical natural gradient methods for deep learning (Q2162326) (← links)
• Randomized QLP decomposition (Q2176120) (← links)
• Robust manifold broad learning system for large-scale noisy chaotic time series prediction: a perturbation perspective (Q2185604) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Parameterized low-rank binary matrix approximation (Q2218414) (← links)
• Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
• Editorial: Randomized algorithms for training neural networks (Q2282872) (← links)
• A randomized balanced proper orthogonal decomposition technique (Q2292020) (← links)
• Insights into randomized algorithms for neural networks: practical issues and common pitfalls (Q2292952) (← links)
• A consistency theorem for randomized singular value decomposition (Q2307419) (← links)
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint (Q2309252) (← links)
• Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks (Q2329831) (← links)
• Numerically safe Gaussian elimination with no pivoting (Q2359570) (← links)
• Energy landscape for large average submatrix detection problems in Gaussian random matrices (Q2363657) (← links)
• Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)