35 citations · 36 across the 2 of their papers we have counts for
2 papers
cs.LG2022★ 1 cited
Strong Memory Lower Bounds for Learning Natural Models
Gavin Brown, Mark Bun, Adam Smith
We give lower bounds on the amount of memory required by one-pass streaming algorithms for solving several natural learning problems. In a setting where examples lie in …
cs.LG2020★ 35 cited
When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?
Gavin Brown, Mark Bun, Vitaly Feldman +2
Modern machine learning models are complex and frequently encode surprising amounts of information about individual inputs. In extreme cases, complex models appear to memorize enti…