Maximum likelihood estimation of log-affine models using detailed-balanced reaction networks
A fundamental question in the field of molecular computation is what computational tasks a biochemical system can carry out. In this work, we focus on the problem of finding the maximum likelihood estimate (MLE) for log-affine models. We revisit a construction due to Gopalkrishnan of a mass-action system with the MLE as its unique positive steady state, which is based on choosing a basis for the kernel of the design matrix of the model. We extend this construction to allow for any finite spanning set of the kernel, and explore how the choice of spanning set influences the dynamics of the resulting network, including the existence of boundary steady states, the deficiency of the network, and the rate of convergence. In particular, we prove that using a Markov basis as the spanning set guarantees global stability of the MLE steady state.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
ADIS-GAN: Affine Disentangled GAN
This paper proposes Affine Disentangled GAN (ADIS-GAN), which is a Generative Adversarial Network that can explicitly disentangle affine transformations in a self-supervised and rigorous manner. The objective is inspire…
Generative Adversarial NetworkInductive BiasTranslationMaximum likelihood inference for high-dimensional problems with multiaffine variable relations
Maximum Likelihood Estimation of continuous variable models can be very challenging in high dimensions, due to potentially complex probability distributions. The existence of multiple interdependencies among variables ca…
Uniform Convergence Rates for Maximum Likelihood Estimation under Two-Component Gaussian Mixture Models
We derive uniform convergence rates for the maximum likelihood estimator and minimax lower bounds for parameter estimation in two-component location-scale Gaussian mixture models with unequal variances. We assume the mix…
parameter estimationLarge Margin Learning of Upstream Scene Understanding Models
Upstream supervised topic models have been widely used for complicated scene understanding. However, existing maximum likelihood estimation (MLE) schemes can make the prediction model learning independent of latent topic…
General ClassificationPredictionScene ClassificationScene Understanding+1Composite Likelihood Estimation for Restricted Boltzmann machines
Learning the parameters of graphical models using the maximum likelihood estimation is generally hard which requires an approximation. Maximum composite likelihood estimations are statistical approximations of the maximu…