On the public citation graph
LaVA: Flexible Machine Unlearning through Learnable Vector Arithmetic
0 signed · 7 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/j.patcog.2024.111094openalex-snapshot
Improving stability and performance of spiking neural networks through enhancing temporal consistency
inferredcites →https://doi.org/10.1016/j.patcog.2025.111777openalex-snapshot
DLIENet: A lightweight low-light image enhancement network via knowledge distillation
inferredcites →https://doi.org/10.1016/j.patcog.2025.112051openalex-snapshot
Verifiably robust conformal prediction for probabilistic guarantees under adversarial attacks
inferredcites →https://doi.org/10.1038/s42256-025-00985-0openalex-snapshot
Rethinking machine unlearning for large language models
inferredcites →https://doi.org/10.1109/tnnls.2023.3266233openalex-snapshot
Fast Yet Effective Machine Unlearning
inferredcites →https://doi.org/10.1145/3679014openalex-snapshot
A Survey on Federated Unlearning: Challenges, Methods, and Future Directions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.