Hardness of sampling solutions from the Symmetric Binary Perceptron
<|reference_start|>Hardness of sampling solutions from the Symmetric Binary Perceptron: We show that two related classes of algorithms, stable algorithms and Boolean circuits with bounded depth, cannot produce an approximate sample from the uniform measure over the set of solutions to the symmetric binary perceptron model at any constraint-to-variable density. This result is in contrast to the question of finding \emph{a} solution to the same problem, where efficient (and stable) algorithms are known to succeed at sufficiently low density. This result suggests that the solutions found efficiently -- whenever this task is possible -- must be highly atypical, and therefore provides an example of a problem where search is efficiently possible but approximate sampling from the set of solutions is not, at least within these two classes of algorithms.<|reference_end|>
@article{alaoui2024hardness,
    title={Hardness of sampling solutions from the Symmetric Binary Perceptron},
    author={Ahmed El Alaoui and David Gamarnik},
    journal={arXiv preprint arXiv:2407.16627},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.16627},
    primaryClass={math.PR cs.DS}
}