Pages that link to "Item:Q2921678"

The following pages link to Subgradient and sampling algorithms for \(\ell_1\) regression (Q2921678):

Displaying 16 items.

• Efficient subspace approximation algorithms (Q664540) (← links)
• How to get close to the median shape (Q870425) (← links)
• Spectral estimation from simulations via sketching (Q2133499) (← links)
• Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
• Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
• The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
• Weighted SGD for <i>ℓ_p</i> Regression with Randomized Preconditioning (Q4575618) (← links)
• Quantile regression for large-scale data via sparse exponential transform method (Q4613926) (← links)
• Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
• A Greedy Algorithm for Subspace Approximation Problem (Q5116494) (← links)
• Analysis of regularized Nyström subsampling for regression functions of low smoothness (Q5236751) (← links)
• Subsampled Hessian Newton Methods for Supervised Learning (Q5380307) (← links)
• (Q5743480) (← links)
• Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm (Q5962728) (← links)
• Optimal subsampling for large‐sample quantile regression with massive data (Q6059454) (← links)
• Solution of the EEG inverse problem by random dipole sampling (Q6136776) (← links)