arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.04931cs.DSmath.PR
收藏

面向增量流的通用完美采样器

Universal Perfect Samplers for Incremental Streams

Seth Pettie, Dingyu Wang

AI总结:

针对增量正更新流,论文基于 Lévy 过程 Laplace 指数类提出精确 $G$ 采样器,分别仅用 2 字内存和高概率 $O(\log n)$ 字内存实现固定与查询时通用采样。

摘要:

若 $G:\mathbb{R}_+\to\mathbb{R}_+$,则向量 $\mathbf{x}\in\mathbb{R}_+^n$ 的 $G$ 矩定义为 $G(\mathbf{x})=\sum_{v\in[n]}G(\mathbf{x}(v))$,而 $G$ 采样问题是根据索引对该 $G$ 矩的贡献选择一个索引 $v_*\in[n]$,即满足 $\Pr(v_*=v)=G(\mathbf{x}(v))/G(\mathbf{x})$。近似 $G$ 采样器可能给该概率引入乘性和/或加性误差,并且有些采样器具有不可忽略的失败概率。本文聚焦精确 $G$ 采样问题,其中 $G$ 选自非负一维 Lévy 过程的 Laplace 指数构成的函数类 $\mathcal{G}$;该类包含若干已被充分研究的类别,例如 $p$ 阶矩 $G(z)=z^p$($p\in[0,1]$)、对数函数 $G(z)=\log(1+z)$,以及 Cohen 和 Geri 提出的软凹次线性函数,后者用于逼近包括 cap 统计量在内的凹次线性函数。我们针对以正更新增量流形式给出的向量 $\mathbf{x}\in\mathbb{R}_+^n$ 开发了 $G$ 采样器。具体而言:对于任意 $G\in\mathcal{G}$,我们给出一个非常简单的 $G$ 采样器,它使用 2 个字的内存,并始终保存一个 $v_*\in[n]$,使得 $\Pr(v_*=v)$ 恰好等于 $G(\mathbf{x}(v))/G(\mathbf{x})$。我们还给出一个“通用” $\mathcal{G}$ 采样器,它以高概率使用 $O(\log n)$ 个字的内存,并在查询时给定任意 $G\in\mathcal{G}$ 后产生精确的 $G$ 样本。在增加因子 $k$ 的开销下,两种采样器都可用于对含 $k$ 个索引的序列进行有放回或无放回的 $G$ 采样。我们的采样框架简单且通用,可轻松推广到从图和超图等更复杂对象中进行采样。

英文摘要:

If $G : \mathbb{R}_+ \to \mathbb{R}_+$, the $G$-moment of a vector $\mathbf{x}\in\mathbb{R}_+^n$ is $G(\mathbf{x}) = \sum_{v\in[n]} G(\mathbf{x}(v))$ and the $G$-sampling problem is to select an index $v_*\in [n]$ according to its contribution to the $G$-moment, i.e., such that $\Pr(v_*=v) = G(\mathbf{x}(v))/G(\mathbf{x})$. Approximate $G$-samplers may introduce multiplicative and/or additive errors to this probability, and some have a non-trivial probability of failure. In this paper we focus on the exact $G$-sampling problem, where $G$ is selected from the class $\mathcal{G}$ of Laplace exponents of non-negative, one-dimensional Lévy processes, which includes several well studied classes such as $p$th moments $G(z)=z^p$, $p\in[0,1]$, logarithms $G(z)=\log(1+z)$, Cohen and Geri's soft concave sublinear functions, which are used to approximate concave sublinear functions, including cap statistics. We develop $G$-samplers for a vector $\mathbf{x} \in \mathbb{R}_+^n$ that is presented as an incremental stream of positive updates. In particular: * For any $G\in\mathcal{G}$, we give a very simple $G$-sampler that uses 2 words of memory and stores at all times a $v_*\in [n]$, such that $\Pr(v_*=v)$ is exactly $G(\mathbf{x}(v))/G(\mathbf{x})$. * We give a ``universal'' $\mathcal{G}$-sampler that uses $O(\log n)$ words of memory w.h.p., and given any $G\in \mathcal{G}$ at query time, produces an exact $G$-sample. With an overhead of a factor of $k$, both samplers can be used to $G$-sample a sequence of $k$ indices with or without replacement. Our sampling framework is simple and versatile, and can easily be generalized to sampling from more complex objects like graphs and hypergraphs.

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

↑