Raking needs every row seen so far, so keeping weights current on a stream means storing it and refitting. This paper gives a raking method whose state is a fixed set of running totals: each arriving row gets, in closed form, the weight that balances closeness to its design weight against the running gap to population targets. In simulations it comes close to full-data raking with moderate targets at constant cost per row; it falls short with extreme targets and many margins, and where rows can be stored, periodic raking remains the better choice.
Cite: Gaurav Sood. "Streaming Raking in Fixed Memory." https://gsood.com/research/streaming-calibration-with-mwu-and-sgd/
BibTeX:
@misc{soodstreaming,
author = {Gaurav Sood},
title = {{Streaming Raking in Fixed Memory}},
note = {Working paper},
url = {https://gsood.com/research/streaming-calibration-with-mwu-and-sgd/}
}