Better Approximate Inference for Partial Likelihood Models with a Latent Structure
Machine Learning
2019-12-20 v2 Machine Learning
Abstract
Temporal Point Processes (TPP) with partial likelihoods involving a latent structure often entail an intractable marginalization, thus making inference hard. We propose a novel approach to Maximum Likelihood Estimation (MLE) involving approximate inference over the latent variables by minimizing a tight upper bound on the approximation gap. Given a discrete latent variable , the proposed approximation reduces inference complexity from to . We use convex conjugates to determine this upper bound in a closed form and show that its addition to the optimization objective results in improved results for models assuming proportional hazards as in Survival Analysis.
Cite
@article{arxiv.1910.10211,
title = {Better Approximate Inference for Partial Likelihood Models with a Latent Structure},
author = {Amrith Setlur and Barnabás Póczós},
journal= {arXiv preprint arXiv:1910.10211},
year = {2019}
}