๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational tradeoffs under bounded resources

โœ Scribed by Eric Horvitz; Shlomo Zilberstein


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
39 KB
Volume
126
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis


Over the nearly fifty years of research in Artificial Intelligence, investigators have continued to highlight the computational hardness of implementing core competencies associated with intelligence. Key pillars of AI, including search, constraint propagation, belief updating, learning, decision making, and the associated real-world challenges of planning, perception, natural language understanding, speech recognition, and automated conversation continue to make salient the omnipresent wall of computational hardness. Early pioneers in AI research, including Allen Newell and Herbert Simon, established a long tradition of battling obvious intractabilities by resorting to approximations that relied on heuristic procedures-informal policies that appeared to perform acceptably on subsets of real-world problems. Bounded rationality was conceived and popularized in the context of sample applications that relied on such heuristic procedures to struggle through overwhelming complexity.

In the mid-1980s, several researchers began to pursue a line of research aimed at better understanding and formalizing tradeoffs under bounded representational and computational resources. During this time, a palpable shift in perspective occurred with regard to tackling resource limitations. Rather than viewing scarce resources as an unfortunate impediment, foiling at every turn attempts to perform automated problem solving on realistic challenges, investigators began to consider tradeoffs under scarce resources as a rich arena for focused AI research. Passionate researchers suggested that elusive principles of intelligence might actually be founded in developing a deeper understanding of how systems might grapple, in an implicit or explicit resource aware manner, with scarce, varying, or uncertain time and memory resources. Beyond computational resources, the interaction of limited resources and constraints associated with fixed problem-solving architectures were explored. Older, informal notions of bounded rationality soon gave way to richer, more comprehensive approaches to rational computational and real-world actions that incorporate considerations of resource costs and constraints.


๐Ÿ“œ SIMILAR VOLUMES


Special issue on computational tradeoffs
๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

Over the last decade, AI researchers have investigated flexible inferential procedures and representations that allow reasoning systems to gracefully trade off one or more dimensions of the quality of inferred results for the quantity of time or memory required to generate the results. Methods for m

Special issue on computational tradeoffs
๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB

Over the last decade, AI researchers have investigated flexible inferential procedures and representations that allow reasoning systems to gracefully trade off one or more dimensions of the quality of inferred results for the quantity of time or memory required to generate the results. Methods for m

Special issue on computational tradeoffs
โœ Eric Horvitz; Shlomo Zilberstein ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB

Over the last decade, AI researchers have investigated flexible inferential procedures and representations that allow reasoning systems to gracefully trade off one or more dimensions of the quality of inferred results for the quantity of time or memory required to generate the results. Methods for m

Resource bounded randomness and computat
โœ Yongge Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is indepen

Resource bounded and anytime approximati
โœ Rolf Haenni; Norbert Lehmann ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 441 KB

This paper proposes a new approximation method for Dempster-Shafer belief functions. The method is based on a new concept of incomplete belief potentials. It allows to compute simultaneously lower and upper bounds for belief and plausibility. Furthermore, it can be used for a resource-bounded propag