Search Results for author:
Found 1 papers, 0 papers with code
Distributed Sparse Regression via Penalization
First, we establish statistical consistency of the estimator: under a suitable choice of the penalty parameter, the optimal solution of the penalized problem achieves near optimal minimax rate $\mathcal{O}(s \log d/N)$ in $\ell_2$-loss, where $s$ is the sparsity value, $d$ is the ambient dimension, and $N$ is the total sample size in the network -- this matches centralized sample rates.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
