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

近似$\mathbb{F}_2$ -估价函数的草图

Approximate $\mathbb{F}_2$-Sketching of Valuation Functions

Grigory Yaroslavtsev, Samson Zhou

摘要:

我们研究的问题,构造一个线性草图的最小尺寸,允许逼近一个给定的实值函数$f \colon \mathbb{F}_2^n \rightarrow \mathbb R$与小的期望平方误差。我们开发了一个一般的线性素描理论,通过这些功能,我们分析其尺寸最常用的研究类型的估值函数:添加剂,添加剂,覆盖,$α$ -Lipschitz次模和拟阵秩函数。这给出了关于输入$x$必须存储多少位信息的表征,使得可以在对其坐标的加法更新下计算$f$。我们的结果是紧在大多数情况下,我们也给扩展的分布式版本的输入$x \in \mathbb{F}_2^n$均匀随机生成的问题。使用已知的连接与动态流算法,在我们的工作中获得的尺寸上的上限和下限扩展到空间复杂度的算法评估$f(x)$下的长序列的添加剂更新的输入$x$作为流。类似的结果也适用于分布式环境中的同时通信。

英文摘要:

We study the problem of constructing a linear sketch of minimum dimension that allows approximation of a given real-valued function $f \colon \mathbb{F}_2^n \rightarrow \mathbb R$ with small expected squared error. We develop a general theory of linear sketching for such functions through which we analyze their dimension for most commonly studied types of valuation functions: additive, budget-additive, coverage, $α$-Lipschitz submodular and matroid rank functions. This gives a characterization of how many bits of information have to be stored about the input $x$ so that one can compute $f$ under additive updates to its coordinates. Our results are tight in most cases and we also give extensions to the distributional version of the problem where the input $x \in \mathbb{F}_2^n$ is generated uniformly at random. Using known connections with dynamic streaming algorithms, both upper and lower bounds on dimension obtained in our work extend to the space complexity of algorithms evaluating $f(x)$ under long sequences of additive updates to the input $x$ presented as a stream. Similar results hold for simultaneous communication in a distributed setting.

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

↑