Probably approximately optimal satisficing strategies
نویسندگان
چکیده
منابع مشابه
Probably Approximately Optimal Satisficing Strategies
A satisscing search problem consists of a set of probabilistic experiments to be performed in some order, seeking a satisfying connguration of successes and failures. The expected cost of the search depends both on the success probabilities of the individual experiments, and on the search strategy, which speciies the order in which the experiments are to be performed. A strategy that minimizes ...
متن کاملProbably Approximately Optimal Satisscing Strategies
A satisscing search problem consists of a set of probabilistic experiments to be performed in some order, seeking a satisfying connguration of successes and failures. The expected cost of the search depends both on the success probabilities of the individual experiments, and on the search strategy, which speciies the order in which the experiments are to be performed. A strategy that minimizes ...
متن کاملProbably Approximately Optimal Derivation Strategies
An inference graph can have many \deriva-tion strategies", each a particular ordering of the steps involved in reducing a given query to a sequence of database retrievals. An \optimal strategy" for a given distribution of queries is a complete strategy whose \expected cost" is minimal, where the expected cost depends on the conditional probabilities that each requested retrieval succeeds , give...
متن کاملProbably Approximately Optimal Query Optimization
Evaluating query predicates on data samples is the only way to estimate their selectivity in certain scenarios. Finding a guaranteed optimal query plan is not a reasonable optimization goal in those cases as it might require an infinite number of samples. We therefore introduce probably approximately optimal query optimization (PAO) where the goal is to find a query plan whose cost is near-opti...
متن کاملProbably Approximately Correct Learning
This paper surveys some recent theoretical results on the efficiency of machine learning algorithms. The main tool described is the notion of Probably Approximately Correct (PAC) 1 earning, introduced by Valiant. We define this learning model and then look at sorne of the results obtained in it. We then consider some criticisms of the PAC model and the extensions proposed to address these criti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/0004-3702(95)00010-0