Differentiable Algorithm for Marginalising Changepoints

  title={Differentiable Algorithm for Marginalising Changepoints},
  author={Hyoung-Jin Lim and Gwonsoo Che and Wonyeol Lee and Hongseok Yang},
  • Hyoung-Jin Lim, Gwonsoo Che, +1 author Hongseok Yang
  • Published in AAAI 2020
  • Computer Science, Mathematics
  • We present an algorithm for marginalising changepoints in time-series models that assume a fixed number of unknown changepoints. Our algorithm is differentiable with respect to its inputs, which are the values of latent random variables other than changepoints. Also, it runs in time O(mn) where n is the number of time steps and m the number of changepoints, an improvement over a naive marginalisation method with O(n^m) time complexity. We derive the algorithm by identifying quantities related… CONTINUE READING


    Publications referenced by this paper.
    Exact and efficient Bayesian inference for multiple changepoint problems
    • 356
    • PDF
    Auto-Encoding Variational Bayes
    • 9,353
    • PDF
    On-line inference for multiple changepoint problems
    • 236
    • PDF
    Estimation and comparison of multiple change-point models
    • 592
    • PDF
    Marginal Likelihood from the Gibbs Output
    • 1,807
    • PDF
    Computationally Efficient Changepoint Detection for a Range of Penalties
    • 42
    • PDF
    MCMC Using Hamiltonian Dynamics
    • 1,649
    • PDF
    The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
    • 1,702
    • PDF