Approximate Profile Maximum Likelihood

12/19/2017
by   Dmitri S. Pavlichin, et al.
0

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML has appealing theoretical properties, but is difficult to compute exactly. Inspired by observations gleaned from exactly solvable cases, we look for an approximate PML solution, which, intuitively, clumps comparably frequent symbols into one symbol. This amounts to lower-bounding a certain matrix permanent by summing over a subgroup of the symmetric group rather than the whole group during the computation. We extensively experiment with the approximate solution, and find the empirical performance of our approach is competitive and sometimes significantly better than state-of-the-art performance for various estimation problems.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/11/2012

On Modeling Profiles instead of Values

We consider the problem of estimating the distribution underlying an obs...
11/05/2020

Instance Based Approximations to Profile Maximum Likelihood

In this paper we provide a new efficient algorithm for approximately com...
12/04/2017

Stochastic Maximum Likelihood Optimization via Hypernetworks

This work explores maximum likelihood optimization of neural networks th...
04/30/2019

On the parameter estimation of ARMA(p,q) model by approximate Bayesian computation

In this paper, the parameter estimation of ARMA(p,q) model is given by a...
12/16/2013

Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs

We present an asymptotic analysis of Viterbi Training (VT) and contrast ...
02/24/2021

Maximum Likelihood Constraint Inference from Stochastic Demonstrations

When an expert operates a perilous dynamic system, ideal constraint info...
05/18/2018

Accurate Kernel Learning for Linear Gaussian Markov Processes using a Scalable Likelihood Computation

We report an exact likelihood computation for Linear Gaussian Markov pro...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.