<p>In large-scale distributed training, communication compression techniques are widely used to reduce the significant communication overhead caused by the frequent exchange of model parameters or gradients between training nodes. However, these techniques often introduce additional computational complexity and may lead to data loss, thereby affecting model convergence and performance. This review examines key optimization methods in communication compression, including pruning techniques that remove irrelevant weights, quantization techniques that convert floating-point parameters to low-precision representations, and sparsification techniques that transmit only critical gradients. Low-rank approximation techniques, which compress parameters through matrix factorization, are particularly useful for large-scale models. These techniques have also been widely applied in various application scenarios, demonstrating their effectiveness in different environments. Application scenarios include distributed training, federated learning, and edge computing, where bottlenecks are carefully identified and evaluated in common scenarios, providing a basis for further optimization. Future development directions emphasize co-design of hardware and algorithms, dynamic strategies, and cross-layer optimization. This study provides valuable comparisons of key methods and theoretical analysis for efficient communication compression in distributed systems.</p>