线性规划中的元素抽取问题与确定性代价和有限适应性代价
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries
摘要:
次线性算法的两种广泛使用的计算范例是使用线性测量来对高维输入执行计算和使用结构化查询来访问大量输入。通常,前一种范式中的算法是非自适应的,而后者中的算法是高度自适应的。这项工作研究的基本搜索问题的\textsc{element-extraction}的查询模型,结合两者:线性测量有界自适应。在\textsc{element-extraction}问题中,给定一个非零向量$\mathbf{z} = (z_1,\ldots,z_n) \in \{0,1\}^n$,并且必须报告一个索引$i$,其中$z_i = 1$。输入可以使用它的任意线性函数来访问,其系数在某些环中。这个问题承认一个有效的非自适应随机化解决方案(通过众所周知的$\ell_0$采样技术)和一个有效的完全自适应确定性解决方案(通过二进制搜索)。我们证明,当仅限于$k$轮的自适应性,一个确定性的\textsc{element-extraction}算法必须花费$Ω(k (n^{1/k} -1))$查询,当工作在环的整数模一些固定的$q$。这与相应的上限相匹配。对于使用整数运算的查询,我们证明了$2$轮$\widetildeΩ(\sqrt{n})$下界,也紧到多对数因子。我们的证明减少到组合数学中的经典问题,并利用{ \em零和问题}以及最近改进的{ \em向日葵引理}的既定结果。
英文摘要:
Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former paradigm are non-adaptive whereas those in the latter are highly adaptive. This work studies the fundamental search problem of \textsc{element-extraction} in a query model that combines both: linear measurements with bounded adaptivity. In the \textsc{element-extraction} problem, one is given a nonzero vector $\mathbf{z} = (z_1,\ldots,z_n) \in \{0,1\}^n$ and must report an index $i$ where $z_i = 1$. The input can be accessed using arbitrary linear functions of it with coefficients in some ring. This problem admits an efficient nonadaptive randomized solution (through the well known technique of $\ell_0$-sampling) and an efficient fully adaptive deterministic solution (through binary search). We prove that when confined to only $k$ rounds of adaptivity, a deterministic \textsc{element-extraction} algorithm must spend $Ω(k (n^{1/k} -1))$ queries, when working in the ring of integers modulo some fixed $q$. This matches the corresponding upper bound. For queries using integer arithmetic, we prove a $2$-round $\widetildeΩ(\sqrt{n})$ lower bound, also tight up to polylogarithmic factors. Our proofs reduce to classic problems in combinatorics, and take advantage of established results on the {\em zero-sum problem} as well as recent improvements to the {\em sunflower lemma}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。