Brandon T. Willard

Yes, easy access to a particular node like that would be nice. The easiest approach might involve unique labels. A debug print-out could apply a very deterministic unique labeling, so...

> idk maybe make use of what dask does here. Which part of what Dask does? I don't remember whether or not Dask assigns unique IDs/labels when nodes are created,...

> I think every execution aspect of of etuples can be subsumbed by dask https://docs.dask.org/en/latest/graphs.html. Immutability/pure-funcs as well as naming nodes (dask_key_name) are figured out. > > Considering that, etuples...

Note: we'll probably need to setup a "demo" instance for this service.

Where is the fake report? I searched for it on the wiki; can't find it.

OK, let's start by putting the relevant pictures and info from the presentation on the wiki.

And/or assess the use of somewhat uninformative priors (e.g. normals with a lot of variance). The example code works like this, with state prior covariances ~1e7. As well, given the...

I've provided JAGS code for this analysis. Does that run faster or fast enough?

Does the following illustrate the problem you're talking about—or part of it? ```python import aemcmc import aesara import aesara.tensor as at srng = at.random.RandomStream(0) lam_rv = srng.gamma(1., 1., name="lam") Y1_rv...

> Yes, definitely part of it. I was wondering if AeMCMC has the structure to emulate/automate common conjugate distributions as in this [Wiki table](https://en.wikipedia.org/wiki/Conjugate_prior#Table_of_conjugate_distributions). Absolutely; that's a big part of...