Skip to content
Snippets Groups Projects

Resolve #430 (Add normalisation flag to constrained prior)

Merged Resolve #430 (Add normalisation flag to constrained prior)
All threads resolved!
Merged Bruce Edelman requested to merge bruce.edelman/bilby:constraint into master
All threads resolved!
Compare and Show latest version
1 file
+ 22
8
Compare changes
  • Side-by-side
  • Inline
+ 22
8
@@ -381,15 +381,20 @@ class PriorDict(dict):
@lru_cache()
def normalize_constraint_factor(self, keys):
min_accept = 50
sampling_chunk = 250
min_accept = 1000
sampling_chunk = 5000
samples = self.sample_subset(keys=keys, size=sampling_chunk)
keep = np.array(self.evaluate_constraints(samples))
keep = np.atleast_1d(self.evaluate_constraints(samples))
if len(keep) == 1:
return 1
all_samples = {key: np.array([]) for key in keys}
_first_key = list(all_samples.keys())[0]
while np.count_nonzero(keep) < min_accept:
new_samples = self.sample_subset(keys=keys, size=sampling_chunk)
samples = self.sample_subset(keys=keys, size=sampling_chunk)
for key in samples:
samples[key] = np.concatenate(samples[key], new_samples[key])
keep = np.array(self.evaluate_constraints(samples))
all_samples[key] = np.hstack(
[all_samples[key], samples[key].flatten()])
keep = np.array(self.evaluate_constraints(all_samples), dtype=bool)
return len(keep) / np.count_nonzero(keep)
def prob(self, sample, **kwargs):
@@ -410,7 +415,7 @@ class PriorDict(dict):
prob = np.product([self[key].prob(sample[key])
for key in sample], **kwargs)
ratio = self.normalize_constraint_factor(sample.keys())
ratio = self.normalize_constraint_factor(tuple(sample.keys()))
if np.all(prob == 0.):
return prob
else:
@@ -444,7 +449,7 @@ class PriorDict(dict):
ln_prob = np.sum([self[key].ln_prob(sample[key])
for key in sample], axis=axis)
ratio = self.normalize_constraint_factor(sample.keys())
ratio = self.normalize_constraint_factor(tuple(sample.keys()))
if np.all(np.isinf(ln_prob)):
return ln_prob
else:
@@ -506,6 +511,15 @@ class PriorDict(dict):
"""
return self.__class__(dictionary=dict(self))
def __key(self):
return tuple((k, self[k]) for k in sorted(self))
def __hash__(self):
return hash(self.__key())
def __eq__(self, other):
return self.__key() == other.__key()
class PriorSet(PriorDict):
Loading