Transfer all high level docs from Turing.jl

tutorials/01-gaussian-mixture-model/01_gaussian-mixture-model.jmd

@@ -191,3 +191,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/02-logistic-regression/02_logistic-regression.jmd

@@ -244,3 +244,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/03-bayesian-neural-network/03_bayesian-neural-network.jmd

@@ -198,3 +198,8 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```{julia; eval=false}
+
+
+```

tutorials/04-hidden-markov-model/04_hidden-markov-model.jmd

@@ -190,3 +190,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/05-linear-regression/05_linear-regression.jmd

@@ -231,3 +231,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/06-infinite-mixture-model/06_infinite-mixture-model.jmd

@@ -279,3 +279,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/07-poisson-regression/07_poisson-regression.jmd

@@ -222,3 +222,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/08-multinomial-logistic-regression/08_multinomial-logistic-regression.jmd

@@ -215,3 +215,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/09-variational-inference/09_variational-inference.jmd

@@ -868,3 +868,8 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```{julia; eval=false}
+
+
+```

tutorials/10-bayesian-differential-equations/10_bayesian-differential-equations.jmd

@@ -447,3 +447,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/11-probabilistic-pca/11_probabilistic-pca.jmd

@@ -375,3 +375,7 @@ It can also thought as a matrix factorisation method, in which $\mathbf{X}=(\mat
 [^3]: Gareth M. James, Daniela Witten, Trevor Hastie, Robert Tibshirani, *An Introduction to Statistical Learning*, Springer, 2013.
 [^4]: David Wipf, Srikantan Nagarajan, *A New View of Automatic Relevance Determination*, NIPS 2007.
 [^5]: Christopher Bishop, *Pattern Recognition and Machine Learning*, Springer, 2006.
+
+```julia
+
+```

tutorials/12-gaussian-process/12_gaussian-process.jmd

@@ -18,7 +18,7 @@ Importantly, it provides the advantage that the linear mappings from the embedde
 
 Let's start by loading some dependencies.
 
-```julia
+```{julia; eval=false}
 using Turing
 using AbstractGPs
 using FillArrays
@@ -41,7 +41,7 @@ although this is an active area of research.
 We will briefly touch on some ways to speed things up at the end of this tutorial.
 We transform the original data with non-linear operations in order to demonstrate the power of GPs to work on non-linear relationships, while keeping the problem reasonably small.
 
-```julia
+```{julia; eval=false}
 data = dataset("datasets", "iris")
 species = data[!, "Species"]
 index = shuffle(1:150)
@@ -66,7 +66,7 @@ Indeed, pPCA is basically equivalent to running the GPLVM model with an automati
 
 First, we re-introduce the pPCA model (see the tutorial on pPCA for details)
 
-```julia
+```{julia; eval=false}
 @model function pPCA(x)
  # Dimensionality of the problem.
  N, D = size(x)
@@ -85,15 +85,15 @@ end;
 We define two different kernels, a simple linear kernel with an Automatic Relevance Determination transform and a
 squared exponential kernel.
 
-```julia
+```{julia; eval=false}
 linear_kernel(α) = LinearKernel() ∘ ARDTransform(α)
 sekernel(α, σ) = σ * SqExponentialKernel() ∘ ARDTransform(α);
 ```
 
 And here is the GPLVM model.
 We create separate models for the two types of kernel.
 
-```julia
+```{julia; eval=false}
 @model function GPLVM_linear(Y, K)
  # Dimensionality of the problem.
  N, D = size(Y)
@@ -134,7 +134,7 @@ end;
 end;
 ```
 
-```julia
+```{julia; eval=false}
 # Standard GPs don't scale very well in n, so we use a small subsample for the purpose of this tutorial
 n_data = 40
 # number of features to use from dataset
@@ -143,12 +143,12 @@ n_features = 4
 ndim = 4;
 ```
 
-```julia
+```{julia; eval=false}
 ppca = pPCA(dat[1:n_data, 1:n_features])
 chain_ppca = sample(ppca, NUTS{Turing.ReverseDiffAD{true}}(), 1000);
 ```
 
-```julia
+```{julia; eval=false}
 # we extract the posterior mean estimates of the parameters from the chain
 z_mean = reshape(mean(group(chain_ppca, :z))[:, 2], (n_features, n_data))
 scatter(z_mean[1, :], z_mean[2, :]; group=labels[1:n_data], xlabel=L"z_1", ylabel=L"z_2")
@@ -161,12 +161,12 @@ using pPCA (see the pPCA tutorial).
 
 Let's try the same with our linear kernel GPLVM model.
 
-```julia
+```{julia; eval=false}
 gplvm_linear = GPLVM_linear(dat[1:n_data, 1:n_features], ndim)
 chain_linear = sample(gplvm_linear, NUTS{Turing.ReverseDiffAD{true}}(), 500);
 ```
 
-```julia
+```{julia; eval=false}
 # we extract the posterior mean estimates of the parameters from the chain
 z_mean = reshape(mean(group(chain_linear, :Z))[:, 2], (n_features, n_data))
 alpha_mean = mean(group(chain_linear, :α))[:, 2]
@@ -186,12 +186,12 @@ We can see that similar to the pPCA case, the linear kernel GPLVM fails to disti
 
 Finally, we demonstrate that by changing the kernel to a non-linear function, we are able to separate the data again.
 
-```julia
+```{julia; eval=false}
 gplvm = GPLVM(dat[1:n_data, 1:n_features], ndim)
 chain_gplvm = sample(gplvm, NUTS{Turing.ReverseDiffAD{true}}(), 500);
 ```
 
-```julia
+```{julia; eval=false}
 # we extract the posterior mean estimates of the parameters from the chain
 z_mean = reshape(mean(group(chain_gplvm, :Z))[:, 2], (ndim, n_data))
 alpha_mean = mean(group(chain_gplvm, :α))[:, 2]
@@ -206,7 +206,7 @@ scatter(
 )
 ```
 
-```julia; echo=false
+```{julia; eval=false}
 let
  @assert abs(
  mean(z_mean[alpha1, labels[1:n_data] .== "setosa"]) -
@@ -217,8 +217,12 @@ end
 
 Now, the split between the two groups is visible again.
 
-```julia, echo=false, skip="notebook", tangle=false
+```{julia; eval=false}
 if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/13-seasonal-time-series/13_seasonal_time_series.jmd

@@ -334,3 +334,7 @@ if isdefined(Main, :TuringTutorials)
  Main.TuringTutorials.tutorial_footer(WEAVE_ARGS[:folder], WEAVE_ARGS[:file])
 end
 ```
+
+```julia
+
+```

tutorials/14-minituring/14_minituring.jmd

@@ -286,3 +286,7 @@ sample(turing_m(3.0), MH(ScalMat(2, 1.0)), 1_000_000)
 ```
 
 As you can see, with our simple probabilistic programming language and custom samplers we get similar results as Turing.
+
+```julia
+
+```