ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1910.10211
6
0
v1v2 (latest)

Better Approximate Inference for Partial Likelihood Models with a Latent Structure

22 October 2019
Amrith Rajagopal Setlur
Barnabás Póczós
    TPM
ArXiv (abs)PDFHTML
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 ZZZ, the proposed approximation reduces inference complexity from O(∣Z∣c)O(|Z|^c)O(∣Z∣c) to O(∣Z∣)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.

View on arXiv
Comments on this paper