几乎必然终止概率规划的密度几乎处处可微
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
摘要:
研究了具有递归和条件的高阶统计概率规划的微分性质。我们的出发点是Hongseok Yang提出的一个开放问题:什么样的统计概率程序具有几乎处处可微的密度?为了正式的问题,我们考虑统计PCF(SPCF),呼叫值PCF与实数的扩展,和结构的采样和调节。我们给SPCF一个采样风格的操作语义a la Borgstrom et al.,并研究可能的执行轨迹集合上的相关联的权重(通常称为密度)函数和价值函数。我们的主要结果是,几乎肯定终止的SPCF程序,从一组原始函数(例如一组解析函数)满足温和的封闭性,具有重量和价值函数,几乎处处可微。我们使用符号执行的随机形式来推理几乎处处可微性。这项工作的一个副产品是,几乎肯定终止的确定性(S)PCF程序与实参数表示的功能,几乎处处可微。我们的结果是有实际意义的,因为几乎无处不在的密度函数的可微性,主要的基于梯度的推理算法的正确性。
英文摘要:
We study the differential properties of higher-order statistical probabilistic programs with recursion and conditioning. Our starting point is an open problem posed by Hongseok Yang: what class of statistical probabilistic programs have densities that are differentiable almost everywhere? To formalise the problem, we consider Statistical PCF (SPCF), an extension of call-by-value PCF with real numbers, and constructs for sampling and conditioning. We give SPCF a sampling-style operational semantics a la Borgstrom et al., and study the associated weight (commonly referred to as the density) function and value function on the set of possible execution traces. Our main result is that almost-surely terminating SPCF programs, generated from a set of primitive functions (e.g. the set of analytic functions) satisfying mild closure properties, have weight and value functions that are almost-everywhere differentiable. We use a stochastic form of symbolic execution to reason about almost-everywhere differentiability. A by-product of this work is that almost-surely terminating deterministic (S)PCF programs with real parameters denote functions that are almost-everywhere differentiable. Our result is of practical interest, as almost-everywhere differentiability of the density function is required to hold for the correctness of major gradient-based inference algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。