Minimax and Communication-Efficient Distributed Best Subset Selection with Oracle Property
<|reference_start|>Minimax and Communication-Efficient Distributed Best Subset Selection with Oracle Property: The explosion of large-scale data in fields such as finance, e-commerce, and social media has outstripped the processing capabilities of single-machine systems, driving the need for distributed statistical inference methods. Traditional approaches to distributed inference often struggle with achieving true sparsity in high-dimensional datasets and involve high computational costs. We propose a novel, two-stage, distributed best subset selection algorithm to address these issues. Our approach starts by efficiently estimating the active set while adhering to the $\ell_0$ norm-constrained surrogate likelihood function, effectively reducing dimensionality and isolating key variables. A refined estimation within the active set follows, ensuring sparse estimates and matching the minimax $\ell_2$ error bound. We introduce a new splicing technique for adaptive parameter selection to tackle subproblems under $\ell_0$ constraints and a Generalized Information Criterion (GIC). Our theoretical and numerical studies show that the proposed algorithm correctly finds the true sparsity pattern, has the oracle property, and greatly lowers communication costs. This is a big step forward in distributed sparse estimation.<|reference_end|>
@article{lan2024minimax,
    title={Minimax and Communication-Efficient Distributed Best Subset Selection
  with Oracle Property},
    author={Jingguo Lan, Hongmei Lin, Xueqin Wang},
    journal={arXiv preprint arXiv:2408.17276},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.17276},
    primaryClass={stat.ML cs.LG}
}