244edd7e85dc81602b7615cd705545f5-Supplemental.pdf

Neural Information Processing Systems 

We begin by proving the lower bound on coverage. The formal proof of this statement is standard at this point, so we simply refer to [3] for the remaining technical details. The proof for the upper bound also immediatelyfollowsfrom(S6)byapplyingLemma2in[3]. The proof is essentially an application of the main result in [2]. This will become apparent after we reduce our claim to the setting in the aforementioned paper.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found