Randomness used for sample queries can be reused across the outer iterations of variance-reduction solvers, reducing sample-query complexity by a factor equal to the number of outer iterations while preserving correctness.
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Reusing Samples in Variance Reduction
Randomness used for sample queries can be reused across the outer iterations of variance-reduction solvers, reducing sample-query complexity by a factor equal to the number of outer iterations while preserving correctness.