What a Deletion Certificate Covers, and Where It Expires: Auditable Removal from a Support-Vector Memory
Read the original on arXiv Machine Learning →The paper investigates how to provide verifiable deletion certificates for a dense key–value context memory used in support‑vector‑based readouts. By assigning explicit weights to keys and using a one‑class support‑vector boundary, the authors show that reserve keys can be removed without re‑solving, while active keys can be deleted with a decremental solver that matches the result of a full re‑solve. Extensive experiments on synthetic, near‑duplicate, clinical, and learned key sets demonstrate that maintained deletion achieves the same reference state as re‑solve, with negligible readout disagreement and significant speedups.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.