This repository has been archived by the owner on May 8, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 28
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* fixes to seeding * IndependentJoint distribution (replaces MixedDistribution) * Mixture of transformed Gaussians * updates to generators * utils/math
- Loading branch information
1 parent
aca89dc
commit 4ae2749
Showing
36 changed files
with
1,095 additions
and
277 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,91 @@ | ||
import numpy as np | ||
|
||
from .BaseDistribution import BaseDistribution | ||
|
||
|
||
class IndependentJoint(BaseDistribution): | ||
"""Joint distribution composed of statistically independent sub- | ||
distributions. | ||
This class defines a concatenation of a list of distributions. | ||
It supports `eval()` and `gen()`. | ||
Parameters | ||
---------- | ||
dists : array of distributions | ||
Array of distributions | ||
seed : int or None | ||
If provided, random number generator will be seeded | ||
""" | ||
def __init__(self, dists, seed=None): | ||
|
||
for d in dists: | ||
assert not isinstance(d, IndependentJoint), \ | ||
"IndependentJoint objects cannot be nested" | ||
self.dists = [ d for d in dists if d.ndim > 0 ] | ||
self.dimlist = [ d.ndim for d in self.dists] | ||
ndim = np.sum(self.dimlist) | ||
|
||
# self.dist_index_eachdim stores the index of the child distribution | ||
# for each dimension of the full distribution. | ||
self.dist_index_eachdim = np.zeros(ndim, dtype=int) | ||
# self.ii_full2child stores the index into the child distribution for | ||
# each index into the full distribution | ||
self.ii_full2child = np.zeros(ndim, dtype=int) | ||
|
||
# list of indices for the full distribution for each child distribution: | ||
self.ii_list_eachdist = [] | ||
csdims = np.append(0, np.cumsum(self.dimlist)) | ||
for j in range(len(self.dists)): | ||
ii_child = np.arange(csdims[j], csdims[j + 1]) | ||
self.dist_index_eachdim[ii_child] = j | ||
self.ii_full2child[ii_child] = np.arange(self.dimlist[j]) | ||
super().__init__(ndim=ndim, seed=seed) | ||
|
||
def mean(self): | ||
return np.concatenate([d.mean for d in self.dists]) | ||
|
||
def std(self): | ||
return np.concatenate([d.std for d in self.dists]) | ||
|
||
def eval(self, x, ii=None, log=True): | ||
if ii is not None: | ||
ii = np.atleast_1d(ii) | ||
if ii.dtype == bool: # convert to array of indices | ||
assert ii.size == self.ndim, 'incorrectly sized binary mask' | ||
ii = np.flatnozero(ii) | ||
assert (np.diff(ii) > 0).all(), 'ii must be increasing' | ||
assert (ii >= 0).all() and (ii < self.ndim).all(), 'invalid index' | ||
|
||
xsplit, ds, ii_children = [], [], [] | ||
for j, d in enumerate(self.dists): | ||
# is_childj stores whether each element of ii is in child j | ||
is_childj = self.dist_index_eachdim[ii] == j | ||
if not is_childj.any(): | ||
continue | ||
ds.append(d) | ||
# ii_child stores indices into child distribution's dimensions | ||
ii_child = self.ii_full2child[ii[is_childj]] | ||
xsplit.append(x[:, is_childj]) | ||
if ii_child.size == self.dimlist[j]: | ||
ii_children.append(None) # full child distribution | ||
else: | ||
ii_children.append(ii_child) | ||
else: | ||
ds = self.dists | ||
xsplit = np.split(x, np.cumsum(self.dimlist), axis=-1) | ||
ii_children = [None for d in ds] # full child distribution | ||
|
||
logps = [d.eval(x, ii=ii, log=True) | ||
for d, x, ii in zip(ds, xsplit, ii_children)] | ||
# each element of logps is a vector with one log prob per data point | ||
logp = np.sum(np.vstack(logps), axis=0) | ||
return logp if log else np.exp(logp) | ||
|
||
def gen(self, n_samples=1): | ||
return np.concatenate([ d.gen(n_samples) for d in self.dists ], axis=-1) | ||
|
||
def reseed(self, seed): | ||
super().reseed(seed) | ||
for d in self.dists: | ||
d.reseed(self.gen_newseed()) |
This file was deleted.
Oops, something went wrong.
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.