Expert Systems with Applications · 2026

MUKSB: Machine Unlearning via Kalai–Smorodinsky Bargaining

School of Computing and Electrical Engineering, Indian Institute of Technology Mandi,
Kamand, Mandi, Himachal Pradesh 175005, India
* corresponding author   ·   † equal contribution

Selective forgetting, in motion

Original model · all concepts intact After MUKSB · targeted concepts erased, the rest preserved
forget set retained (utility preserved)

Unlearning is easy if you are willing to break the model. The hard part is erasing the forget set while everything else keeps working — retention is what makes it difficult.

Why bargaining

forget gf retain gr KS update stays balanced

The two objectives pull against each other, and whichever one dominates decides the outcome — that is why unlearning either fails or wrecks the model. MUKSB treats them as two players in a cooperative bargaining game and takes the Kalai–Smorodinsky solution: the normalized bisector of the two unit gradients, scaled by the harmonic mean of their norms. The result is a single, conflict-free update in which both sides make equal relative progress.

Abstract

Modern generative models are continuously updated and adapted rather than remaining fixed after training, which introduces growing concerns around privacy leakage and unintended exposure of sensitive information. Machine unlearning aims to eliminate the influence of such concepts from a trained model while maintaining its overall utility. In generative models, this can be formulated as a dual-objective optimization problem that balances forgetting and retention, but these objectives often conflict, and one can dominate the optimization process, leading to ineffective unlearning or degraded performance.

We propose MUKSB (Machine Unlearning via Kalai–Smorodinsky Bargaining), which models the interplay between forgetting and retention as a coordinated optimization process inspired by game theory, allowing both objectives to contribute proportionally while mitigating imbalance during updates. We evaluate our methodology on image classification and text-to-image generation benchmarks, including concept removal in diffusion models and unlearning in image editing tasks. Our approach achieves stronger forgetting with minimal utility loss and demonstrates improved robustness to adversarial prompts while resisting relearning of distinct object-level concepts, thus maintaining high generation image quality.

Datasets, tasks & models

Datasets

CIFAR-10 / CIFAR-100 · SVHNimage classification
CelebA-HQ-307face forgetting
Imagenette-10object-class erasure
I2Punsafe prompts
COCOretention & image quality
P4D · Ring-A-Bell · UnlearnDiffAtk · MMA-Diffusionadversarial attack benchmarks
UnlearnCanvasartistic-style erasure
Celebrity Face Datasetidentity erasure

Tasks

Sample- & class-wise forgettingimage classification
Concept / NSFW erasuretext-to-image generation
Object-class forgettingdiffusion generation
Instruction-guided editing unlearningsafe image editing
Style & celebrity-identity erasureconcept removal
Adversarial robustnessweight- & prompt-based attacks

Models

ResNet-18 & ResNet-34image-classification backbones
DDPMclassifier-free guidance (CIFAR-10)
Stable Diffusion v1.4primary text-to-image backbone
SDXL & Stable Diffusion 3cross-architecture generalization
InstructPix2Pixinstruction-guided image editing
EvaluatorsNudeNet · Q16 · Qwen2.5-VL · CLIP · FID

Keywords

Machine Unlearning Kalai–Smorodinsky Bargaining Text-to-Image Concept Erasing Gradient Conflict

Cite this work

@article{DUBEY2026133675,
  title   = {MUKSB: Machine Unlearning via Kalai-Smorodinsky Bargaining},
  author  = {Adarsh Dubey and Mridul Sharma and Parimala Kancharla},
  journal = {Expert Systems with Applications},
  pages   = {133675},
  year    = {2026},
  issn    = {0957-4174},
  doi     = {10.1016/j.eswa.2026.133675},
  url     = {https://www.sciencedirect.com/science/article/pii/S0957417426025832}
}