Learning Convex Sets of Probability from Data - Robotics Institute Carnegie Mellon University

Learning Convex Sets of Probability from Data

Fabio Cozman and Lonnie Chrisman
Tech. Report, CMU-RI-TR-97-25, Robotics Institute, Carnegie Mellon University, June, 1997

Abstract

Several theories of inference and decision employ sets of probability distributions as the fundamental representation of (subjective) belief. This paper investigates a frequentist connection between empirical data and convex sets of probability distributions. Building on earlier work by Walley and Fine, a framework is advanced in which a sequence of random outcomes can be described as being drawn from a convex set of distributions, rather than just from a single distribution. The extra generality can be detected from observable characteristics of the outcome sequence. The paper presents new asymptotic convegence results paralleling the laws of large numbers in probability theory, and concludes with a comparison between this approach and approaches based on prior subjective constraints.

BibTeX

@techreport{Cozman-1997-14415,
author = {Fabio Cozman and Lonnie Chrisman},
title = {Learning Convex Sets of Probability from Data},
year = {1997},
month = {June},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-97-25},
}