mschauer / ZigZagBoomerang.jl

Sleek implementations of the ZigZag, Boomerang and other assorted piecewise deterministic Markov processes for Markov Chain Monte Carlo including Sticky PDMPs for variable selection
MIT License
100 stars 7 forks source link

TODO list #6

Open SebaGraz opened 4 years ago

SebaGraz commented 4 years ago
mschauer commented 4 years ago
SebaGraz commented 4 years ago

I want to propose the following:

  1. To have the d dimensional implementation as the default implementation and drop the 1-dimensional implementation
  2. To group the implementations for not factorised (Bouncy and Boomerang) and factorised pdmps (Zig-Zag and Fact. Boomerang).
  3. To have the Local implementation (with the PriorityQueue) of the factorised pdmps as the default implementation for those algorithms (Zig-Zag and Fact. Boomerang). When the graph is not specified, then assume a fully connected graph
SebaGraz commented 4 years ago
mschauer commented 4 years ago

Let's keep the 1-d version intact for didactical purposes, but the high dimensional should be the default

mschauer commented 4 years ago