Probably Approximately Knowing

07/06/2020
by   Nitzan Zamir, et al.
0

Whereas deterministic protocols are typically guaranteed to obtain particular goals of interest, probabilistic protocols typically provide only probabilistic guarantees. This paper initiates an investigation of the interdependence between actions and subjective beliefs of agents in a probabilistic setting. In particular, we study what probabilistic beliefs an agent should have when performing actions, in a protocol that satisfies a probabilistic constraint of the form: 'Condition C should hold with probability at least p when action a is performed'. Our main result is that the expected degree of an agent's belief in C when it performs a equals the probability that C holds when a is performed. Indeed, if the threshold of the probabilistic constraint should hold with probaility p=1-x^2 for some small value of x then, with probability 1-x, when the agent acts it will assign a probabilistic belief no smaller than 1-x to the possibility that C holds. In other words, viewing strong belief as, intuitively, approximate knowledge, the agent must probably approximately know (PAK-know) that C is true when it acts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2013

The Relationship between Knowledge, Belief and Certainty

We consider the relation between knowledge and certainty, where a fact i...
research
09/09/1998

Reasoning about Noisy Sensors and Effectors in the Situation Calculus

Agents interacting with an incompletely known world need to be able to r...
research
04/26/2022

On the Verification of Belief Programs

In a recent paper, Belle and Levesque proposed a framework for a type of...
research
06/24/2016

Relating Knowledge and Coordinated Action: The Knowledge of Preconditions Principle

The Knowledge of Preconditions principle (KoP) is proposed as a widely a...
research
09/06/2022

Risk Aware Belief-dependent Constrained POMDP Planning

Risk awareness is fundamental to an online operating agent. However, it ...
research
07/22/2019

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...
research
01/08/2021

Sequential Naive Learning

We analyze boundedly rational updating from aggregate statistics in a mo...

Please sign up or login with your details

Forgot password? Click here to reset