Subgradient and sampling algorithms for _1 regression
From MaRDI portal
Subgradient and sampling algorithms for \(\ell 1\) regression
Recommendations
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Sampling algorithms for l₂ regression and applications
- A subgradient method based on gradient sampling for solving convex optimization problems
- Sampling Algorithms and Coresets for \ell_p Regression
- Approximating Subdifferentials by Random Sampling of Gradients
- scientific article; zbMATH DE number 5764828
- Proximal gradient methods with adaptive subspace sampling
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Non-asymptotic guarantees for sampling by stochastic gradient descent
Cited in
(23)- Spectral estimation from simulations via sketching
- Adaptive iterative Hessian sketch via A-optimal subsampling
- Learning big (image) data via coresets for dictionaries
- Sampling algorithms for l₂ regression and applications
- Sampling Algorithms and Coresets for \ell_p Regression
- Weighted SGD for _p regression with randomized preconditioning
- Weighted SGD for \(\ell_p\) regression with randomized preconditioning
- Quantile regression for large-scale data via sparse exponential transform method
- Non-negative sparse regression and column subset selection with \(L_1\) error
- Approximate sparse linear regression
- A greedy algorithm for subspace approximation problem
- Iterative refinement for \(\ell_p\)-norm regression
- Analysis of regularized Nyström subsampling for regression functions of low smoothness
- Subsampled Hessian Newton Methods for Supervised Learning
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Optimal subsampling for large‐sample quantile regression with massive data
- Algorithms for approximate sparse regression and nearest induced hulls
- Solution of the EEG inverse problem by random dipole sampling
- New subset selection algorithms for low rank approximation: offline and online
- Efficient subspace approximation algorithms
- Scalable Bayesian p-generalized probit and logistic regression
- How to get close to the median shape
This page was built for publication: Subgradient and sampling algorithms for \(\ell_1\) regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921678)
