arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.3655cs.DS
收藏

决策树问题中最坏和期望费用的权衡及一个价值依赖模型

Trading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model

Aline Saettler, Eduardo Laber, Ferdinando Cicalese

摘要:

我们研究的问题,评估一个离散函数自适应查询其变量的值,直到读取的值唯一确定的功能的值。读取变量的值是以牺牲一些成本为代价的,目标是设计一种策略(决策树),用于在最坏情况下或在预期中(根据可能变量分配的先验分布)评估尽可能少的成本。除了特殊情况下的问题,在一般情况下,只有这两个措施之一的最小化在文献中讨论。然而,存在这样的问题,其中一个度量的最小化导致相对于另一个度量具有高成本的策略(甚至指数地大于最优)。我们提供了一个新的结构,可以保证这两个标准之间的权衡。更准确地说,给定保证预期成本$E$的决策树和保证最差成本$W$的决策树,我们的方法可以保证对于任何选择的权衡值$ρ$产生决策树,其最差成本是$(1 + ρ)W$,其预期成本是$(1 + \frac{1}ρ)E.$。出于应用程序,我们还研究了一个变量的问题,其中读取变量的成本取决于变量的值。我们提供了一个$O(\log n)$近似算法的最坏的成本措施,这是最好的假设$P \neq NP$下可能的最小化。

英文摘要:

We study the problem of evaluating a discrete function by adaptively querying the values of its variables until the values read uniquely determine the value of the function. Reading the value of a variable is done at the expense of some cost, and the goal is to design a strategy (decision tree) for evaluating the function incurring as little cost as possible in the worst case or in expectation (according to a prior distribution on the possible variables assignments). Except for particular cases of the problem, in general, only the minimization of one of these two measures is addressed in the literature. However, there are instances of the problem for which the minimization of one measure leads to a strategy with a high cost with respect to the other measure (even exponentially bigger than the optimal). We provide a new construction which can guarantee a trade-off between the two criteria. More precisely, given a decision tree guaranteeing expected cost $E$ and a decision tree guaranteeing worst cost $W$ our method can guarantee for any chosen trade-off value $ρ$ to produce a decision tree whose worst cost is $(1 + ρ)W$ and whose expected cost is $(1 + \frac{1}ρ)E.$ These bounds are improved for the relevant case of uniform testing costs. Motivated by applications, we also study a variant of the problem where the cost of reading a variable depends on the variable's value. We provide an $O(\log n)$ approximation algorithm for the minimization of the worst cost measure, which is best possible under the assumption $P \neq NP$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑