Skip to content

Commit 0386029

Browse files
committed
Merge branch 'remove_bijectors' of github.com:TuringLang/AdvancedVI.jl into remove_bijectors
2 parents af4ad18 + 9a64db7 commit 0386029

File tree

2 files changed

+2
-5
lines changed

2 files changed

+2
-5
lines changed

docs/src/tutorials/basic.md

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -50,7 +50,7 @@ end
5050
nothing
5151
```
5252

53-
Notice that the support of `σ` is constrained to be positive.
53+
Notice that the support of `σ` is constrained to be positive.
5454
Since most VI algorithms assume an unconstrained Euclidean support, we will apply a change-of-variable by a bijective map (a *bijector*) to the posterior to make it unconstrained.
5555
For this, we will use the [`Bijectors`](https://github.com/TuringLang/Bijectors.jl) package.
5656

@@ -221,7 +221,6 @@ Therefore, we finally need to apply a change-of-variable to `q_out` to make it a
221221
q_trans = Bijectors.TransformedDistribution(q_out, binv)
222222
```
223223

224-
225224
## Custom Callback
226225

227226
The ELBO estimates above however, use only a handful of Monte Carlo samples.

docs/src/tutorials/subsampling.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -88,9 +88,7 @@ using LogDensityProblemsAD
8888
8989
prob = LogReg(X, y, size(X, 1))
9090
prob_ad = LogDensityProblemsAD.ADgradient(
91-
ADTypes.AutoReverseDiff(),
92-
prob,
93-
x=randn(LogDensityProblems.dimension(prob))
91+
ADTypes.AutoReverseDiff(), prob; x=randn(LogDensityProblems.dimension(prob))
9492
)
9593
nothing
9694
```

0 commit comments

Comments
 (0)