We consider the problem of learning a sparse graph underlying an undirected Gaussian graphical model, a key problem in statistical machine learning. Given $ n $ samples from a …
S Roy, A Tewari - arXiv preprint arXiv:2310.07852, 2023 - arxiv.org
We consider the problem of model selection in a high-dimensional sparse linear regression model under the differential privacy framework. In particular, we consider the problem of …
K Behdin, R Mazumder - arXiv preprint arXiv:2109.11142, 2021 - arxiv.org
We consider the Sparse Principal Component Analysis (SPCA) problem under the well- known spiked covariance model. Recent work has shown that the SPCA problem can be …
R Thompson, F Vahid - Journal of Computational and Graphical …, 2024 - Taylor & Francis
Sparse regression and classification estimators that respect group structures have application to an assortment of statistical and machine learning problems, from multitask …
S Roy, A Tewari, Z Zhu - arXiv preprint arXiv:2201.01508, 2022 - arxiv.org
We study the problem of exact support recovery for high-dimensional sparse linear regression under independent Gaussian design when the signals are weak, rare, and …
In high-dimensional sparse linear regression, the selection and the estimation of the parameters are studied based on an l0− constraint on the direction of the vector of …
S Roy, A Tewari, Z Zhu - arXiv preprint arXiv:2301.06259, 2023 - arxiv.org
For decades, best subset selection (BSS) has eluded statisticians mainly due to its computational bottleneck. However, until recently, modern computational breakthroughs …
K Behdin, P Prastakos… - Privacy Regulation and …, 2024 - pml-workshop.github.io
Differentially Private Best Subset Selection Via Integer Programming Page 1 Differentially Private Best Subset Selection Via Integer Programming Kayhan Behdin, Peter Prastakos …