Pages that link to "Item:Q5025778"

The following pages link to Why Are Big Data Matrices Approximately Low Rank? (Q5025778):

Displaying 41 items.

• Sparse Principal Component Analysis via Variable Projection (Q150980) (← links)
• A Schatten-\(q\) low-rank matrix perturbation analysis via perturbation projection error bound (Q821008) (← links)
• Two sample tests for high-dimensional autocovariances (Q830592) (← links)
• A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction (Q1995941) (← links)
• New applications of matrix methods (Q2038478) (← links)
• Active matrix factorization for surveys (Q2044242) (← links)
• Low phase-rank approximation (Q2074973) (← links)
• An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. II: computing moments and sparse grid acceleration (Q2095529) (← links)
• CDPA: common and distinctive pattern analysis between high-dimensional datasets (Q2137801) (← links)
• On the best approximation algorithm by low-rank matrices in Chebyshev's norm (Q2149032) (← links)
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
• Revisiting the low-rank eigenvalue problem (Q2213691) (← links)
• An efficient numerical method for condition number constrained covariance matrix approximation (Q2242067) (← links)
• A survey on deep matrix factorizations (Q2668399) (← links)
• Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms (Q2668410) (← links)
• Imputation of Mixed Data With Multilevel Singular Value Decomposition (Q3391265) (← links)
• (Q4998890) (← links)
• Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions (Q5043741) (← links)
• Double-Matched Matrix Decomposition for Multi-View Data (Q5057246) (← links)
• FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients (Q5058004) (← links)
• Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
• Approximation Bounds for Sparse Programs (Q5073726) (← links)
• Network Effects in Default Clustering for Large Systems (Q5108926) (← links)
• FANOK: Knockoffs in Linear Time (Q5154638) (← links)
• On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
• Intrinsic Complexity and Scaling Laws: From Random Fields to Random Vectors (Q5197617) (← links)
• Perturbations of CUR Decompositions (Q5857848) (← links)
• On Robustness of Principal Component Regression (Q5881959) (← links)
• Approximate completely positive semidefinite factorizations and their ranks (Q6051147) (← links)
• Pass-efficient randomized LU algorithms for computing low-rank matrix approximation (Q6073724) (← links)
• On the optimal rank-1 approximation of matrices in the Chebyshev norm (Q6084872) (← links)
• A fast diagonal distance metric learning approach for large-scale datasets (Q6092062) (← links)
• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices (Q6094751) (← links)
• Accurate and fast matrix factorization for low-rank learning. (Q6097244) (← links)
• Arithmetic circuits, structured matrices and (not so) deep learning (Q6109070) (← links)
• Optimal Reaction Coordinates: Variational Characterization and Sparse Computation (Q6109132) (← links)
• Fast randomized numerical rank estimation for numerically low-rank matrices (Q6154411) (← links)
• Polynomial whitening for high-dimensional data (Q6178887) (← links)
• On the distance to low-rank matrices in the maximum norm (Q6204176) (← links)