Kurtic, E., Hoefler, T., &; Alistarh, D.-A. (2024). How to prune your language model: Recovering accuracy on the “Sparsity May Cry” benchmark. In Proceedings of Machine Learning Research (Vol. 234, pp. 542–553). Hongkong, China: ML Research Press.

Zakerinia, H., Talaei, S., Nadiradze, G., &; Alistarh, D.-A. (2024). Communication-efficient federated learning with data and client heterogeneity. In Proceedings of the 27th International Conference on Artificial Intelligence and Statistics (Vol. 238, pp. 3448–3456). Valencia, Spain: ML Research Press.

Koval, N., Alistarh, D.-A., &; Elizarov, R. (2023). Fast and scalable channels in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada: Association for Computing Machinery.https://doi.org/10.1145/3572848.3577481 

Aksenov, V., Brown, T. A., Fedorov, A., &; Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery.https://doi.org/10.1145/3572848.3577512 

Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., &; Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .

Koval, N., Khalanskiy, D., &; Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery .https://doi.org/10.1145/3591230 

Alistarh, D.-A., Ellen, F., &; Rybicki, J. (2023). Wait-free approximate agreement on graphs. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2023.113733 

Peste, E.-A. (2023). Efficiency and generalization of sparse neural networks. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:13074 

Aksenov, V., Alistarh, D.-A., Drozdova, A., &; Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. Springer Nature.https://doi.org/10.1007/s00446-022-00441-x 

Markov, I., Vladu, A., Guo, Q., &; Alistarh, D.-A. (2023). Quantized distributed training of large models with convergence guarantees. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 24020–24044). Honolulu, Hawaii, HI, United States: ML Research Press.

Shevchenko, A., Kögler, K., Hassani, H., &; Mondelli, M. (2023). Fundamental limits of two-layer autoencoders, and achieving them with gradient methods. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 31151–31209). Honolulu, Hawaii, HI, United States: ML Research Press.

Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., &; Alistarh, D.-A. (2023). SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United States: ML Research Press.

Frantar, E., &; Alistarh, D.-A. (2023). SparseGPT: Massive language models can be accurately pruned in one-shot. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10323–10337). Honolulu, Hawaii, HI, United States: ML Research Press.

Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &; Zhu, L. (2023). Why extension-based proofs fail. SIAM Journal on Computing. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/20M1375851 

Iofinova, E. B., Peste, E.-A., &; Alistarh, D.-A. (2023). Bias in pruned vision models: In-depth analysis and countermeasures. In 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 24364–24373). Vancouver, BC, Canada: IEEE.https://doi.org/10.1109/cvpr52729.2023.02334 

Beznosikov, A., Horvath, S., Richtarik, P., &; Safaryan, M. (2023). On biased compression for distributed learning. Journal of Machine Learning Research. Journal of Machine Learning Research.

Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In 35th International Conference on Computer Aided Verification  (Vol. 13964, pp. 156–169). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-37706-8_8 

Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. Zenodo.https://doi.org/10.5281/ZENODO.7877757 

Fedorov, A., Hashemi, D., Nadiradze, G., &; Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery.https://doi.org/10.1145/3558481.3591082 

Safaryan, M., Krumes, A., &; Alistarh, D.-A. (2023). Knowledge distillation performs partial variance reduction. In 36th Conference on Neural Information Processing Systems (Vol. 36). New Orleans, LA, United States.