Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
bilby
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Soumen Roy
bilby
Commits
a03e49e8
Commit
a03e49e8
authored
1 year ago
by
Colm Talbot
Browse files
Options
Downloads
Patches
Plain Diff
DOC: some clarifications in dynesty guide
parent
e310aec5
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
docs/dynesty-guide.txt
+9
-4
9 additions, 4 deletions
docs/dynesty-guide.txt
with
9 additions
and
4 deletions
docs/dynesty-guide.txt
+
9
−
4
View file @
a03e49e8
...
...
@@ -38,8 +38,9 @@ new point from the constrained prior. These can be specified using the
results, however, in some cases, a larger value may be required.
2. :code:`sample="acceptance-walk"`: with this method, at each iteration all MCMC chains
are set to the same length. The specific length evolves during the run to yield an
average of :code:`naccept` accepted jumps during each chain. This method is well
are set to the same length. The specific length evolves during the run so that the
number of accepted steps follows a Poisson distribution with mean :code:`naccept`
during each chain. This method is well
suited to parallelised applications, as each MCMC chain will run for the same
amount of time. The value of :code:`naccept` should be tuned based on the
application. For example, one could run a single analysis with
...
...
@@ -62,7 +63,9 @@ There are a number of keyword arguments that influence these sampling methods:
for consistency with other codes. Default is 5000. If this limit is reached,
a warning will be printed during sampling.
#. :code:`proposals`: a list of the desired proposals. The allowed values are
#. :code:`proposals`: a list of the desired proposals.
Each of these proposals can be used with any of the sampling methods described
above. The allowed values are
* :code:`diff`: `ter Braak + (2006) <https://doi.org/10.1007/s11222-006-8769-1>`_
differential evolution. This is the default for :code:`bound="live"` and
...
...
@@ -70,7 +73,9 @@ There are a number of keyword arguments that influence these sampling methods:
* :code:`volumetric`: sample from an ellipsoid centered on the current point.
This is the proposal distribution implemented in :code:`dynesty` and the
default for all other :code:`bound` options.
default for all other :code:`bound` options. This was the default proposal
distribution for :code:`Bilby<2`, however, in many applications it leads to
longer autocorrelation times and struggles to explore multi-modal distributions.
Finally, we implement two custom :code:`dynesty.sampler.Sampler` classes to
facilitate the differential evolution proposal and average acceptance tracking.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment