The forget-set identification problem

DOI10.1007/S10994-025-06897-9MaRDI QIDQ6903733zbMATH OpenFDO

Authors Andrea D'Angelo, Francesco Gullo, Giovanni Stilo

Publication date 10 November 2025

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

neural networkred-blue set covermodel editingmachine unlearningtrustworthy AIforget set

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07)

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• A constant-factor approximation algorithm for red-blue set cover with unit disks
• A theory of the learnable
• A tutorial on Fisher information
• Algorithms for the set covering problem
• Approximating red-blue set cover and minimum monotone satisfying assignment
• Geometric red-blue set cover for unit squares and related problems
• Kernel methods and machine learning
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
• Red blue set cover problem on axis-parallel hyperplanes and other objects
• The hardness of approximating spanner problems

This page was built for publication: The forget-set identification problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903733)