解锁Delphic集合流中的分数阶矩
Unlocking Fractional Moments in Delphic Set Streams
浏览论文内容
中文总结 AI 辅助
该研究针对Delphic集合流的非整数频率矩估计难题，提出基于多速率采样与数值积分的单遍算法，在有界频率场景下实现多对数级空间与更新时间，并给出移除该假设的复杂性理论障碍。
中文摘要 AI 辅助
我们在有界频率假设（即全域中每个元素最多出现τ次）下，研究Delphic集合流模型中非整数频率矩F_k及相关Bernstein型统计量的估计问题。该模型的核心挑战在于同时维持较低的空间开销与更新时间，这并非易事，因为集合的实际规模可能远大于其表示规模，甚至呈指数级差异。我们的核心洞见是：通过以不同速率对流进行采样，并观测由此得到的不同元素计数值，我们可以“探测”频率分布，并对这些探测结果进行数值积分，以重构一大类统计量。在此基础上，我们进一步关键地发现：随机采样子流的不同元素计数，作为采样率的函数，是一个单一的解析对象，其取值可通过一类互补Laplace型积分确定一大类统计量。在算法层面，我们利用这一性质的方式为：1. 仅在采样子流上使用标准的F_0（不同元素计数）算法来估计这些取值；2. 在精心选择的网格上通过受控数值积分恢复目标统计量。对于k∈(0,1)的F_k，我们提出了首个适用于Delphic集合流的单遍流式算法，在τ=polylog(|Ω|,m)的实际相关场景下，其空间开销与每集合更新时间均为poly(log|Ω|, log m, ε⁻¹, log(1/δ))；在一般情况下，边界关于τ和ε⁻¹为多项式，关于δ⁻¹为对数级。我们还给出了一个复杂性理论层面的障碍，解释了为何移除有界频率假设的下界证明十分困难：排除无限制Delphic F_k的多对数算法，将意味着线性空间阈值计数分离的存在。
英文摘要
We consider estimation of non-integer frequency moments $F_k$ and related Bernstein-type statistics in the Delphic set stream model under a bounded-frequency assumption: every universe element appears at most $τ$ times. The main challenge of this model is to keep space low while also keeping update time low, which is not trivial because the sets can be exponential in size compared to their representations. Our core insight is that by sampling the stream at different rates and observing the resulting distinct-counts, we can 'probe' the frequency distribution and numerically integrate these probes to reconstruct a broad class of statistics. Building on that, we crucially observe that the distinct-count of a randomly sampled substream, viewed as a function of the sampling rate, is a single analytic object whose evaluations determine a broad class of statistics via a complementary Laplace-type integral. Algorithmically we exploit this by: 1. estimating those evaluations using only standard $F_0$ (distinct-count) algorithms on sampled substreams and 2. recovering target statistics by controlled numerical integration on a judiciously chosen grid. For $F_k$ with $k\in (0,1)$ we obtain the first one-pass streaming algorithms for Delphic set streams whose space and per-set update time are $\mathrm{poly}(\log|Ω|,\log m,\varepsilon^{-1},\log(1/δ))$ in the practically relevant regime $τ=\mathrm{polylog}(|Ω|,m)$; in general the bounds are polynomial in $τ$ and $\varepsilon^{-1}$ and logarithmic in $δ^{-1}$. We also give a complexity-theoretic barrier explaining why lower bounds for removing the bounded-frequency assumption appear difficult: ruling out polylogarithmic algorithms for unrestricted Delphic $F_k$ would imply a linear-space threshold-counting separation.
