Anirban Dasgupta, Supratim Shit, Rachit Chhaya
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the effect of norm based regularization on the size of coresets for regression problems. Specifically, given a matrix A ∈ R n×d with n d and a vector b ∈ R n and λ > 0, we analyze the size of coresets for regularized versions of regression of the form Axb r p + λ x s q . Prior work has shown that for ridge regression (where p, q, r, s = 2) we can obtain a coreset that is smaller than the coreset for the unregularized counterpart i.e. least squares regression [1]. We show that when r = s, no coreset for regularized regression can have size smaller than the optimal coreset of the unregularized version. The well known lasso problem falls under this category and hence does not allow a coreset smaller than the one for least squares regression. We propose a modified version of the lasso problem and obtain for it a coreset of size smaller than the least square regression. We empirically show that the modified version of lasso also induces sparsity in solution, similar to the original lasso. We also obtain smaller coresets for p regression with p regularization. We extend our methods to multi response regularized regression. Finally, we empirically demonstrate the coreset performance for the modified lasso and the 1 regression with 1 regularization.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.05440")
get_code_for_paper("2006.05440")
have("2006.05440")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.05440.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.05440)
Connect an agent — have() is free.