ITs, a structure sensitive information theory
Samuel Sattath

TL;DR
This paper introduces ITs, a structure-sensitive extension of traditional information theory, allowing it to handle and formalize structured states through measures on reduced alphabets, broadening its applicability.
Contribution
It proposes a novel generalization of information theory that incorporates structure via measures on reduced alphabets, extending the theoretical framework within the existing IT paradigm.
Findings
ITs extends traditional IT to structured states
Demonstrates applicability to hierarchical and linear structures
Implications for quantization and foundational understanding
Abstract
Broadly speaking Information theory (IT) assumes no structure of the underlying states. But what about contexts where states do have a clear structure - how should IT cope with such situations? And if such coping is at all possible then - how should structure be expressed so that it can be coped with? A possible answer to these questions is presented here. Noting that IT can cope well with a structure expressed as an accurate clustering (by shifting to the implied reduced alphabet), a generalization is suggested in which structure is expressed as a measure on reduced alphabets. Given such structure an extension of IT is presented where the reduced alphabets are treated simultaneously. This structure-sensitive IT, called ITs, extends traditional IT in the sense that: a)there are structure-sensitive analogs to the notions of traditional IT and b)translating a theorem in IT by replacing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Cognitive Computing and Networks · Neural Networks and Applications
