Estimating the Value of Computation in Flexible Information Refinement
Abstract
We outline a method to estimate the value of computation for a flexible algorithm using empirical data. To determine a reasonable trade-off between cost and value, we build an empirical model of the value obtained through computation, and apply this model to estimate the value of computation for quite different problems. In particular, we investigate this trade-off for the problem of constructing policies for decision problems represented as influence diagrams. We show how two features of our anytime algorithm provide reasonable estimates of the value of computation in this domain.
Cite
Text
Horsch and Poole. "Estimating the Value of Computation in Flexible Information Refinement." Conference on Uncertainty in Artificial Intelligence, 1999.Markdown
[Horsch and Poole. "Estimating the Value of Computation in Flexible Information Refinement." Conference on Uncertainty in Artificial Intelligence, 1999.](https://mlanthology.org/uai/1999/horsch1999uai-estimating/)BibTeX
@inproceedings{horsch1999uai-estimating,
title = {{Estimating the Value of Computation in Flexible Information Refinement}},
author = {Horsch, Michael C. and Poole, David L.},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1999},
pages = {297-304},
url = {https://mlanthology.org/uai/1999/horsch1999uai-estimating/}
}