SummaryLabel distribution learning (LDL) is an emerging learning paradigm, which can be used to solve the label ambiguity problem. In spite of the recent great progress in LDL algorithms considering label correlations, the majority of existing methods only measure pairwise label correlations through the commonly used similarity metric, which is incapable of accurately reflecting the complex relationship between labels. To solve this problem, a novel label distribution learning method—based on high‐order label correlations (LDL‐HLC) is proposed. By virtue of the ‐regularization sparse reconstruction of the label space, the high‐order label correlations matrix is firstly obtained. Then, a new regular term can be constructed to fit the final prediction label distribution via the correction matrix. Furthermore, efficient classification performance and complete feature selection are guaranteed by common features learning via ‐regularization. Finally, the performance and effectiveness of the proposed algorithm are well illustrated through extensive experiments on 14 label distribution datasets and comparisons with some existing algorithms.