随机响应下极值的更简易估计
Easier Estimation of Extremes under Randomized Response
AI总结:
该研究针对随机响应下含噪比特的极值比特估计问题,证明现有多种估计器可简化为线性时间、常数空间的闭式计算形式,并推导了对应估计器及其方差,降低了计算复杂度。
摘要:
在这篇简短笔记中,我们研究在随机响应机制下,观测到一组代表真实未观测比特$x_i \in \{0, 1\}$的含噪比特$\tilde x_i \in \{0, 1\}$时,比特组合$x_1 \lor \dots \lor x_n = \max_i x_i$的估计问题。我们证明,现有的多种极值比特估计器,包括那些基于计算成本高昂的比特和估计的方法,都可简化为简单的闭式表达式,能以关于$n$的线性时间、常数空间计算,还可在观测到新的$\tilde x_i$时以在线方式运行。我们特别推导了这样一种估计器,并仅用基础方法给出了其方差。
英文摘要:
In this brief note, we consider estimation of the bitwise combination $x_1 \lor \dots \lor x_n = \max_i x_i$ observing a set of noisy bits $\tilde x_i \in \{0, 1\}$ that represent the true, unobserved bits $x_i \in \{0, 1\}$ under randomized response. We demonstrate that various existing estimators for the extreme bit, including those based on computationally costly estimates of the sum of bits, can be reduced to a simple closed form computed in linear time (in $n$) and constant space, including in an online fashion as new $\tilde x_i$ are observed. In particular, we derive such an estimator and provide its variance using only elementary techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。