Preserving Randomness for Adaptive Algorithms.

William M. Hoza
William M. Hoza

international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques, pp. 43:1-43:19, 2018.

被引用1|浏览14
EI

摘要

Suppose $\mathsf{Est}$ is a randomized estimation algorithm that uses $n$ random bits and outputs values in $\mathbb{R}^d$. We show how to execute $\mathsf{Est}$ on $k$ adaptively chosen inputs using only $n + O(k \log(d + 1))$ random bits instead of the trivial $nk$ (at the cost of mild increases in the error and failure probability). ...更多

代码

数据

ZH
24小时获取PDF
引用
您的评分 :
0

 

标签
评论