arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.10658cs.CCcs.DM
收藏

基于弱随机约束的决策表压缩

Decision list compression by mild random restrictions

Shachar Lovett, Kewen Wu, Jiapeng Zhang

摘要:

决策列表是规则的有序列表。每个规则都由一个项和一个值指定,该项是文字的合取。给定一个输入,决策列表的输出是对应于第一个规则的值,该规则的项由输入满足。决策列表概括了CNF和DNF,并且已经在复杂性理论和学习理论中进行了研究。决策列表的大小是规则的数量,其宽度是术语中变量的最大数量。我们证明了小宽度的决策列表总是可以近似的决策列表的小尺寸,在那里我们得到尖锐的界限。这特别解决了Gopalan,Meka和Reingold(计算复杂性,2013)关于DNF稀疏化的猜想。我们的证明中的一个成分是一个新的随机限制引理,它允许分析如果一小部分变量是固定的,DNF(以及更一般的决策列表)如何简化。这与更常用的开关引理相反,开关引理要求大多数变量是固定的。

英文摘要:

A decision list is an ordered list of rules. Each rule is specified by a term, which is a conjunction of literals, and a value. Given an input, the output of a decision list is the value corresponding to the first rule whose term is satisfied by the input. Decision lists generalize both CNFs and DNFs, and have been studied both in complexity theory and in learning theory. The size of a decision list is the number of rules, and its width is the maximal number of variables in a term. We prove that decision lists of small width can always be approximated by decision lists of small size, where we obtain sharp bounds. This in particular resolves a conjecture of Gopalan, Meka and Reingold (Computational Complexity, 2013) on DNF sparsification. An ingredient in our proof is a new random restriction lemma, which allows to analyze how DNFs (and more generally, decision lists) simplify if a small fraction of the variables are fixed. This is in contrast to the more commonly used switching lemma, which requires most of the variables to be fixed.

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

↑