mlsanityData to 14 Oct 2026

Nearest-Neighbor Density Estimation for Dependency Suppression

arXiv 2603.04224 ↗First posted 4 Mar 2026cs.LG cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 38 references that are in the map. First posted on arXiv 4 Mar 2026.

Builds on

27 of 38 references.

References · 27

  1. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  2. 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,588
  3. 2019CheXpert: A Large Chest Radiograph Dataset with Uncertainty Labels and Expert Comparisoncited by 1,423
  4. 2016Deep Variational Information Bottleneckcited by 930
  5. 2019On Variational Bounds of Mutual Informationcited by 559
  6. 2018Learning Adversarially Fair and Transferable Representationscited by 353
  7. 2015Generative Moment Matching Networkscited by 257
  8. 2018Multiaccuracy: Black-Box Post-Processing for Fairness in Classificationcited by 222
  9. 2021HyperStyle: StyleGAN Inversion with HyperNetworks for Real Image Editingcited by 208
  10. 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
  11. 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 132
  12. 2018Spreading vectors for similarity searchcited by 118
15 more
  1. 2018Invariant Representations without Adversarial Trainingcited by 112
  2. 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 100
  3. 2019Conditional Learning of Fair Representationscited by 78
  4. 2020The Conditional Entropy Bottleneckcited by 75
  5. 2020FR-Train: A Mutual Information-Based Approach to Fair and Robust Trainingcited by 52
  6. 2019Mitigating Information Leakage in Image Representations: A Maximum Entropy Approachcited by 48
  7. 2021Controllable Guarantees for Fair Outcomes via Contrastive Information Estimationcited by 45
  8. 2022Learning Fair Representation via Distributional Contrastive Disentanglementcited by 31
  9. 2016Efficient multivariate entropy estimation via k-nearest neighbour distancescited by 28
  10. 2020Analysis of KNN Density Estimationcited by 28
  11. 2019Invariant Representations through Adversarial Forgettingcited by 20
  12. 2018Unsupervised Adversarial Invariancecited by 14
  13. 2020A Variational Approach to Privacy and Fairnesscited by 14
  14. 2019Generating Fair Universal Representations using Adversarial Modelscited by 12
  15. 2021Learning Invariant Representations using Inverse Contrastive Losscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.