Wait-free approximate agreement on graphs
D.-A. Alistarh, F. Ellen, J. Rybicki, Theoretical Computer Science 948 (2023).
LibreCat: https://research-explorer.ista.ac.at/record/12566
DOI: 10.1016/j.tcs.2023.113733
WoS: 000934262700001

Efficiency and generalization of sparse neural networks
E.-A. Peste, Efficiency and Generalization of Sparse Neural Networks, Institute of Science and Technology Austria, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13074
DOI: 10.15479/at:ista:13074

The splay-list: A distribution-adaptive concurrent skip-list
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418.
LibreCat: https://research-explorer.ista.ac.at/record/12330
DOI: 10.1007/s00446-022-00441-x
WoS: 000913424000001
arXiv: 2008.01009

Quantized distributed training of large models with convergence guarantees
I. Markov, A. Vladu, Q. Guo, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 24020–24044.
LibreCat: https://research-explorer.ista.ac.at/record/14461
arXiv: 2302.02390

Fundamental limits of two-layer autoencoders, and achieving them with gradient methods
A. Shevchenko, K. Kögler, H. Hassani, M. Mondelli, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 31151–31209.
LibreCat: https://research-explorer.ista.ac.at/record/14459
arXiv: 2212.13468

SparseProp: Efficient sparse backpropagation for faster training of neural networks at the edge
M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 26215–26227.
LibreCat: https://research-explorer.ista.ac.at/record/14460
arXiv: 2302.04852

SparseGPT: Massive language models can be accurately pruned in one-shot
E. Frantar, D.-A. Alistarh, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10323–10337.
LibreCat: https://research-explorer.ista.ac.at/record/14458
arXiv: 2301.00774

Why extension-based proofs fail
D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, SIAM Journal on Computing 52 (2023) 913–944.
LibreCat: https://research-explorer.ista.ac.at/record/14364
DOI: 10.1137/20M1375851
WoS: 001082972300004
arXiv: 1811.01421

Bias in pruned vision models: In-depth analysis and countermeasures
E.B. Iofinova, E.-A. Peste, D.-A. Alistarh, in:, 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 24364–24373.
LibreCat: https://research-explorer.ista.ac.at/record/14771
DOI: 10.1109/cvpr52729.2023.02334
WoS: 001062531308068
arXiv: 2304.12622

On biased compression for distributed learning
A. Beznosikov, S. Horvath, P. Richtarik, M. Safaryan, Journal of Machine Learning Research 24 (2023) 1–50.
LibreCat: https://research-explorer.ista.ac.at/record/14815
WoS: 001111578500001
arXiv: 2002.12410

Lincheck: A practical framework for testing concurrent data structures on JVM
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th International Conference on Computer Aided Verification , Springer Nature, 2023, pp. 156–169.
LibreCat: https://research-explorer.ista.ac.at/record/14260
DOI: 10.1007/978-3-031-37706-8_8

Lincheck: A practical framework for testing concurrent data structures on JVM
N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).
LibreCat: https://research-explorer.ista.ac.at/record/14995
DOI: 10.5281/ZENODO.7877757

Provably-efficient and internally-deterministic parallel Union-Find
A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–271.
LibreCat: https://research-explorer.ista.ac.at/record/13262
DOI: 10.1145/3558481.3591082
arXiv: 2304.09331

Knowledge distillation performs partial variance reduction
M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information Processing Systems, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15363
arXiv: 2305.17581

Fast graphical population protocols
D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808

Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters
A. Nikabadi, J. Korhonen, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11183
DOI: 10.4230/LIPIcs.OPODIS.2021.15

Mean-field analysis of piecewise linear solutions for wide ReLU networks
A. Shevchenko, V. Kungurtsev, M. Mondelli, Journal of Machine Learning Research 23 (2022) 1–55.
LibreCat: https://research-explorer.ista.ac.at/record/11420
arXiv: 2111.02278

Brief announcement: Temporal locality in online algorithms
M. Pacut, M. Parham, J. Rybicki, S. Schmid, J. Suomela, A. Tereshchenko, in:, 36th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12182
DOI: 10.4230/LIPIcs.DISC.2022.52

CGX: Adaptive system support for communication-efficient deep learning
I. Markov, H. Ramezanikebrya, D.-A. Alistarh, in:, Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–254.
LibreCat: https://research-explorer.ista.ac.at/record/12780
DOI: 10.1145/3528535.3565248
arXiv: 2111.08617

Near-optimal leader election in population protocols on graphs
D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.
LibreCat: https://research-explorer.ista.ac.at/record/11844
DOI: 10.1145/3519270.3538435
arXiv: 2205.12597