--- title: 'missoNet: Convex Framework for mQTL Analysis' url: https://www.emergentmind.com/topics/missonet type: topic --- # missoNet: Convex Framework for mQTL Analysis Searching arXiv for the specified paper and closely related context papers so the article can be grounded in current literature. missoNet is a convex, three-stage estimation framework for multivariate regression with missing response data that was introduced for sequencing-based regional DNA methylation QTL analysis. It jointly estimates a sparse regression coefficient matrix for cis SNP effects and a sparse precision matrix for residual dependence among CpG sites, thereby modeling both genetic regulation and conditional dependence within CpG blocks. Its central methodological feature is the use of unbiased surrogate statistics for masked responses, which avoids imputation while preserving convexity at each optimization stage and enabling non-asymptotic error guarantees under stated assumptions [2507.05990]. ## 1. Statistical setting and inferential target missoNet is formulated for regional mQTL analysis in which responses are transformed methylation levels at multiple CpGs within a genomic region and predictors are nearby cis SNP genotypes. The multivariate response formulation is motivated by the observation that treating a block of CpGs as a joint outcome can increase power and reveal coordinated regulation across CpGs. With \(n\) samples, \(p\) SNPs, and \(q\) CpGs, the model is \[ \mathbf{Y} = \mathbf{X}\mathbf{B}^{*} + \boldsymbol{\varepsilon}, \] where \(\mathbf{X}\in\mathbb{R}^{n\times p}\) has standardized columns, \(\mathbf{Y}\in\mathbb{R}^{n\times q}\), and \(\boldsymbol{\varepsilon}\in\mathbb{R}^{n\times q}\) satisfies \(\mathbb{E}(\boldsymbol{\varepsilon}\mid \mathbf{X})=\mathbf{0}\) and \(\mathrm{Cov}(\boldsymbol{\varepsilon}\mid \mathbf{X})=\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*}\). The residual precision matrix is \(\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*}=(\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*})^{-1}\). The two primary estimands are the sparse coefficient matrix \(\mathbf{B}^{*}\), which encodes SNP-to-CpG effects, and the sparse precision matrix \(\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*}\), whose zero off-diagonal entries encode conditional independences among CpGs under multivariate normality. This joint estimation problem places missoNet in direct continuity with multivariate regression and Gaussian graphical modeling, but specialized to the response-missingness regime that arises in bisulfite sequencing data. A key feature of the setup is that missingness affects the responses rather than the predictors. The observed matrix is \[ \mathbf{Z}=\mathbf{Y}\odot \mathbf{W}, \] where \(w_{ij}\sim \mathrm{Bernoulli}(1-\rho_j)\) independently across rows, with column-specific missing rates \(\rho_j\). The framework therefore assumes missing completely at random (MCAR) for responses. This assumption is structurally important because the unbiased surrogate constructions and the associated theory are derived under precisely this masking model [2507.05990]. ## 2. Surrogate covariance construction under response missingness The central obstacle is that the empirical response covariance \(S_{yy}=(1/n)\mathbf{Y}^{\top}\mathbf{Y}\) and cross-covariance \(S_{xy}=(1/n)\mathbf{X}^{\top}\mathbf{Y}\) are unavailable when \(\mathbf{Y}\) is partially masked. Pairwise deletion and imputation-based strategies can yield biased or indefinite covariance estimates, which is particularly problematic when the downstream objective includes a log-determinant term. missoNet addresses this by replacing unavailable complete-data quantities with unbiased surrogates corrected by the first and second moments of the mask. The mask moments are \[ \mathbb{E}[W]=[(1-\rho_{1}),\cdots,(1-\rho_{q})]^{\top}, \] and \[ \mathbb{E}[WW^{\top}]_{ij}= \begin{cases} (1-\rho_i)(1-\rho_j), & i\neq j,\\ (1-\rho_i), & i=j. \end{cases} \] Using these quantities, missoNet defines \[ \widehat{S}_{yy}\coloneqq\frac{1}{n}Z^{\top}Z\oslash\mathbb{E}[WW^{\top}],\qquad \widehat{S}_{xy}\coloneqq\frac{1}{n}X^{\top}Z\oslash[\mathbb{E}[W],...,\mathbb{E}[W]]^{\top}. \] Under MCAR, these are unbiased for \(\mathbb{E}[YY^{\top}]\) and \(\mathbb{E}[XY^{\top}]\). The predictor covariance remains the standard \[ S_{xx}=(1/n)\mathbf{X}^{\top}\mathbf{X}, \] because predictors are fully observed. These surrogate statistics are then substituted into a missing-data analogue of the MRCE objective. For complete data, MRCE minimizes a penalized Gaussian likelihood in \((\boldsymbol{\Theta},\mathbf{B})\). missoNet replaces \(S_{yy}\) and \(S_{xy}\) with \(\widehat{S}_{yy}\) and \(\widehat{S}_{xy}\), yielding the surrogate objective \[ Q(\boldsymbol{\Theta},\mathbf{B})\coloneqq \mathrm{Tr}\Big[\frac{1}{2}(\widehat{S}_{yy}-2\widehat{S}_{xy}^{\top}\mathbf{B}+\mathbf{B}^{\top}\mathbf{S}_{xx}\mathbf{B})\boldsymbol{\Theta}\Big] -\frac{1}{2}\log\det(\boldsymbol{\Theta}) +\lambda_{\boldsymbol{\Theta}}\|\boldsymbol{\Theta}\|_{1,\mathrm{off}} +\lambda_{\mathbf{B}}\|\mathbf{B}\|_{1,1}. \] This objective is convex in either \(\mathbf{B}\) or \(\boldsymbol{\Theta}\) when the other is fixed, provided the covariance input is positive semidefinite. The positive-semidefiniteness issue is therefore not peripheral but fundamental to the design of the full algorithm [2507.05990]. ## 3. Three-stage convex estimation procedure missoNet solves the surrogate problem through three sequential convex programs. The staged design separates sparse regression initialization, residual-network estimation, and coefficient refinement using the learned residual precision structure. | Stage | Optimization target | Computational strategy | |---|---|---| | I | Initial \(\widehat{\mathbf{B}^{(1)}}\) with \(\boldsymbol{\Theta}=\mathbf{I}\) | Column-wise Lasso via coordinate descent or proximal gradient | | II | \(\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}\) from PSD-corrected residual covariance | PSD projection, then graphical Lasso with GLASSO or QUIC | | III | Refined \(\widehat{\mathbf{B}^{(2)}}\) with fixed \(\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}\) | FISTA with Nesterov acceleration and backtracking | Stage I fixes \(\boldsymbol{\Theta}=\mathbf{I}\) and solves \[ \widehat{\mathbf{B}^{(1)}}= \arg\min_{\mathbf{B}} \Big\{ \mathrm{Tr}(\mathbf{B}^{\top}\mathbf{S}_{xx}\mathbf{B}/2-\widehat{S}_{xy}^{\top}\mathbf{B}) +\lambda_{\mathbf{B}}\|\mathbf{B}\|_{1,1} \Big\}. \] This decomposes column-wise. For each response \(l\), \[ \widehat{\boldsymbol{\beta}_{l}}= \arg\min_{\boldsymbol{\beta}\in\mathbb{R}^{p}} \mathcal{L}_{l}(\boldsymbol{\beta})+\lambda_l\|\boldsymbol{\beta}\|_1, \qquad \mathcal{L}_{l}(\boldsymbol{\beta})= \boldsymbol{\beta}^{\top}\mathbf{S}_{xx}\boldsymbol{\beta}/2- \{(\widehat{S}_{xy})_{\bullet l}\}^{\top}\boldsymbol{\beta}. \] Stage II constructs a plug-in residual covariance \[ \widehat{S}_{\varepsilon\varepsilon}\coloneqq \widehat{S}_{yy}-\widehat{\mathbf{B}^{(1)\top}}S_{xx}\widehat{\mathbf{B}^{(1)}}. \] Because \(\widehat{S}_{\varepsilon\varepsilon}\) may be indefinite under missingness, directly solving a graphical Lasso objective can be non-convex or unbounded. missoNet therefore projects it to the nearest positive semidefinite matrix in max norm: \[ \widetilde{S}_{\varepsilon\varepsilon}\coloneqq \underset{\mathbf{K}\succeq0}{\mathrm{argmin}} \|\widehat{S}_{\varepsilon\varepsilon}-\mathbf{K}\|_{\max}, \] and then estimates the precision matrix by \[ \widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}= \arg\min_{\boldsymbol{\Theta}\succeq\mathbf{0}} \Big\{ \mathrm{Tr}(\widetilde{S}_{\varepsilon\varepsilon}\boldsymbol{\Theta}) -\log\det(\boldsymbol{\Theta}) +\lambda_{\boldsymbol{\Theta}}\|\boldsymbol{\Theta}\|_{1,\mathrm{off}} \Big\}. \] Stage III refines the coefficient matrix with \(\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}\) fixed: \[ \widehat{\mathbf{B}^{(2)}}= \arg\min_{\mathbf{B}} \Big\{ \mathrm{Tr}\big[ (\mathbf{B}^{\top}\mathbf{S}_{xx}\mathbf{B}/2-\widehat{S}_{xy}^{\top}\mathbf{B}) \widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}} \big] +\lambda_{\mathbf{B}}\|\mathbf{B}\|_{1,1} \Big\}. \] The implementation uses FISTA with Nesterov acceleration and backtracking line search. The iterative updates are \[ \begin{aligned} \mathbf{V}_{k} &= \widehat{\mathbf{B}^{(2)}_{k-1}}+ \frac{k-2}{k+1} (\widehat{\mathbf{B}^{(2)}_{k-1}}-\widehat{\mathbf{B}^{(2)}_{k-2}}),\\ \widehat{\mathbf{B}^{(2)}_{k}} &= \mathrm{prox}_{t_k} \Big( \mathbf{V}_k- 2t_k(\mathbf{S}_{xx}\mathbf{V}_k-\widehat{\mathbf{S}_{xy}}) \widehat{\mathbf{\Theta}_{\varepsilon\varepsilon}} \Big), \end{aligned} \] with soft-thresholding \[ \mathrm{prox}_{t_k}(v_{ij})= \mathrm{sign}(v_{ij})\cdot(|v_{ij}|-\lambda_{\mathbf{B}}t_k)_{+}. \] The Armijo condition is used for backtracking, and the convergence rate improves from \(\mathcal{O}(1/k)\) to \(\mathcal{O}(1/k^2)\). This staged decomposition suggests that missoNet is designed less as a monolithic block-coordinate routine than as a sequence of convex subproblems with carefully controlled inputs [2507.05990]. ## 4. Tuning, assumptions, and theoretical guarantees missoNet supports both BIC-style tuning and cross-validation. The joint BIC for selecting \((\lambda_{\mathbf{B}},\lambda_{\boldsymbol{\Theta}})\) is \[ \mathrm{BIC}(\widehat{\mathbf{B}},\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}) = 2 n\, \mathrm{Tr}\big[ \widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}} (\widehat{\mathbf{B}^{\top}S_{xx}\widehat{\mathbf{B}}}/2-\widehat{S}_{xy}^{\top}\widehat{\mathbf{B}}) \big] -n \log\det(\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}) +\log n \Big\{ q + \sum_{i0. \] Under the stated deviation bounds and tuning condition \(\lambda_l\geq C(\sigma_W,\sigma_\varepsilon)\sqrt{\frac{\log p}{n}}\), Proposition 1 yields \[ \|\widehat{\boldsymbol{\beta}_{l}}-\boldsymbol{\beta}_{l}^{*}\|_{2} \leq 3\sqrt{\frac{s_l\lambda_l}{\kappa_l}}, \qquad \|\widehat{\boldsymbol{\beta}_{l}}-\boldsymbol{\beta}_{l}^{*}\|_{1} \leq 12\,\frac{s_l\lambda_l}{\kappa_l}. \] Stage II adds an irrepresentability condition for graph selection, expressed through the Kronecker matrix \(\mathbf{\Gamma}=\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*}\otimes\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*}\). After PSD projection, the residual covariance obeys \[ \|\widetilde{S}_{\varepsilon\varepsilon}-\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*}\|_{\max} \leq 2\,\|\widehat{S}_{\varepsilon\varepsilon}-\boldsymbol{\Sigma}_{\varepsilon\varepsilon}^{*}\|_{\max} \leq 2\Delta. \] With \(\lambda_{\boldsymbol{\Theta}}=8\Delta/\alpha\), Proposition 2 gives \[ \|\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}-\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*}\|_{\max} \leq \left\{ 2\kappa_{\mathbf{\Gamma}}(1+\tfrac{8}{\alpha}) \right\}\Delta, \] and \[ \|\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}-\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*}\|_{2} \leq d_q\,\Delta_{\infty}(\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*}). \] Stage III assumes a restricted eigenvalue condition for the refined matrix loss, \[ \mathcal{E}\mathcal{L}(\mathbf{\Delta},\mathbf{B}^{*})\geq \kappa\|\mathbf{\Delta}\|_{F}^{2} \quad \forall\,\mathbf{\Delta}\in\mathbb{C}(S), \] and defines \[ \kappa'=\kappa-\|S_{xx}\|_2\,\Delta_1(\boldsymbol{\Theta}_{\varepsilon\varepsilon}^{*})/2. \] Theorem 1 then gives \[ \|\widehat{\mathbf{B}^{(2)}}-\mathbf{B}^{*}\|_{F} \leq 3\sqrt{\frac{s\,\lambda_{\mathbf{B}}}{\kappa'}}, \qquad \|\widehat{\mathbf{B}^{(2)}}-\mathbf{B}^{*}\|_{1,1} \leq 12\,\frac{s\,\lambda_{\mathbf{B}}}{\kappa'}. \] The theory is explicitly tied to the assumptions that response missingness is MCAR, errors are sub-Gaussian, columns of \(\mathbf{X}\) are standardized, and the missingness rates \(\rho_j\) are estimated from data to compute \(\mathbb{E}[W]\) and \(\mathbb{E}[WW^{\top}]\). This suggests that the guarantees are strong within the paper’s formal regime, but are not advertised as covering more general missing-data mechanisms [2507.05990]. ## 5. Empirical behavior in simulations and CARTaGENE mQTL analysis The simulation studies examine both scaling behavior and direct method comparison. Under AR(1) errors and MCAR masks, Stage I error \(\|\widehat{\boldsymbol{\beta}_l}-\boldsymbol{\beta}^{*}_l\|_2\) decreases at \(1/\sqrt{n}\), increases with \(\sqrt{\log p}\), and grows with missingness \(\rho_W\). Stage II precision error \(\|\widehat{\boldsymbol{\Theta}}-\boldsymbol{\Theta}^{*}\|_{\max}\) scales like \(1/\sqrt{n}\) and grows with missingness and response dimension \(q\). Stage III coefficient error \(\|\widehat{\mathbf{B}^{(2)}}-\mathbf{B}^{*}\|_F\) improves over Stage I uniformly and scales like \(1/\sqrt{n}\) and \(\sqrt{\log p}\), with clearer benefits when residual correlation \(\rho_\varepsilon\) is high. For \(q=20\), at \(n=400\) and \(\rho_{\varepsilon}=0.9\), the Stage I error is \(1.841\,(0.013)\) versus Stage III \(0.982\,(0.007)\); at \(n=12800\), the corresponding values are \(0.351\,(0.004)\) versus \(0.149\,(0.001)\). The paper also notes that at \(30\%\) missingness with small \(n\), Stage III may underperform Stage I, but improves with larger \(n\). Across comparative experiments involving MRCE, Lasso, cglasso, and missoNet variants, missoNet [cv.min] consistently achieves the lowest prediction error for \(\mathbf{B}^{*}\). In Model 1 with \(1\%\) missingness, the reported prediction errors are missoNet \(0.187\,(0.004)\), MRCE \(0.232\,(0.004)\), and Lasso \(0.471\,(0.007)\). For network estimation, missoNet [BIC] often attains the lowest KLL; for example, in Model 2 with \(1\%\) missingness, the reported KLL is \(2.248\,(0.035)\). For sparsity recovery of \(\mathbf{B}^{*}\), missoNet [cv.1se] yields high TPR, excellent TNR, and top MCC; in Model 1 with \(1\%\) missingness, the reported TNR is \(0.988\) and MCC is \(0.870\). Computation is also favorable: missoNet [BIC] is reported as fast due to convex programs, warm starts, local search, and parallelization, whereas MRCE is slow in all settings and cglasso is generally slower, becoming faster only in some high-dimensional instances. The real-data analysis uses 202 adults from CARTaGENE with targeted bisulfite sequencing methylomes. Preprocessing regressed CpG methylation residuals on cohort, ACPA status, age, sex, and a cell composition proxy. Residuals were grouped into 62 candidate CpG regions, and nearby SNPs within \(\pm 250\) kb were considered after an initial univariate screen at \(\mathrm{FDR}<0.10\). Training used 115 high-depth samples and independent validation used 87 earlier samples. Average missingness was approximately \(12\%\) in training and \(28\%\) in validation, with an additional \(5\%\) MCAR masking applied on complete CpGs for robustness. On validation, missoNet [cv.1se] achieved the best mean squared prediction error: - missoNet [cv.1se]: \(0.149\,(0.019)\) - Lasso [cv.1se]: \(0.156\,(0.019)\) - MRCE [cv.min]: \(0.152\,(0.017)\) - cglasso [BIC]: \(0.176\,(0.023)\) For out-of-sample log-likelihood, cglasso [BIC] had the highest value at \(17.092\,(3.218)\) but the worst MSE, while missoNet [BIC] achieved \(15.081\,(3.292)\) with over-dense networks and missoNet [cv.1se] achieved \(8.196\,(1.997)\), which the study characterizes as balancing fit and parsimony. False discovery checks using 10 synthetic null SNPs per region showed that missoNet [cv.1se] attained \[ \mathrm{P}(\widehat{\mathbf{B}}^{\text{true}})/\mathrm{P}(\widehat{\mathbf{B}}^{\text{null}})=12.536, \] with \(\mathrm{P}(\widehat{\mathbf{B}}^{\text{null}})=0.011\) and \(\mathrm{P}(\widehat{\mathbf{B}}^{\text{true}})=0.137\). By contrast, Lasso [cv.min] retained many dummy SNPs, with \(\mathrm{P}(\widehat{\mathbf{B}}^{\text{null}})=0.202\). Across 9,238 CpG-SNP pairs tested in 16 illustrative regions, missoNet [cv.1se] selected 957 nonzero associations, of which 841 (\(87.88\%\)) matched known mQTLs from Gaunt et al. 2016 or involved CpGs within 100 bp of known mQTL sites. Some regions had no associations, including chr20:32,255,222–32,255,294, while others, including chr1:8,958,863–8,959,033, yielded novel candidates for follow-up [2507.05990]. ## 6. Software implementation, operational guidance, and scope missoNet is available as an R package on CRAN via `install.packages("missoNet")`. The package takes fully observed \(\mathbf{X}\in\mathbb{R}^{n\times p}\) with standardized columns and \(\mathbf{Z}\in\mathbb{R}^{n\times q}\) with missing responses set to zero, together with a mask or inferred missingness probabilities \(\widehat{\rho}_j\). It internally computes \(\widehat{S}_{yy}\), \(\widehat{S}_{xy}\), and \(S_{xx}\). The principal outputs are \(\widehat{\mathbf{B}^{(1)}}\), \(\widetilde{S}_{\varepsilon\varepsilon}\), \(\widehat{\boldsymbol{\Theta}_{\varepsilon\varepsilon}}\), and \(\widehat{\mathbf{B}^{(2)}}\), along with fit diagnostics such as BIC grids, cross-validation errors, and plotting utilities including a BIC heatmap. Tuning can be specified by `"cv"` or `"BIC"`, with options including `nlambda`, `lambda.min.ratio`, warm starts, `fast=TRUE` for local search, and `parallel=TRUE` for parallelization [2507.05990]. The package defines maximal regularization values as \[ \lambda_{\boldsymbol{\Theta}}^{\max}=\max_{k\neq k'}|\widetilde{s}_{kk'}|, \qquad \lambda_{\mathbf{B}}^{\max}=\|2\widehat{\mathbf{S}_{xy}}\|_{\max}, \] and then constructs logarithmic sequences to smaller values. Operationally, Stage I consists of \(q\) independent Lasso fits, Stage II uses graphical Lasso on the PSD-corrected residual covariance, and Stage III uses FISTA with backtracking and stopping criteria based on the Armijo condition and relative change thresholds. The paper emphasizes that warm starts, local search, and parallelization reduce runtime substantially, with missoNet [BIC] being the fastest setting and cross-validation trading additional cost for generalizability. Several limitations are explicit. The missingness model is MCAR for responses; the theory assumes sub-Gaussian errors, restricted eigenvalue conditions, and irrepresentability for graph selection; and estimation of the column-specific missing rates \(\rho_j\) is required. The empirical studies further indicate that very high missing rates, such as at least \(30\%\), combined with small sample size can limit the gains of Stage III refinement. A plausible implication is that missoNet is best matched to moderate-to-high-dimensional genomic settings where missingness is substantial but not overwhelming, and where conditional dependence among responses is biologically meaningful. The name has a separate usage in collider-physics literature: the DeepMET study refers to a “missoNet”-style per-particle weighting design for missing transverse momentum estimation, which is distinct from the genomic regression framework described here [2509.12012]. Source: https://www.emergentmind.com/topics/missonet