Optimal PolynomialTime Estimators: A Bayesian Notion of Approximation Algorithm
Abstract
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that cannot be solved exactly is uncertain and therefore should be described by a random variable. It thus should make sense to talk about the expected value of this random variable, an idea we formalize in the language of averagecase complexity theory by introducing the concept of "optimal polynomialtime estimators." We prove some existence theorems and completeness results, and show that optimal polynomialtime estimators exhibit many parallels with "classical" probability theory.
 Publication:

arXiv eprints
 Pub Date:
 August 2016
 DOI:
 10.48550/arXiv.1608.04112
 arXiv:
 arXiv:1608.04112
 Bibcode:
 2016arXiv160804112K
 Keywords:

 Computer Science  Computational Complexity
 EPrint:
 86 pages