3
Note: See the edit at the bottom for an argument showing that there is an unbiased algorithm which has variance strictly lower than $1/12$ for all $x \in [0,1]$.
We can at least prove that if $x$ is chosen uniformly from $[0,1]$, then the average variance must be at least $\pi^2/64 - 1/12$. There is a dithering algorithm that achieves this average-case ...
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
encoding × 29coding-theory × 11
it.information-theory × 9
ds.algorithms × 8
ds.data-structures × 4
reference-request × 2
approximation-algorithms × 2
fl.formal-languages × 2
big-list × 2
space-bounded × 2
cc.complexity-theory × 1
graph-algorithms × 1
co.combinatorics × 1
optimization × 1
automata-theory × 1
time-complexity × 1
lambda-calculus × 1
pr.probability × 1
functional-programming × 1
regular-language × 1
context-free × 1
st.statistics × 1
factoring × 1
markov-chains × 1
shannon-entropy × 1