Finding optimal measurement sequences for broken or constrained measuring devices
Abstract
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.
Related
- Weight-constrained cut-down de Bruijn sequences
- Near-Optimal Complexity of Finding Approximate Local Minima of Nonconvex Finite Sums
- Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding
- Artificial Rosetta Stone: Constrained Maximum A Posteriori (MAP) Reconstruction of Symbolic Raga Sequences via Order-k Markov Models
- Optimal Biological Dose Combination Finding: A Design Roadmap and Robust Cross-Indication Bayesian Borrowing
BibTeX
@misc{loxley2026finding,
title = {{Finding optimal measurement sequences for broken or constrained measuring devices}},
author = {Peter N. Loxley},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02470},
eprint = {2611.02470},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02470},
}
RIS
TY - UNPB
TI - Finding optimal measurement sequences for broken or constrained measuring devices
AU - Peter N. Loxley
PY - 2026
DA - 2026/11/02
PB - arXiv
DO - 10.48550/arxiv.2611.02470
UR - https://arxiv.org/abs/2611.02470
AB - 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.
ER -