Better subset regression

Shifeng Xiong

Biometrika, 2014, vol. 101, issue 1, 71-84

Abstract: This paper studies the relationship between model fitting and screening performance to find efficient screening methods for high-dimensional linear regression models. Under a sparsity assumption we show in a general asymptotic setting that a subset that includes the true submodel always yields a smaller residual sum of squares than those that do not. To seek such a subset, we consider the optimization problem associated with best subset regression. An em algorithm, known as orthogonalizing subset screening, and its accelerated version are proposed for searching for the best subset. Although the algorithms do not always find the best subset, their monotonicity makes the subset fit the data better than initial subsets, and thus the subset can have better screening performance asymptotically. Simulation results show that our methods are very competitive.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1093/biomet/ast041 (application/pdf)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:oup:biomet:v:101:y:2014:i:1:p:71-84.

Ordering information: This journal article can be ordered from
https://academic.oup.com/journals

Access Statistics for this article

Biometrika is currently edited by Paul Fearnhead

More articles in Biometrika from Biometrika Trust Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK.
Bibliographic data for series maintained by Oxford University Press ().