Nearest-Neighbor Density Estimation for Dependency Suppression

Kathleen Anderson, Thomas Martinetz
3/4/2026
cs.LGcs.CV

No official code found. Best implementation: ka-anderson/VAE-NN-debias (0 stars, last commit 2025-12-18).

Abstract

The ability to remove unwanted dependencies from data is crucial in various domains, including fairness, robust learning, and privacy protection. In this work, we propose an encoder-based approach that learns a representation independent of a sensitive variable but otherwise preserving essential data characteristics. Unlike existing methods that rely on decorrelation or adversarial learning, our approach explicitly estimates and modifies the data distribution to neutralize statistical dependencies. To achieve this, we combine a specialized variational autoencoder with a novel loss function driven by non-parametric nearest-neighbor density estimation, enabling direct optimization of independence. We evaluate our approach on multiple datasets, demonstrating that it can outperform existing unsupervised techniques and even rival supervised methods in balancing information removal and utility.

View on arXivView PDF

Code Implementations(1)

Nearest-Neighbor Density Estimation for Dependency Suppression

00Shell, PythonDec 18, 202510 months ago

Similar Papers

Cite this paper

@article{anderson2026nearestneighbor,
  title  = {Nearest-Neighbor Density Estimation for Dependency Suppression},
  author = {Kathleen Anderson and Thomas Martinetz},
  year   = {2026},
  eprint = {2603.04224},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.04224v1}
}

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/2603.04224.svg)](https://codeofpaper.com/paper/2603.04224)

Discussion