-
An implementation of the sum-product algorithm ([belief propagation](https://en.wikipedia.org/wiki/Belief_propagation)?) for inference in straight-line generative code with only enumerable stochastic …
-
1. Function to naively-convert [0-1] seg probs to [0, 1] (just 0 or 1) - we will just use max on seg probs obtained from the current iterative sum-product (or some other future) algorithm so this is a…
-
In #3762, @MarkFischinger found that the implementation of `EuclideanDistance::Evaluate()` (which internally uses `arma::norm()`) is not as fast as using the equivalent identity `d(x, y)^2 = + - 2`.…
-
The best way to do bulk few-limb arithmetic on real numbers seems to be to convert to fixed-point form for things like matrix multiplication, FFT and polynomial multiplication. This generally means us…
-
### Proposed new feature or change:
This is to follow up the discussion in the mailing list.
From my POV, sum for medium sized arrays (50k+) often becomes a bottleneck in greedy algorithms that …
dg-pb updated
3 months ago
-
As shown in #17, the rotation recurrence is not accurate, because of numerical accuracy issue.
It seems likely we should implement more stable algorithms similar techniques to those in [Accurate
sum…
-
My work in #1119 for neoclassical stuff will be bottlenecked by root finding. The PR that closes this issue will resolve this, and the benefits should assist any other objective that requires a coordi…
-
Dear Author,
I got this error after installing this package. Can you tell me what I need to do?
`TypeError Traceback (most recent call last)
in ()
39 # Pe…
-
[OgRuOi05.pdf](http://www.ti3.tuhh.de/paper/rump/OgRuOi05.pdf) is a dead link and i cant reconstruct what it actually refers to, though its definitely true that this stuff is related to shewchuk's w…
-
### Generalizing tensor variable elimination to dynamic factor graphs
- [x] #398 A version of `modified_partial_sum_product` that works for time lag 1, and tests that compare it to `partial_sum_pro…