DeepAI AI Chat
Log In Sign Up

Decision-Making with Complex Data Structures using Probabilistic Programming

by   Brian E. Ruttenberg, et al.
Charles River Analytics Inc.

Existing decision-theoretic reasoning frameworks such as decision networks use simple data structures and processes. However, decisions are often made based on complex data structures, such as social networks and protein sequences, and rich processes involving those structures. We present a framework for representing decision problems with complex data structures using probabilistic programming, allowing probabilistic models to be created with programming language constructs such as data structures and control flow. We provide a way to use arbitrary data types with minimal effort from the user, and an approximate decision-making algorithm that is effective even when the information space is very large or infinite. Experimental results show our algorithm working on problems with very large information spaces.


page 1

page 2

page 3

page 4


Tokenized Data Markets

We formalize the construction of decentralized data markets by introduci...

Exploring Distributed Control with the NK Model

The NK model has been used widely to explore aspects of natural evolutio...

Integrating Data Structures and Algorithms in K-12 Education using Block-based Programming

This paper describes the design and evaluation of DSAScratch, an extensi...

A Short Note on Collecting Dependently Typed Values

Within dependently typed languages, such as Idris, types can depend on v...

ParaSail: A Pointer-Free Pervasively-Parallel Language for Irregular Computations

ParaSail is a language specifically designed to simplify the constructio...

Computable decision making on the reals and other spaces via partiality and nondeterminism

Though many safety-critical software systems use floating point to repre...

On the Design, Implementation, and Use of Laziness in R

The R programming language has been lazy for over twenty-five years. Thi...