Draw posterior samples using Hamiltonian Monte Carlo (HMC).

Markov chain Monte Carlo (MCMC) methods are considered the gold standard of Bayesian inference; under suitable conditions and in the limit of infinitely many draws they generate samples from the true posterior distribution. HMC [1] uses gradients of the model's log-density function to propose samples, allowing it to exploit posterior geometry. However, it is computationally more expensive than variational inference and relatively sensitive to tuning.

This method attempts to provide a sensible default approach for fitting StructuralTimeSeries models using HMC. It first runs variational inference as a fast posterior approximation, and initializes the HMC sampler from the variational posterior, using the posterior standard deviations to set per-variable step sizes (equivalently, a diagonal mass matrix). During the warmup phase, it adapts the step size to target an acceptance rate of 0.75, which is thought to be in the desirable range for optimal mixing [2].

model An instance of StructuralTimeSeries representing a time-series model. This represents a joint distribution over time-series and their parameters with batch shape [b1, ..., bN].
observed_time_series float Tensor of shape concat([sample_shape, model.batch_shape, [num_timesteps, 1]]) wheresample_shapecorresponds to i.i.d. observations, and the trailing[1]dimension may (optionally) be omitted ifnum_timesteps > 1. May optionally be an instance of <a href="../../tfp/sts/MaskedTimeSeries"><code>tfp.sts.MaskedTimeSeries</code></a>, which includes a maskTensorto specify timesteps with missing observations. </td> </tr><tr> <td>num_results</td> <td> Integer number of Markov chain draws. Default value:100. </td> </tr><tr> <td>num_warmup_steps</td> <td> Integer number of steps to take before starting to collect results. The warmup steps are also used to adapt the step size towards a target acceptance rate of 0.75. Default value:50. </td> </tr><tr> <td>num_leapfrog_steps</td> <td> Integer number of steps to run the leapfrog integrator for. Total progress per HMC step is roughly proportional tostep_size * num_leapfrog_steps. Default value:15. </td> </tr><tr> <td>initial_state</td> <td> Optional PythonlistofTensors, one for each model parameter, representing the initial state(s) of the Markov chain(s). These should have shapeconcat([chain_batch_shape, param.prior.batch_shape, param.prior.event_shape]). IfNone, the initial state is set automatically using a sample from a variational posterior. Default value:None. </td> </tr><tr> <td>initial_step_size</td> <td> PythonlistofTensors, one for each model parameter, representing the step size for the leapfrog integrator. Must broadcast with the shape ofinitial_state. Larger step sizes lead to faster progress, but too-large step sizes make rejection exponentially more likely. IfNone, the step size is set automatically using the standard deviation of a variational posterior. Default value:None. </td> </tr><tr> <td>chain_batch_shape</td> <td> Batch shape (Pythontuple,list, orint) of chains to run in parallel. Default value:[](i.e., a single chain). </td> </tr><tr> <td>num_variational_steps</td> <td> Pythonintnumber of steps to run the variational optimization to determine the initial state and step sizes. Default value:150. </td> </tr><tr> <td>variational_optimizer</td> <td> Optionaltf.train.Optimizerinstance to use in the variational optimization. IfNone, defaults totf.train.AdamOptimizer(0.1). Default value:None. </td> </tr><tr> <td>variational_sample_size</td> <td> Pythonintnumber of Monte Carlo samples to use in estimating the variational divergence. Larger values may stabilize the optimization, but at higher cost per step in time and memory. Default value:1. </td> </tr><tr> <td>seed</td> <td> Python integer to seed the random number generator. </td> </tr><tr> <td>name</td> <td> Pythonstrname prefixed to ops created by this function. Default value:None` (i.e., 'fit_with_hmc').

samples Python list of Tensors representing posterior samples of model parameters, with shapes [concat([[num_results], chain_batch_shape, param.prior.batch_shape, param.prior.event_shape]) for param in model.parameters].
kernel_results A (possibly nested) tuple, namedtuple or list of Tensors representing internal calculations made within the HMC sampler.


Assume we've built a structural time-series model:

  day_of_week = tfp.sts.Seasonal(
  local_linear_trend = tfp.sts.LocalLinearTrend(
  model = tfp.sts.Sum(components=[day_of_week, local_linear_trend],

To draw posterior samples using HMC under default settings:

samples, kernel_results = tfp.sts.fit_with_hmc(model, observed_time_series)
print("acceptance rate: {}".format(
  np.mean(kernel_results.inner_results.inner_results.is_accepted, axis=0)))
print("posterior means: {}".format(
  { np.mean(param_draws, axis=0)
   for (param, param_draws) in zip(model.parameters, samples)}))

We can also run multiple chains. This may help diagnose convergence issues and allows us to exploit vectorization to draw samples more quickly, although warmup still requires the same number of sequential steps.

from matplotlib import pylab as plt

samples, kernel_results = tfp.sts.fit_with_hmc(
  model, observed_time_series, chain_batch_shape=[10])
print("acceptance rate: {}".format(
  np.mean(kernel_results.inner_results.inner_results.is_accepted, axis=0)))

# Plot the sampled traces for each parameter. If the chains have mixed, their
# traces should all cover the same region of state space, frequently crossing
# over each other.
for (param, param_draws) in zip(model.parameters, samples):
  if param.prior.event_shape.ndims > 0:
    print("Only plotting traces for scalar parameters, skipping {}".format(
  plt.figure(figsize=[10, 4])
  plt.xlabel("HMC step")

# Combining the samples from multiple chains into a single dimension allows
# us to easily pass sampled parameters to downstream forecasting methods.
combined_samples = [np.reshape(param_draws,
                               [-1] + list(param_draws.shape[2:]))
                    for param_draws in samples]

For greater flexibility, you may prefer to implement your own sampler using the TensorFlow Probability primitives in tfp.mcmc. The following recipe constructs a basic HMC sampler, using a TransformedTransitionKernel to incorporate constraints on the parameter space.

transformed_hmc_kernel = tfp.mcmc.TransformedTransitionKernel(
        num_adaptation_steps = int(0.8 * num_warmup_steps)),
    bijector=[param.bijector for param in model.parameters])

# Initialize from a Uniform[-2, 2] distribution in unconstrained space.
initial_state = [tfp.sts.sample_uniform_initial_state(
  param, return_constrained=True) for param in model.parameters]

samples, kernel_results = tfp.mcmc.sample_chain(


[1]: Radford Neal. MCMC Using Hamiltonian Dynamics. Handbook of Markov Chain Monte Carlo, 2011. [2] M.J. Betancourt, Simon Byrne, and Mark Girolami. Optimizing The Integrator Step Size for Hamiltonian Monte Carlo.