Pith. sign in

REVIEW 1 cited by

Signal Enhancement as Minimization of Relevant Information Loss

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1205.6935 v2 pith:V4F56OXT submitted 2012-05-31 cs.IT math.IT

classification cs.ITmath.IT
keywords informationrelevantlossenhancementproblemsignalaforementionedalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce the notion of relevant information loss for the purpose of casting the signal enhancement problem in information-theoretic terms. We show that many algorithms from machine learning can be reformulated using relevant information loss, which allows their application to the aforementioned problem. As a particular example we analyze principle component analysis for dimensionality reduction, discuss its optimality, and show that the relevant information loss can indeed vanish if the relevant information is concentrated on a lower-dimensional subspace of the input space.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantifying imperfect cognition via achieved information gain

    cs.IT 2025-02 conditional novelty 5.0 of 10

    Achieved information gain, the ideal-minus-remaining relative entropy, quantifies how much of an update to a belief state is actually correct and can be negative for misleading updates.

Pith tools