English

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 ZZ, the proposed approximation reduces inference complexity from O(Zc)O(|Z|^c) to O(Z)O(|Z|). 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.

Keywords

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}
}
R2 v1 2026-06-23T11:51:51.367Z