1. How can multi-modal block-wise missing data be handled in multi-response regression models?
In this paper, a multi-response regression model for block-wise missing data is proposed. The method includes two steps: estimating the covariance and cross-covariance matrices using all available observations without imputation, and using a penalized approach to estimate the sparse regression coefficient matrix and the precision matrix of the error terms simultaneously. This method allows missing values in both responses and predictors and considers correlations among responses. It also handles the case where no subject has complete observations. Theoretical properties, simulation studies, and a multi-modal ADNI data example are presented to demonstrate the effectiveness of the proposed method.
read more
2. What is the problem setup in multi-response linear regression model?
The problem setup in multi-response linear regression model involves Y = XB * + E, where B * = (b jk ) R pxq is an unknown p x q parameter matrix, Y = (y 1, . . ., y n ) is the n x q response matrix, X = (x 1, . . ., x n ) is the n x p design matrix, and E = (1, . . ., n) is the n x q error matrix. The predictors are assumed to come from multiple modalities with p k predictors in the k-th modality. X has block-missing values, and elements of Y can also be missing. The errors i = (i1, . . ., iq) for i = 1, . . ., n are i.i.d. realizations from a random vector with zero mean and covariance matrix S = (s EE ij ) R qxq. The notation used includes S dxd + for sets of d x d symmetric positive-definite matrices, tr(C) for the trace of a square matrix C, diag(C) for the diagonal matrix of C, and various norms and eigenvalues for matrices A.
read more
3. What is the proposed Multi-DISCOM method in the context of multi-response linear regression models?
The proposed Multi-DISCOM method is a two-step weighted LASSO approach that aims to improve the predictive performance of multi-response linear regression models. It incorporates the correlations between responses by solving an optimization problem that simultaneously estimates B* and C*. The method is represented by the equation (B, C) = arg min CS qxq + ,B tr C SYY + CB SXX B - 2CB SXY +l B B 1 + l C C 1 - log det C. When l C is large enough, the method reduces to the separate LASSO. For univariate response regression problems, it reduces to the DISCOM algorithm, and for cases with no missing entries, it reduces to the sparse conditional Gaussian graphical model. The proposed method has been shown to have better estimation performance than the two-step weighted LASSO and the separate LASSO, as demonstrated by the toy example in Section 2.2.1.
read more
4. What is the computational algorithm for solving optimization problem (2.5)?
The computational algorithm for solving optimization problem (2.5) involves an alternating minimization method. Starting with initial points (B0, C0), at each iteration, the algorithm solves two subproblems: Bt = arg min B tr Ct-1 SY Y + Ct-1 B SXX B - 2 Ct-1 B SXY + l B B 1 and Ct = arg min CS qxq + tr C SY Y + C B t-1 SXX Bt-1 - 2C B t-1 SXY + l C C 1 - log det C. The quadratic subproblem for Bt is solved using the coordinate descent algorithm, while the graphical lasso method is used for Ct. The algorithm iterates until a convergence threshold is reached, updating Bt and Ct accordingly.
read more