On Maximum Entropy Linear Feature Inversion

Paul M Baggenstoss
7/19/2024
cs.LG

No confident code implementation found for this paper.

Abstract

We revisit the classical problem of inverting dimension-reducing linear mappings using the maximum entropy (MaxEnt) criterion. In the literature, solutions are problem-dependent, inconsistent, and use different entropy measures. We propose a new unified approach that not only specializes to the existing approaches, but offers solutions to new cases, such as when data values are constrained to [0, 1], which has new applications in machine learning.

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. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

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

Similar Papers

Cite this paper

@article{baggenstoss2024maximum,
  title  = {On Maximum Entropy Linear Feature Inversion},
  author = {Paul M Baggenstoss},
  year   = {2024},
  eprint = {2407.14166},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.14166v1}
}

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

Discussion