# Probabilistic Neural Programs

Source: [Probabilistic Neural Programs](<https://www.sota2.com/research/paper/68fa62fe1e209131ce9fc0e1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:30:18.740Z

Authors: Kenton W. Murray, Jayant Krishnamurthy

Published: 2016-12-02T15:46:09.000Z

## Abstract

We present probabilistic neural programs, a framework for program induction that permits flexible specification of both a computational model and inference algorithm while simultaneously enabling the use of deep neural networks. Probabilistic neural programs combine a computation graph for specifying a neural network with an operator for weighted nondeterministic choice. Thus, a program describes both a collection of decisions as well as the neural network architecture used to make each one. We evaluate our approach on a challenging diagram question answering task where probabilistic neural programs correctly execute nearly twice as many programs as a baseline model.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1612.00712>)

[PDF](<https://arxiv.org/pdf/1612.00712.pdf>)
