A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types

From MaRDI portal
Publication:2058766

DOI10.1007/S11222-021-10013-XzbMATH Open1475.62044arXiv1812.02401OpenAlexW3160692825WikidataQ115602838 ScholiaQ115602838MaRDI QIDQ2058766FDOQ2058766

Diederik S. Laman Trip, Wessel N. van Wieringen

Publication date: 9 December 2021

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Computational efficient evaluation of penalized estimators of multivariate exponential family distributions is sought. These distributions encompass among others Markov random fields with variates of mixed type (e.g. binary and continuous) as special case of interest. The model parameter is estimated by maximization of the pseudo-likelihood augmented with a convex penalty. The estimator is shown to be consistent. With a world of multi-core computers in mind, a computationally efficient parallel Newton-Raphson algorithm is presented for numerical evaluation of the estimator alongside conditions for its convergence. Parallelization comprises the division of the parameter vector into subvectors that are estimated simultaneously and subsequently aggregated to form an estimate of the original parameter. This approach may also enable efficient numerical evaluation of other high-dimensional estimators. The performance of the proposed estimator and algorithm are evaluated and compared in a simulation study. Finally, the paper concludes with an illustration of the presented methodology in the reconstruction of the conditional independence network from data of an integrative omics study.


Full work available at URL: https://arxiv.org/abs/1812.02401





Cites Work


Cited In (1)






This page was built for publication: A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058766)