Non-Negative Sparse Regression and Column Subset Selection with L1 Error

DOI10.4230/LIPIcs.ITCS.2018.7zbMath1467.62120OpenAlexW2783879635MaRDI QIDQ4993270

Silvio Lattanzi, Aditya Bhaskara

Publication date: 15 June 2021

Full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.7

zbMATH Keywords

sparse regressioncolumn subset selection\(L1\) error optimization

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) General nonlinear regression (62J02) Statistical ranking and selection procedures (62F07)

Cites Work

• Unnamed Item
• A pure \(L_1\)-norm principal component analysis
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• Rates of convex approximation in non-Hilbert spaces
• Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem
• Optimal CUR Matrix Decompositions
• Hidden Cliques and the Certification of the Restricted Isometry Property
• Certifying the Restricted Isometry Property is Hard
• Robust principal component analysis?
• Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
• Interpretable dimension reduction
• Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
• Scale Adaptive Dictionary Learning
• Sparse Approximation via Generating Point Sets
• Low rank approximation with entrywise l ₁ -norm error
• Computing a nonnegative matrix factorization -- provably
• Fast monte-carlo algorithms for finding low-rank approximations
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Optimal Column-Based Low-Rank Matrix Reconstruction
• Robust Statistics

This page was built for publication: Non-Negative Sparse Regression and Column Subset Selection with L1 Error