Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
<|reference_start|>Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing: We study when low coordinate degree functions (LCDF) -- linear combinations of functions depending on small subsets of entries of a vector -- can hypothesis test between high-dimensional probability measures. These functions are a generalization, proposed in Hopkins' 2018 thesis but seldom studied since, of low degree polynomials (LDP), a class widely used in recent literature as a proxy for all efficient algorithms for tasks in statistics and optimization. Instead of the orthogonal polynomial decompositions used in LDP calculations, our analysis of LCDF is based on the Efron-Stein or ANOVA decomposition, making it much more broadly applicable. By way of illustration, we prove channel universality for the success of LCDF in testing for the presence of sufficiently "dilute" random signals through noisy channels: the efficacy of LCDF depends on the channel only through the scalar Fisher information for a class of channels including nearly arbitrary additive i.i.d. noise and nearly arbitrary exponential families. As applications, we extend lower bounds against LDP for spiked matrix and tensor models under additive Gaussian noise to lower bounds against LCDF under general noisy channels. We also give a simple and unified treatment of the effect of censoring models by erasing observations at random and of quantizing models by taking the sign of the observations. These results are the first computational lower bounds against any large class of algorithms for all of these models when the channel is not one of a few special cases, and thereby give the first substantial evidence for the universality of several statistical-to-computational gaps.<|reference_end|>
@article{kunisky2024low,
    title={Low coordinate degree algorithms I: Universality of computational
  thresholds for hypothesis testing},
    author={Dmitriy Kunisky},
    journal={arXiv preprint arXiv:2403.07862},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.07862},
    primaryClass={math.ST cs.DS math.PR stat.ML stat.TH}
}