Metraipolis › archive › dc_73b15319e55c
Finding optimal measurement sequences for broken or constrained measuring devices — arXiv:2611.02470
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02470
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:38:44.043Z
- SHA-256 of the archived text
a5b17e76085ac75c997bcb375d4f459a6e8768dad4700938e7a0651e7cedceaf- Stable URL of this page
https://metraipolis.com/documento/dc_73b15319e55c
How to cite
Finding optimal measurement sequences for broken or constrained measuring devices — arXiv:2611.02470 — arXiv (en), https://arxiv.org/abs/2611.02470 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_73b15319e55c (Metraipolis archive dc_73b15319e55c, sha256 a5b17e76085ac75c997bcb375d4f459a6e8768dad4700938e7a0651e7cedceaf)
BibTeX
@misc{dc73b15319e55c,
title = {Finding optimal measurement sequences for broken or constrained measuring devices — arXiv:2611.02470},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02470},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_73b15319e55c; sha256 a5b17e76085ac75c997bcb375d4f459a6e8768dad4700938e7a0651e7cedceaf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02470. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Measuring devices do not always function perfectly due to fatigue, damage, or malfunction. When device repair or replacement is not possible, it becomes necessary to seek optimal measurements from a broken device. We show this is possible via a sequential decision making process where we optimize measurement sequences over the remaining available measurements using information theory. With dynamic programming, we show greedy measurement sequences are always suboptimal for a simple class of measurement constraints. Greedy measurement sequences generally lead to equiprobable measurement outcomes, while the optimal policy is found to select each measurement in such a way as to assign a low probability to any measurement outcome that triggers a constraint condition; leading to measurement outcomes that are not equiprobable. A measurement sequence generated under this policy is shown to decompress its source: that is, the expected number of measurement outcomes is strictly greater than the number of bits it encodes, defining a key property of constrained measurements. Dynamic programming is inefficient for finding optimal measurement sequences, so we develop an alternative algorithm related to optimal binary decision trees. By deriving upper and lower complexity bounds for the task, we propose this algorithm as an efficient means to find optimal measurements for a broken or constrained measuring device. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.02470 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:05:37.189Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).