MINERVA: Mutual Information Neural Estimation for Supervised Feature Selection

Taurai Muvunza, Egor Kraev, Pere Planell-Morell, Alexander Y. Shestopaloff
10/2/2025
cs.LGcs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Existing feature filters rely on statistical pair-wise dependence metrics to model feature-target relationships, but this approach may fail when the target depends on higher-order feature interactions rather than individual contributions. We introduce Mutual Information Neural Estimation Regularized Vetting Algorithm (MINERVA), a novel approach to supervised feature selection based on neural estimation of mutual information between features and targets. We paramaterize the approximation of mutual information with neural networks and perform feature selection using a carefully designed loss function augmented with sparsity-inducing regularizers. Our method is implemented in a two-stage process to decouple representation learning from feature selection, ensuring better generalization and a more accurate expression of feature importance. We present examples of ubiquitous dependency structures that are rarely captured in literature and show that our proposed method effectively captures these complex feature-target relationships by evaluating feature subsets as an ensemble. Experimental results on synthetic and real-life fraud datasets demonstrate the efficacy of our method and its ability to perform exact solutions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{muvunza2025minerva,
  title  = {MINERVA: Mutual Information Neural Estimation for Supervised Feature Selection},
  author = {Taurai Muvunza and Egor Kraev and Pere Planell-Morell and Alexander Y. Shestopaloff},
  year   = {2025},
  eprint = {2510.02610},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.02610v2}
}

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

Discussion