Approximate sparse linear regression
© 2018 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved. In the Sparse Linear Regression (SLR) problem, given a d × n matrix M and a d-dimensional query q, the goal is to compute a k-sparse n-dimensional vector τ such that the error Mτ − q is minimized....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-10-27T20:29:03Z.
|
| Subjects: | |
| Online Access: | Get fulltext |