You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Rather than iterate through all 2^m subsets, first compute the probabilities of the m conjunctions and immediately return 0 if each conjunction in the union has probability zero, which removes the duplicate computation inside prune_events.
The text was updated successfully, but these errors were encountered:
Implemented in 4ac7d47 for logprob---condition is more complicated, since finding the disjoint union is often more expensive than the linear pruning, plus we already memoize those computations
Rather than iterate through all 2^m subsets, first compute the probabilities of the m conjunctions and immediately return 0 if each conjunction in the union has probability zero, which removes the duplicate computation inside prune_events.
The text was updated successfully, but these errors were encountered: