Functional tensors for probabilistic programming
Funsor is a tensor-like library for functions and distributions.
See
Functional tensors for probabilistic programming
for a system description.
Install using pip:
Funsor supports Python 3.7+.
pip install funsor
Install from source:
git clone [email protected]:pyro-ppl/funsor.git
cd funsor
git checkout master
pip install .
Funsor can be used through a number of interfaces:
See design doc.
The goal of this library is to generalize Pyro’s delayed
inference algorithms from discrete to continuous variables, and to create
machinery to enable partially delayed sampling compatible with universality. To
achieve this goal this library makes three orthogonal design choices:
Open terms are objects. Funsors generalize the tensor interface
to also cover arbitrary functions of multiple variables (“inputs”), where
variables may be integers, real numbers, or real tensors. Function
evaluation / substitution is the basic operation, generalizing tensor
indexing. This allows probability distributions to be first-class Funsors
and make use of existing tensor machinery, for example we can generalize
tensor contraction to computing analytic integrals in conjugate
probabilistic models.
Support nonstandard interpretation. Funsors support user-defined
interpretations, including, eager, lazy, mixed eager+lazy, memoized (like
opt_einsum’s sharing), and approximate interpretations like Monte Carlo
approximations of integration operations (e.g. .sum()
over a funsor
dimension).
Named dimensions. Substitution is the most basic operation of Funsors. To
avoid the difficulties of broadcasting and advanced indexing in
positionally-indexed tensor libraries, all Funsor dimensions are named.
Indexing uses the .__call__()
method and can be interpreted as
substitution (with well-understood semantics). Funsors are viewed as
algebraic expressions with one algebraic free variable per dimension. Each
dimension is either covariant (an output) or contravariant (an input).
Using funsor
we can easily implement Pyro-style
delayed sampling, roughly:
trace_log_prob = 0.
def pyro_sample(name, dist, obs=None):
assert isinstance(dist, Funsor)
if obs is not None:
value = obs
elif lazy:
# delayed sampling (like Pyro's parallel enumeration)
value = funsor.Variable(name, dist.support)
else:
value = dist.sample('value')[0]['value']
# save log_prob in trace
trace_log_prob += dist(value)
return value
# ...later during inference...
loss = -trace_log_prob.reduce(logaddexp) # collapses delayed variables
See funsor/minipyro.py for complete implementation.
If you use Funsor, please consider citing:
@article{obermeyer2019functional,
author = {Obermeyer, Fritz and Bingham, Eli and Jankowiak, Martin and
Phan, Du and Chen, Jonathan P},
title = {{Functional Tensors for Probabilistic Programming}},
journal = {arXiv preprint arXiv:1910.10775},
year = {2019}
}