Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




141 Publications

2022 | Published | Conference Paper | IST-REx-ID: 17059 | OA
SPDY: Accurate pruning with speedup guarantees
E. Frantar, D.-A. Alistarh, in:, 39th International Conference on Machine Learning, ML Research Press, 2022, pp. 6726–6743.
[Published Version] View | Files available | WoS
 
2022 | Published | Conference Paper | IST-REx-ID: 17087 | OA
Optimal brain compression: A framework for accurate post-training quantization and pruning
E. Frantar, S.P. Singh, D.-A. Alistarh, in:, 36th Conference on Neural Information Processing Systems, ML Research Press, 2022.
[Submitted Version] View | Files available | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 17088 | OA
The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models
E. Kurtic, D. Campos, T. Nguyen, E. Frantar, M. Kurtz, B. Fineran, M. Goin, D.-A. Alistarh, in:, Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, 2022, pp. 4163–4181.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 12182 | OA
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.
[Published Version] View | Files available | DOI
 
2022 | Published | Conference Paper | IST-REx-ID: 12299 | OA
How well do sparse ImageNet models transfer?
E.B. Iofinova, A. Krumes, M. Kurtz, D.-A. Alistarh, in:, 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Institute of Electrical and Electronics Engineers, 2022, pp. 12256–12266.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 12780 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Research Data Reference | IST-REx-ID: 13076 | OA
Multi-queues can be state-of-the-art priority schedulers
A. Postnikova, N. Koval, G. Nadiradze, D.-A. Alistarh, (2022).
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2022 | Published | Journal Article | IST-REx-ID: 8286 | OA
Dynamic averaging load balancing on cycles
D.-A. Alistarh, G. Nadiradze, A. Sabour, Algorithmica 84 (2022) 1007–1029.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 11420 | OA
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.
[Published Version] View | Files available | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 10180 | OA
Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks
T. Hoefler, D.-A. Alistarh, T. Ben-Nun, N. Dryden, E.-A. Peste, Journal of Machine Learning Research 22 (2021) 1–124.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10216 | OA
Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10217 | OA
Lower bounds for shared-memory leader election under bounded write contention
D.-A. Alistarh, R. Gelashvili, G. Nadiradze, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 10218 | OA
Brief announcement: Fast graphical population protocols
D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10219 | OA
Brief announcement: Sinkless orientation is hard also in the supported LOCAL model
J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9541 | OA
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9543 | OA
New bounds for distributed mean estimation and variance reduction
P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.
[Published Version] View | Download Published Version (ext.) | arXiv
 
2021 | Published | Journal Article | IST-REx-ID: 9571 | OA
NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization
A. Ramezani-Kebrya, F. Faghri, I. Markov, V. Aksenov, D.-A. Alistarh, D.M. Roy, Journal of Machine Learning Research 22 (2021) 1−43.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9620 | OA
Collecting coupons is faster with friends
D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.
[Preprint] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 9678 | OA
Efficient load-balancing through distributed token dropping
S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2021, pp. 129–139.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 9823 | OA
Wait-free approximate agreement on graphs
D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Export / Embed