We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the data deletion problem for convex models. By leveraging techniques from convex optimization and reservoir sampling, we give the first data deletion algorithms that are able to handle an arbitrarily long sequence of adversarial updates while promising both per-deletion run-time and steady-state error that do not grow with the length of the update sequence. We also introduce several new conceptual distinctions: for example, we can ask that after a deletion, the entire state maintained by the optimization algorithm is statistically indistinguishable from the state that would have resulted had we retrained, or we can ask for the weaker condition that only the observable output is statistically indistinguishable from the observable output that would have resulted from retraining. We are able to give more efficient deletion algorithms under this weaker deletion criterion.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.02923")
get_code_for_paper("2007.02923")
have("2007.02923")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.02923.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.02923)
Connect an agent — have() is free.