Multiscale FFT algorithm improves privacy loss accounting for random allocation
Multiscale FFT reduces runtime from quadratic to O(α^{-1} log(1/α)) and rounding errors to O(α^2/log(t)) for DP-SGD with PREAMBLE.
1 stories, newest first · one card per story
Multiscale FFT reduces runtime from quadratic to O(α^{-1} log(1/α)) and rounding errors to O(α^2/log(t)) for DP-SGD with PREAMBLE.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views