You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Approximate the target `model` via the variational inference algorithm `algorithm` by starting from the initial variational approximation `q`.
263
266
This is a thin wrapper around `AdvancedVI.optimize`.
264
-
The default `algorithm` assumes `q` uses `AdvancedVI.MvLocationScale`, which can be constructed by invoking `q_fullrank_gaussian` or `q_meanfield_gaussian`.
267
+
The default `algorithm`, `KLMinRepGradProxDescent` ([relevant docs](https://turinglang.org/AdvancedVI.jl/dev/klminrepgradproxdescent/)), assumes `q` uses `AdvancedVI.MvLocationScale`, which can be constructed by invoking `q_fullrank_gaussian` or `q_meanfield_gaussian`.
265
268
For other variational families, refer to `AdvancedVI` to determine the best algorithm and options.
266
269
267
270
# Arguments
@@ -270,9 +273,9 @@ For other variational families, refer to `AdvancedVI` to determine the best algo
270
273
- `max_iter`: Maximum number of steps.
271
274
272
275
# Keyword Arguments
276
+
- `adtype`: Automatic differentiation backend to be applied to the log-density. The default value for `algorithm` also uses this backend for differentiation the variational objective.
273
277
- `algorithm`: Variational inference algorithm.
274
278
- `show_progress`: Whether to show the progress bar.
275
-
- `adtype`: Automatic differentiation backend to be applied to the log-density. The default value for `algorithm` also uses this backend for differentiation the variational objective.
276
279
277
280
See the docs of `AdvancedVI.optimize` for additional keyword arguments.
0 commit comments