منابع مشابه
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic independence. New algorithms, based on multilinear programming, are presented, both for independence among events and among random variables. Separation properties of graphical models are also investigated.
متن کاملQuasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems∗
We are interested in computing the expectation of a functional of a PDE solution under a Bayesian posterior distribution. Using Bayes’s rule, we reduce the problem to estimating the ratio of two related prior expectations. For a model elliptic problem, we provide a full convergence and complexity analysis of the ratio estimator in the case where Monte Carlo, quasi-Monte Carlo, or multilevel Mon...
متن کاملComputing Lower Expectations with Kuznetsov's Independence Condition
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f X and g Y behaves in a certain way: the interval of expected values f X g Y must be equal to the interval product f X g Y . The main result of this paper shows how to compute lower expectations using Kuznetsov’s condition. We also generalize Kuznetsov’s condition to conditional expectation ...
متن کاملLiving up to Expectations: Computing Expert Responses'
In cooperative man-machine interaction, it is necessary but not sufficient for a system to respond truthfully and informatively to a user's question. In particular, if the system has reason to believe that its planned response might mislead the user, then it must block that conclusion by modifying its response. This paper focuses on identifying and avoiding potentially misleading responses by a...
متن کاملThe Support Method of Computing Expectations
A standard method for computing the expectation p x f x dx of a function f on a probabilistic program p is to sample values x%, ... , x( from the generative model of p and approximate the integral by % ( f x* . *,% An alternative approach is to deterministically enumerate a set of values x%, ... , x( in the support of p, give each point x* a weight w*, and numerically approximate the integral b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2000
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(00)00034-7