Constrained regularized regression model search in large sets of regressors

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of regression estimation under a complex of additional assumptions. First, the regression coefficients are assumed to be doubly constrained by individual non-negativity inequalities along with the unit-sum equality. Second, it is assumed that the number of regressors far exceeds that of samples. An additional assumption is that the regression coefficients differ from zero only within a really existing small subset of a large universe of regressors, and the search for this subset (Factor Search) is the main aim of data processing. The latter assumption ensues from the practical problem of recovering the hidden composition of an investment portfolio represented by a time series of its periodic returns (values of relative profitability). However, factor search, i.e., finding a small active subset among a huge set of correlated factors, is problematic unless some a priori information on the expected portfolio structure is available. We propose a regularized regression model based on the assumption that the portfolio under analysis is rationally composed by its administration.

Cite

CITATION STYLE

APA

Krasotkina, O., Markov, M., Mottl, V., Pugach, I., Babichev, D., & Morozov, A. (2018). Constrained regularized regression model search in large sets of regressors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10935 LNAI, pp. 394–408). Springer Verlag. https://doi.org/10.1007/978-3-319-96133-0_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free