Efficient Model Updates for Approximate Unlearning of Graph-Structured Data

Eli Chien, Chao Pan, O. Milenkovic
2/12/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models

99% match1 repo42026

Inverse M-Kernels for Linear Universal Approximators of Non-Negative Functions

99% match2026

Intersecting-Boundary-Sensitive Fingerprinting for Tampering Detection of DNN Models

99% match2026

Exploiting Presentative Feature Distributions for Parameter-Efficient Continual Learning of Large Language Models

99% match2026

Mixed-Initiative Multiagent Apprenticeship Learning for Human Training of Robot Teams

99% match2026

Stratified Prediction-Powered Inference for Effective Hybrid Evaluation of Language Models

98% match2026

Cite this paper

@article{chien2026efficient,
  title  = {Efficient Model Updates for Approximate Unlearning of Graph-Structured Data},
  author = {Eli Chien and Chao Pan and O. Milenkovic},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:5e04e20d9c550fc1cef1f1f86b30aadf0492fbac},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/5e04e20d9c550fc1cef1f1f86b30aadf0492fbac.svg)](https://codeofpaper.com/paper/5e04e20d9c550fc1cef1f1f86b30aadf0492fbac)

Discussion