Hardness and Approximability of Dimension Reduction on the Probability Simplex
<|reference_start|>Hardness and Approximability of Dimension Reduction on the Probability Simplex: Dimension reduction is a technique used to transform data from a high-dimensional space into a lower-dimensional space, aiming to retain as much of the original information as possible. This approach is crucial in many disciplines like engineering, biology, astronomy, and economics. In this paper, we consider the following dimensionality reduction instance: Given an n-dimensional probability distribution p and an integer m<n, we aim to find the m-dimensional probability distribution q that is the closest to p, using the Kullback-Leibler divergence as the measure of closeness. We prove that the problem is strongly NP-hard, and we present an approximation algorithm for it.<|reference_end|>
@article{bruno2024hardness,
    title={Hardness and Approximability of Dimension Reduction on the Probability
  Simplex},
    author={Roberto Bruno},
    journal={Algorithms 2024, 17(7), 296},
    year={2024},
    doi={10.3390/a17070296},
    archivePrefix={arXiv},
    eprint={2407.16352},
    primaryClass={cs.DS cs.IT math.IT}
}