-
Notifications
You must be signed in to change notification settings - Fork 6
Add BijectiveSimplexLink in the docs #66
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Changes from 2 commits
6035311
72959d4
be8fb9f
456bbc4
201d220
749c400
d09552c
84178bf
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -36,10 +36,10 @@ Base.inv(l::Link) = Link(InverseFunctions.inverse(l.f)) | |
| Wrapper to preprocess the inputs by adding a `0` at the end before passing it to | ||
| the link `link`. | ||
| This is a necessary step to work with simplices. | ||
| For example with the [`SoftMaxLink`](@ref), to obtain a `n`-simplex leading to | ||
| `n+1` categories for the [`CategoricalLikelihood`](@ref), | ||
| one needs to pass `n+1` latent GP. | ||
| However, by wrapping the link into a `BijectiveSimplexLink`, only `n` latent are needed. | ||
| For example with the [`SoftMaxLink`](@ref), to obtain a `n-1`-simplex leading to | ||
| `n` categories for the [`CategoricalLikelihood`](@ref), | ||
| one needs to pass `n` latent GP. | ||
| However, by wrapping the link into a `BijectiveSimplexLink`, only `n-1` latent GP are needed. | ||
|
||
| """ | ||
| struct BijectiveSimplexLink{L} <: AbstractLink | ||
| link::L | ||
|
|
||
Uh oh!
There was an error while loading. Please reload this page.