Quantifying Information Loss under Coarse-Grained Partitions: A Discrete Framework for Explainable Artificial Intelligence
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914378901618688 |
|---|---|
| author | Izumo, Takashi |
| author_facet | Izumo, Takashi |
| contents | As artificial intelligence (AI) systems are increasingly used in ethically sensitive domains such as education, healthcare, and transportation, balancing accuracy and interpretability has become a central concern. Coarse ethics (CE) motivates coarse-grained evaluations under cognitive, institutional, and contextual constraints, but it still lacks a simple mathematical formalization of admissible coarse-graining and its informational consequences. This paper introduces coarse-grained partitions (CGPs) as a discrete framework for modeling coarse evaluation on a finite totally ordered score scale. A CGP represents coarse evaluation as a partition into grains with an index assignment, and induces a coarse-grained distribution by pushforward. To compare admissible coarse-grainings, we introduce categorical unification (CU), which constructs a canonical fine-scale reconstruction from the coarse representation under minimal assumptions. On this basis, we define a KL-based measure of information loss, $D_{\mathrm{KL\text{-}CU}}$, as the divergence between the original fine-grained distribution and its CU-based reconstruction. We prove that $D_{\mathrm{KL\text{-}CU}}=0$ if and only if the original distribution is already uniform within each grain. This shows that zero loss, in the sense of the proposed measure, is a highly exceptional limiting case rather than a realistic benchmark for ordinary evaluative practice. We also show that the framework leads naturally to an optimization problem for comparing alternative admissible CGPs. Applications to educational grading and explainable AI (XAI) illustrate how the framework clarifies trade-offs among informational fidelity, interpretability, and coarsening cost. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_07347 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantifying Information Loss under Coarse-Grained Partitions: A Discrete Framework for Explainable Artificial Intelligence Izumo, Takashi Artificial Intelligence Information Theory Logic Probability As artificial intelligence (AI) systems are increasingly used in ethically sensitive domains such as education, healthcare, and transportation, balancing accuracy and interpretability has become a central concern. Coarse ethics (CE) motivates coarse-grained evaluations under cognitive, institutional, and contextual constraints, but it still lacks a simple mathematical formalization of admissible coarse-graining and its informational consequences. This paper introduces coarse-grained partitions (CGPs) as a discrete framework for modeling coarse evaluation on a finite totally ordered score scale. A CGP represents coarse evaluation as a partition into grains with an index assignment, and induces a coarse-grained distribution by pushforward. To compare admissible coarse-grainings, we introduce categorical unification (CU), which constructs a canonical fine-scale reconstruction from the coarse representation under minimal assumptions. On this basis, we define a KL-based measure of information loss, $D_{\mathrm{KL\text{-}CU}}$, as the divergence between the original fine-grained distribution and its CU-based reconstruction. We prove that $D_{\mathrm{KL\text{-}CU}}=0$ if and only if the original distribution is already uniform within each grain. This shows that zero loss, in the sense of the proposed measure, is a highly exceptional limiting case rather than a realistic benchmark for ordinary evaluative practice. We also show that the framework leads naturally to an optimization problem for comparing alternative admissible CGPs. Applications to educational grading and explainable AI (XAI) illustrate how the framework clarifies trade-offs among informational fidelity, interpretability, and coarsening cost. |
| title | Quantifying Information Loss under Coarse-Grained Partitions: A Discrete Framework for Explainable Artificial Intelligence |
| topic | Artificial Intelligence Information Theory Logic Probability |
| url | https://arxiv.org/abs/2502.07347 |