-
Notifications
You must be signed in to change notification settings - Fork 21
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
Generic N-ary multihypothesis (bad-init nullhypo addition) #248
Comments
Update: i think the desired behavior is a compromise between the legacy nested Gibbs strategy and introduction of two nullhypothesis strategies. Assumed solution at this point is expand the generalized multihypo API to automatically include an internal hypothesis---i.e. N+1 options---which represents stale particles from the current variable. This avoids programming absolute (or even relative) data about uncertain variables into the factor. This approach does change the proposal conditionals in Gibbs strategy to depend on old values of a proposed variable, but is limited to only one of (N+1) options. If |
The rule of thumb is to multiply the uncertain values with the additional hypothesis -- i.e. binary becomes |
fyi @keevindoherty |
required for JuliaRobotics/Caesar.jl#141 |
moving this back (hopefully the last time) until after the DFG and CSM upgrades are sufficiently complete in IIF v0.7.0. Several (maybe slightly messy) cleanups to occur throughout IIF v0.7.x. |
Oh, and about to tag v0.7.0 |
xref #237 |
xref #347 |
will do soon, sorry for the delay. Just resolving a long series of upstream breaking changes, but things starting to stabilize. |
xref #462 |
add bad-init resolution for multihypo (#248)
Binary hypothesis factors:
Produce two options where one must be true, and this is known to work well with sequential Gibbs sampling.
When more options are added, such as:
sequential Gibbs sampling (with automated conditional construction) can arrive at inconsistent proposal distributions. The clearest example is from 3-door identified in #236:
(:l0,:l1,:l2)
at 0, 10, 40.x0
at 0.:l1
or:l2
from other informationQuestion is if it impossible to find the conditional
[ | ]
without the partition function1/P
that is guaranteed to always produce consistent proposals?The text was updated successfully, but these errors were encountered: