Computation of maximum likelihood estimates in cyclic structural equation models

From MaRDI portal
Publication:1731051

DOI10.1214/17-AOS1602zbMATH Open1499.62016arXiv1610.03434WikidataQ128584472 ScholiaQ128584472MaRDI QIDQ1731051FDOQ1731051


Authors: Mathias Drton, Christopher Fox, Y. Samuel Wang Edit this on Wikidata


Publication date: 6 March 2019

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Software for computation of maximum likelihood estimates in linear structural equation models typically employs general techniques from non-linear optimization, such as quasi-Newton methods. In practice, careful tuning of initial values is often required to avoid convergence issues. As an alternative approach, we propose a block-coordinate descent method that cycles through the considered variables, updating only the parameters related to a given variable in each step. We show that the resulting block update problems can be solved in closed form even when the structural equation model comprises feedback cycles. Furthermore, we give a characterization of the models for which the block-coordinate descent algorithm is well-defined, meaning that for generic data and starting values all block optimization problems admit a unique solution. For the characterization, we represent each model by its mixed graph (also known as path diagram), which leads to criteria that can be checked in time that is polynomial in the number of considered variables.


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




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Computation of maximum likelihood estimates in cyclic structural equation models

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