Pages that link to "Item:Q2977306"

The following pages link to Randomized Sketches of Convex Programs With Sharp Guarantees (Q2977306):

Displaying 35 items.

• Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
• High-dimensional model recovery from random sketched data by exploring intrinsic sparsity (Q782446) (← links)
• On principal components regression, random projections, and column subsampling (Q1616329) (← links)
• Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
• Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
• Randomized sketches for kernel CCA (Q1982398) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection (Q2056283) (← links)
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
• Functional principal subspace sampling for large scale functional data analysis (Q2137809) (← links)
• Hierarchical inference for genome-wide association studies: a view on methodology with software (Q2184390) (← links)
• Random projections for quadratic programs (Q2196316) (← links)
• Reduced rank regression with matrix projections for high-dimensional multivariate linear regression model (Q2233570) (← links)
• On nonparametric randomized sketches for kernels with further smoothness (Q2322682) (← links)
• Generic error bounds for the generalized Lasso with sub-exponential data (Q2675193) (← links)
• Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
• On b-bit min-wise hashing for large-scale regression and classification with sparse data (Q4558503) (← links)
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
• Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms (Q4598334) (← links)
• (Q4637040) (← links)
• Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
• Tensor-Structured Sketching for Constrained Least Squares (Q5021024) (← links)
• ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
• Convexification with Bounded Gap for Randomly Projected Quadratic Optimization (Q5080508) (← links)
• RidgeSketch: A Fast Sketching Based Solver for Large Scale Ridge Regression (Q5099418) (← links)
• Structured Random Sketching for PDE Inverse Problems (Q5146630) (← links)
• Sketching for Principal Component Regression (Q5380270) (← links)
• Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning (Q5381126) (← links)
• Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
• Distributed learning for sketched kernel regression (Q6079133) (← links)
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
• Sketched approximation of regularized canonical correlation analysis (Q6096168) (← links)
• Randomized estimation of functional covariance operator via subsampling (Q6541611) (← links)
• Random projections for linear programming: an improved retrieval phase (Q6579780) (← links)
• Random projections for semidefinite programming (Q6619767) (← links)