- Introduction
- \(M\)-step-ahead predictions
- Approximate \(M\)-SAP using importance-sampling
- Autoregressive models
- Case Study: Annual measurements of the level of Lake Huron
- 1-step-ahead predictions leaving out all future values
- \(M\)-step-ahead predictions leaving out all future values
- Conclusion
- References
- Appendix

One of the most common goals of a time series analysis is to use the observed series to inform predictions for future observations. We will refer to this task of predicting a sequence of \(M\) future observations as \(M\)-step-ahead prediction (\(M\)-SAP). Fortunately, once we have fit a model and can sample from the posterior predictive distribution, it is straightforward to generate predictions as far into the future as we want. It is also straightforward to evaluate the \(M\)-SAP performance of a time series model by comparing the predictions to the observed sequence of \(M\) future data points once they become available.

Unfortunately, we are often in the position of having to use a model to inform decisions *before* we can collect the future observations required for assessing the predictive performance. If we have many competing models we may also need to first decide which of the models (or which combination of the models) we should rely on for predictions. In these situations the best we can do is to use methods for approximating the expected predictive performance of our models using only the observations of the time series we already have.

If there were no time dependence in the data or if the focus is to assess the non-time-dependent part of the model, we could use methods like leave-one-out cross-validation (LOO-CV). For a data set with \(N\) observations, we refit the model \(N\) times, each time leaving out one of the \(N\) observations and assessing how well the model predicts the left-out observation. LOO-CV is very expensive computationally in most realistic settings, but the Pareto smoothed importance sampling (PSIS, Vehtari et al, 2017ab) algorithm provided by the *loo* package allows for approximating exact LOO-CV with PSIS-LOO-CV. PSIS-LOO-CV requires only a single fit of the full model and comes with diagnostics for assessing the validity of the approximation.

With a time series we can do something similar to LOO-CV but, except in a few cases, it does not make sense to leave out observations one at a time because then we are allowing information from the future to influence predictions of the past (i.e., times \(t + 1, t+2, \ldots\) should not be used to predict for time \(t\)). To apply the idea of cross-validation to the \(M\)-SAP case, instead of leave-*one*-out cross-validation we need some form of leave-*future*-out cross-validation (LFO-CV). As we will demonstrate in this case study, LFO-CV does not refer to one particular prediction task but rather to various possible cross-validation approaches that all involve some form of prediction for new time series data. Like exact LOO-CV, exact LFO-CV requires refitting the model many times to different subsets of the data, which is computationally very costly for most nontrivial examples, in particular for Bayesian analyses where refitting the model means estimating a new posterior distribution rather than a point estimate.

Although PSIS-LOO-CV provides an efficient approximation to exact LOO-CV, until now there has not been an analogous approximation to exact LFO-CV that drastically reduces the computational burden while also providing informative diagnostics about the quality of the approximation. In this case study we present PSIS-LFO-CV, an algorithm that typically only requires refitting the time-series model a small number times and will make LFO-CV tractable for many more realistic applications than previously possible.

More details can be found in our paper about approximate LFO-CV (Bürkner, Gabry, & Vehtari, 2019), which is available as a preprint on arXiv (https://arxiv.org/abs/1902.06281).

Assume we have a time series of observations \(y = (y_1, y_2, \ldots, y_N)\) and let \(L\) be the *minimum* number of observations from the series that we will require before making predictions for future data. Depending on the application and how informative the data is, it may not be possible to make reasonable predictions for \(y_{i+1}\) based on \((y_1, \dots, y_{i})\) until \(i\) is large enough so that we can learn enough about the time series to predict future observations. Setting \(L=10\), for example, means that we will only assess predictive performance starting with observation \(y_{11}\), so that we always have at least 10 previous observations to condition on.

In order to assess \(M\)-SAP performance we would like to compute the predictive densities

\[ p(y_{i+1:M} \,|\, y_{1:i}) = p(y_{i+1}, \ldots, y_{i + M} \,|\, y_{1},...,y_{i}) \]

for each \(i \in \{L, \ldots, N - M\}\). The quantities \(p(y_{i+1:M} \,|\, y_{1:i})\) can be computed with the help of the posterior distribution \(p(\theta \,|\, y_{1:i})\) of the parameters \(\theta\) conditional on only the first \(i\) observations of the time-series:

\[ p(y_{i+1:M} \,| \, y_{1:i}) = \int p(y_{i+1:M} \,| \, y_{1:i}, \theta) \, p(\theta\,|\,y_{1:i}) \,d\theta. \]

Having obtained \(S\) draws \((\theta_{1:i}^{(1)}, \ldots, \theta_{1:i}^{(S)})\) from the posterior distribution \(p(\theta\,|\,y_{1:i})\), we can estimate \(p(y_{i+1:M} | y_{1:i})\) as

\[ p(y_{i+1:M} \,|\, y_{1:i}) \approx \frac{1}{S}\sum_{s=1}^S p(y_{i+1:M} \,|\, y_{1:i}, \theta_{1:i}^{(s)}). \]

In the following, we consider factorizable models in which the response values are conditionally independent given the parameters and the likelihood can be written in the familiar form

\[ p(y \,|\, \theta) = \prod_{i=1}^N p(y_i \,|\, \theta). \]

In this case, \(p(y_{i+1:M} \,|\, y_{1:i}, \theta)\) reduces to \[ p(y_{i+1:M} \,|\, \theta) = \prod_{j = i+1}^{i + M} p(y_j \,|\, \theta), \] due to the assumption of conditional independence between \(y_{i+1:M}\) and \(y_{1:i}\) given \(\theta\).

Non-factorizable models, which do not make this assumption, are discussed in a separate vignette *Leave-one-out cross-validation for non-factorizable models*.

Unfortunately, the math above makes use of the posterior distributions from many different fits of the model to different subsets of the data. That is, to obtain the predictive density \(p(y_{i+1:M} \,|\, y_{1:i})\) requires fitting a model to only the first \(i\) data points, and we will need to do this for every value of \(i\) under consideration (all \(i \in \{L, \ldots, N - M\}\)).

To reduce the number of models that need to be fit for the purpose of obtaining each of the densities \(p(y_{i+1:M} \,|\, y_{1:i})\), we propose the following algorithm. Starting with \(i = N - M\), we approximate each \(p(y_{i+1:M} \,|\, y_{1:i})\) using Pareto smoothed importance sampling (PSIS, Vehtari et al, 2017ab):

\[ p(y_{i+1:M} \,|\, y_{1:i}) \approx \frac{ \sum_{s=1}^S w_i^{(s)}\, p(y_{i+1:M} \,|\, \theta^{(s)})}{ \sum_{s=1}^S w_i^{(s)}}, \]

where \(w_i^{(s)}\) are importance weights and \(\theta^{(s)}\) are draws from the posterior distribution based on *all* observations. To obtain \(w_i^{(s)}\), we first compute the raw importance ratios

\[ r_i^{(s)} \propto \frac{1}{\prod_{j = i}^N p(y_j \,|\, \,\theta^{(s)})}, \]

and then stabilize them using PSIS.

We then *decrease* \(i\) by \(1\) (i.e., we move backwards in time) and repeat the process. At some observation \(i\), the variability of importance ratios \(r_i^{(s)}\) will become too large and importance sampling fails. We will refer to this particular value of \(i\) as \(i^\star_1\). To identify the value of \(i^\star_1\) we check for which value of \(i\) does the estimated shape parameter \(k\) of the generalized Pareto distribution first crosses a certain threshold. Only then do we refit the model using only observations before \(i^\star_1\) and then restart the process. In some cases we may only need to refit once and in other cases we will find a value \(i^\star_2\) that requires a second refitting, maybe an \(i^\star_3\) that requires a third refitting, and so on. We repeat the refitting as few times as is required (only if \(k > \text{threshold}\)) until we arrive at \(i = L\). Recall that \(L\) is the minimum number of observations we have deemed acceptable for making predictions (setting \(L=0\) means predictions of all observations should be computed).

For LOO, we recommend to use a threshold of \(0.7\) (Vehtari et al, 2017ab), but for LFO, the threshold should be smaller as influential observations will affect all pointwise LFO approximations until the next refit and thus much stronger than in LOO. For the present case study, we choose a threshold of \(0.6\), which also seems to be generally reasonable threshold for LFO (Bürkner et al. 2019).

Autoregressive (AR) models are some of the most commonly used time-series models. An AR(p) model —an autoregressive model of order \(p\)— can be defined as

\[ y_i = \eta_i + \sum_{k = 1}^p \varphi_k y_{i - k} + \varepsilon_i, \]

where \(\eta_i\) is the linear predictor for the \(i\)th observation, \(\phi_k\) are the autoregressive parameters and \(\varepsilon_i\) are pairwise independent errors, which are usually assumed to be normally distributed with equal variance \(\sigma^2\). The model implies a recursive formula that allows for computing the right-hand side of the above equation for observation \(i\) based on the values of the equations for previous observations.

To illustrate the application of PSIS-LFO-CV for estimating expected \(M\)-SAP performance, we will fit a model for 98 annual measurements of the water level (in feet) of Lake Huron from the years 1875–1972. This data set is found in the **datasets** R package, which is installed automatically with **R**.

In addition to the **loo** package, for this analysis we will use the **brms** interface to Stan to generate a Stan program and fit the model, and also the **bayesplot** and **ggplot2** packages for plotting.

```
library("loo")
library("brms")
library("bayesplot")
library("ggplot2")
color_scheme_set("brightblue")
theme_set(theme_default())
CHAINS <- 4
SEED <- 1234
set.seed(SEED)
```

Before fitting a model, we will first put the data into a data frame and then look at the time series.

```
N <- length(LakeHuron)
df <- data.frame(
y = as.numeric(LakeHuron),
year = as.numeric(time(LakeHuron)),
time = 1:N
)
# save plot labels to reuse them
plot_labs <- labs(
y = "Water Level (ft)",
x = "Year",
title = "Water Level in Lake Huron (1875-1972)"
)
ggplot(df, aes(x = year, y = y)) +
geom_point(size = 1) +
plot_labs
```

The above plot shows rather strong autocorrelation of the time-series as well as some trend towards lower levels for later points in time.

We can specify an AR(4) model for these data using the **brms** package as follows:

```
control <- list(adapt_delta = 0.95)
fit <- brm(
y ~ 1,
data = df,
autocor = cor_ar(~time, p = 4),
prior = prior(normal(0, 0.5), class = "ar"),
control = control,
seed = SEED,
chains = CHAINS
)
```

The model implied predictions along with the observed values can be plotted, which reveals a rather good fit to the data.

```
preds <- posterior_predict(fit)
preds <- cbind(
Estimate = colMeans(preds),
Q5 = apply(preds, 2, quantile, probs = 0.05),
Q95 = apply(preds, 2, quantile, probs = 0.95)
)
ggplot(cbind(df, preds), aes(x = year, y = Estimate)) +
geom_smooth(aes(ymin = Q5, ymax = Q95), stat = "identity", size = 0.5) +
geom_point(aes(y = y)) +
labs(subtitle = "Mean (blue) and 90% predictive intervals (gray) vs. observed data (black)") +
plot_labs
```

To allow for reasonable predictions of future values, we will require at least \(L = 20\) historical observations (20 years) to make predictions.

We first perform approximate leave-one-out cross-validation (LOO-CV) for the purpose of later comparison with exact and approximate LFO-CV for the 1-SAP case.

```
Computed from 4000 by 78 log-likelihood matrix
Estimate SE
elpd_loo -88.5 6.3
p_loo 4.6 0.9
looic 177.1 12.7
------
Monte Carlo SE of elpd_loo is 0.0.
All Pareto k estimates are good (k < 0.5).
See help('pareto-k-diagnostic') for details.
```

The most basic version of \(M\)-SAP is 1-SAP, in which we predict only one step ahead. In this case, \(y_{i+1:M}\) simplifies to \(y_{i}\) and the LFO-CV algorithm becomes considerably simpler than for larger values of \(M\).

Before we compute approximate LFO-CV using PSIS we will first compute exact LFO-CV for the 1-SAP case so we can use it as a benchmark later. The initial step for the exact computation is to calculate the log-predictive densities by refitting the model many times:

```
loglik_exact <- matrix(nrow = nsamples(fit), ncol = N)
for (i in (N - 1):L) {
past <- 1:i
oos <- i + 1
df_past <- df[past, , drop = FALSE]
df_oos <- df[c(past, oos), , drop = FALSE]
fit_i <- update(fit, newdata = df_past, recompile = FALSE)
loglik_exact[, i + 1] <- log_lik(fit_i, newdata = df_oos, oos = oos)[, oos]
}
```

Then we compute the exact expected log predictive density (ELPD):

```
# some helper functions we'll use throughout
# more stable than log(sum(exp(x)))
log_sum_exp <- function(x) {
max_x <- max(x)
max_x + log(sum(exp(x - max_x)))
}
# more stable than log(mean(exp(x)))
log_mean_exp <- function(x) {
log_sum_exp(x) - log(length(x))
}
# compute log of raw importance ratios
# sums over observations *not* over posterior samples
sum_log_ratios <- function(ll, ids = NULL) {
if (!is.null(ids)) ll <- ll[, ids, drop = FALSE]
- rowSums(ll)
}
# for printing comparisons later
rbind_print <- function(...) {
round(rbind(...), digits = 2)
}
```

```
exact_elpds_1sap <- apply(loglik_exact, 2, log_mean_exp)
exact_elpd_1sap <- c(ELPD = sum(exact_elpds_1sap[-(1:L)]))
rbind_print(
"LOO" = loo_cv$estimates["elpd_loo", "Estimate"],
"LFO" = exact_elpd_1sap
)
```

```
ELPD
LOO -88.54
LFO -92.67
```

We see that the ELPD from LFO-CV for 1-step-ahead predictions is lower than the ELPD estimate from LOO-CV, which should be expected since LOO-CV is making use of more of the time series. That is, since the LFO-CV approach only uses observations from before the left-out data point but LOO-CV uses *all* data points other than the left-out observation, we should expect to see the larger ELPD from LOO-CV.

For illustrative purposes, we will first compute approximate 1-SAP without any refitting, even when the Pareto \(k\) estimate is too large. This will of course be a poor approximation to exact 1-SAP, in particular if the Pareto \(k\) estimates increase rather quickly beyond the threshold up to which PSIS tends to produce stable results.

```
approx_elpds_1sap_no_refit <- rep(NA, N)
loglik <- log_lik(fit)
ks <- NULL
for (i in (N - 1):L) {
logratio <- sum_log_ratios(loglik, (i + 1):N)
psis_obj <- suppressWarnings(psis(logratio))
ks <- c(ks, pareto_k_values(psis_obj))
lw <- weights(psis_obj, normalize = TRUE)[, 1]
approx_elpds_1sap_no_refit[i + 1] <- log_sum_exp(lw + loglik[, i + 1])
}
```

If we plot the Pareto \(k\) estimates we can see that they do start to increase quickly and that once we work backwards to about halfway through the data points we get \(k > 0.6\). This is indicated by the vertical line in the plot below, which corresponds to the point \(i^\star_1\) discussed in Section Approximate \(M\)-SAP using importance-sampling above.

```
plot_ks <- function(ks, ids, thres = 0.6) {
dat_ks <- data.frame(ks = ks, ids = ids)
ggplot(dat_ks, aes(x = ids, y = ks)) +
geom_point(aes(color = ks > thres), shape = 3, show.legend = FALSE) +
geom_hline(yintercept = thres, linetype = 2, color = "red2") +
scale_color_manual(values = c("cornflowerblue", "darkblue")) +
labs(x = "Data point", y = "Pareto k") +
ylim(-0.5, 1.5)
}
```

Consequently, it is not surprising that the resulting approximate ELPD for 1-SAP is far away from the exact ELPD we computed above:

```
approx_elpd_1sap_no_refit <-
c(ELPD = sum(approx_elpds_1sap_no_refit, na.rm = TRUE))
rbind_print(
"approx LFO (no refit)" = approx_elpd_1sap_no_refit,
"exact LFO" = exact_elpd_1sap
)
```

```
ELPD
approx LFO (no refit) -88.22
exact LFO -92.67
```

Next, we compute approximate 1-SAP with refit at observations where the Pareto \(k\) estimate exceeds the threshold of \(0.6\).

The code becomes a little bit more involved to handle the refitting procedure. Note that we can compute exact 1-SAP at the refitting points, which comes with no additional computational costs since we had to refit the model anyway.

```
loglik <- matrix(nrow = nsamples(fit), ncol = N)
approx_elpds_1sap <- rep(NA, N)
fit_past <- fit
i_refit <- N
refits <- ks <- NULL
for (i in (N - 1):L) {
loglik[, i + 1] <- log_lik(fit_past)[, i + 1]
logratio <- sum_log_ratios(loglik, (i + 1):i_refit)
psis_obj <- suppressWarnings(psis(logratio))
k <- pareto_k_values(psis_obj)
ks <- c(ks, k)
if (k > k_thres) {
# refit the model based on the first i observations
i_refit <- i
refits <- c(refits, i)
past <- 1:i
oos <- i + 1
df_past <- df[past, , drop = FALSE]
df_oos <- df[c(past, oos), , drop = FALSE]
fit_past <- update(fit_past, newdata = df_past, recompile = FALSE)
loglik[, i + 1] <- log_lik(fit_past, newdata = df_oos)[, oos]
approx_elpds_1sap[i + 1] <- log_mean_exp(loglik[, i + 1])
} else {
lw <- weights(psis_obj, normalize = TRUE)[, 1]
approx_elpds_1sap[i + 1] <- log_sum_exp(lw + loglik[, i + 1])
}
}
```

We see that the final Pareto-\(k\)-estimates are mostly well below the threshold and that we only needed to refit the model a few times:

```
cat("Using threshold ", k_thres,
", model was refit ", length(refits),
" times, at observations", refits)
```

`Using threshold 0.6 , model was refit 8 times, at observations 63 58 55 53 46 39 22 20`

The approximate 1-SAP ELPD is remarkably similar to the exact 1-SAP ELPD computed above, which indicates our algorithm to compute approximate 1-SAP worked well for the present data and model.

```
approx_elpd_1sap <- sum(approx_elpds_1sap, na.rm = TRUE)
rbind_print(
"approx LFO (no refits)" = approx_elpd_1sap_no_refit,
"approx LFO (with refits)" = approx_elpd_1sap,
"exact LFO" = exact_elpd_1sap
)
```

```
ELPD
approx LFO (no refits) -88.22
approx LFO (with refits) -92.27
exact LFO -92.67
```

Plotting exact against approximate predictions, we see that no approximation value deviates far from its exact counterpart, providing further evidence for the good quality of our approximation.

```
dat_elpd <- data.frame(
approx_elpd = approx_elpds_1sap,
exact_elpd = exact_elpds_1sap
)
ggplot(dat_elpd, aes(x = approx_elpd, y = exact_elpd)) +
geom_abline(color = "gray30") +
geom_point(size = 2) +
labs(x = "Approximate ELPDs", y = "Exact ELPDs")
```

We can also look at the maximum difference and average difference between the approximate and exact ELPD calculations, which also indicate a ver close approximation:

```
max_diff <- with(dat_elpd, max(abs(approx_elpd - exact_elpd), na.rm = TRUE))
mean_diff <- with(dat_elpd, mean(abs(approx_elpd - exact_elpd), na.rm = TRUE))
rbind_print(
"Max diff" = round(max_diff, 2),
"Mean diff" = round(mean_diff, 3)
)
```

```
[,1]
Max diff 0.14
Mean diff 0.01
```

To illustrate the application of \(M\)-SAP for \(M > 1\), we next compute exact and approximate LFO-CV for the 4-SAP case.

The necessary steps are the same as for 1-SAP with the exception that the log-density values of interest are now the sums of the log predictive densities of four consecutive observations. Further, the stability of the PSIS approximation actually stays the same for all \(M\) as it only depends on the number of observations we leave out, not on the number of observations we predict.

```
M <- 4
loglikm <- matrix(nrow = nsamples(fit), ncol = N)
for (i in (N - M):L) {
past <- 1:i
oos <- (i + 1):(i + M)
df_past <- df[past, , drop = FALSE]
df_oos <- df[c(past, oos), , drop = FALSE]
fit_past <- update(fit, newdata = df_past, recompile = FALSE)
ll <- log_lik(fit_past, newdata = df_oos, oos = oos)
loglikm[, i + 1] <- rowSums(ll[, oos])
}
```

```
exact_elpds_4sap <- apply(loglikm, 2, log_mean_exp)
(exact_elpd_4sap <- c(ELPD = sum(exact_elpds_4sap, na.rm = TRUE)))
```

```
ELPD
-532.4023
```

Computing the approximate PSIS-LFO-CV for the 4-SAP case is a little bit more involved than the approximate version for the 1-SAP case, although the underlying principles remain the same.

```
loglikm <- loglik <- matrix(nrow = nsamples(fit), ncol = N)
approx_elpds_4sap <- rep(NA, N)
fit_past <- fit
i_refit <- N
refits <- ks <- NULL
loglik[, (N - M + 2):N] <- log_lik(fit_past)[, (N - M + 2):N]
for (i in (N - M):L) {
past <- 1:i
oos <- (i + 1):(i + M)
df_oos <- df[c(past, oos), , drop = FALSE]
ll <- log_lik(fit_past, newdata = df_oos, oos = oos)
loglik[, i + 1] <- ll[, i + 1]
logratio <- sum_log_ratios(loglik, (i + 1):i_refit)
psis_obj <- suppressWarnings(psis(logratio))
k <- pareto_k_values(psis_obj)
ks <- c(ks, k)
if (k > k_thres) {
# refit the model based on the first i observations
i_refit <- i
refits <- c(refits, i)
df_past <- df[past, , drop = FALSE]
fit_past <- update(fit, newdata = df_past, recompile = FALSE)
ll <- log_lik(fit_past, newdata = df_oos, oos = oos)
loglikm[, i + 1] <- rowSums(ll[, oos])
loglik[, i + 1] <- ll[, i + 1]
approx_elpds_4sap[i + 1] <- log_mean_exp(loglikm[, i + 1])
} else {
lw <- weights(psis_obj, normalize = TRUE)[, 1]
loglikm[, i + 1] <- rowSums(ll[, oos])
approx_elpds_4sap[i + 1] <- log_sum_exp(lw + loglikm[, i + 1])
}
}
```

Again, we see that the final Pareto-\(k\)-estimates are mostly well below the threshold and that we only needed to refit the model a few times:

```
cat("Using threshold ", k_thres,
", model was refit ", length(refits),
" times, at observations", refits)
```

`Using threshold 0.6 , model was refit 8 times, at observations 63 57 55 54 48 39 22 20`

The approximate ELPD computed for the 4-SAP case is not as close to its exact counterpart as in the 1-SAP case.

```
approx_elpd_4sap <- sum(approx_elpds_4sap, na.rm = TRUE)
rbind_print(
"Approx LFO" = approx_elpd_4sap,
"Exact LFO" = exact_elpd_4sap
)
```

```
ELPD
Approx LFO -529.38
Exact LFO -532.40
```

Plotting exact against approximate pointwise predictions confirms that, for a few specific data points, the approximate predictions underestimate the exact predictions.

In this case study we have shown how to do carry out exact and approximate leave-future-out cross-validation for \(M\)-step-ahead prediction tasks. For the data and model used in our example, the PSIS-LFO-CV algorithm provides reasonably stable and accurate results despite not requiring us to refit the model nearly as many times. For more details on approximate LFO-CV, we refer to Bürkner et al. (2019).

Bürkner P. C., Gabry J., & Vehtari A. (2019). Approximate leave-future-out cross-validation for time series models. arXiv preprint.

Vehtari A., Gelman A., & Gabry J. (2017a). Practical Bayesian model evaluation using leave-one-out cross-validation and WAIC. *Statistics and Computing*, 27(5), 1413–1432. :10.1007/s11222-016-9696-4. Online. arXiv preprint arXiv:1507.04544.

Vehtari A., Gelman A., & Gabry J. (2017b). Pareto smoothed importance sampling. arXiv preprint arXiv:1507.02646.

```
R version 3.6.1 (2019-07-05)
Platform: x86_64-apple-darwin15.6.0 (64-bit)
Running under: macOS Sierra 10.12.6
Matrix products: default
BLAS: /Library/Frameworks/R.framework/Versions/3.6/Resources/lib/libRblas.0.dylib
LAPACK: /Library/Frameworks/R.framework/Versions/3.6/Resources/lib/libRlapack.dylib
locale:
[1] C/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
attached base packages:
[1] stats graphics grDevices utils datasets methods base
other attached packages:
[1] ggplot2_3.2.1 brms_2.10.0 loo_2.2.0 bayesplot_1.7.1
[5] rstanarm_2.19.3 Rcpp_1.0.2 knitr_1.25
loaded via a namespace (and not attached):
[1] Brobdingnag_1.2-6 splines_3.6.1 gtools_3.8.1
[4] StanHeaders_2.19.0 threejs_0.3.1 shiny_1.3.2
[7] assertthat_0.2.1 stats4_3.6.1 yaml_2.2.0
[10] backports_1.1.5 pillar_1.4.2 lattice_0.20-38
[13] glue_1.3.1 digest_0.6.22 checkmate_1.9.4
[16] promises_1.0.1 minqa_1.2.4 colorspace_1.4-1
[19] htmltools_0.3.6 httpuv_1.5.2 Matrix_1.2-17
[22] plyr_1.8.4 dygraphs_1.1.1.6 pkgconfig_2.0.3
[25] rstan_2.19.2 purrr_0.3.3 xtable_1.8-4
[28] scales_1.0.0 processx_3.4.1 later_0.8.0
[31] lme4_1.1-17 tibble_2.1.3 DT_0.8
[34] withr_2.1.2 shinyjs_1.0 lazyeval_0.2.2
[37] cli_1.1.0 survival_2.44-1.1 magrittr_1.5
[40] crayon_1.3.4 mime_0.7 evaluate_0.14
[43] ps_1.3.0 nlme_3.1-140 MASS_7.3-51.4
[46] xts_0.11-0 pkgbuild_1.0.5 colourpicker_1.0
[49] rsconnect_0.8.15 tools_3.6.1 prettyunits_1.0.2
[52] matrixStats_0.54.0 stringr_1.4.0 munsell_0.5.0
[55] callr_3.3.1 compiler_3.6.1 rlang_0.4.1
[58] nloptr_1.0.4 grid_3.6.1 ggridges_0.5.0
[61] htmlwidgets_1.3 crosstalk_1.0.0 igraph_1.2.4.1
[64] miniUI_0.1.1.1 labeling_0.3 base64enc_0.1-3
[67] rmarkdown_1.15 codetools_0.2-16 gtable_0.3.0
[70] abind_1.4-5 inline_0.3.15 markdown_0.8
[73] reshape2_1.4.3 R6_2.4.1 gridExtra_2.3
[76] rstantools_2.0.0 zoo_1.8-3 bridgesampling_0.7-2
[79] dplyr_0.8.3 shinystan_2.5.0 shinythemes_1.1.1
[82] stringi_1.4.3 parallel_3.6.1 coda_0.19-1
[85] tidyselect_0.2.5 xfun_0.9
```

- Code © 2018, Paul Bürkner, Jonah Gabry, Aki Vehtari (licensed under BSD-3).
- Text © 2018, Paul Bürkner, Jonah Gabry, Aki Vehtari (licensed under CC-BY-NC 4.0).