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

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

158 Publications


2021 | Published | Conference Paper | IST-REx-ID: 10435 | OA
Asynchronous decentralized SGD with quantized and local updates
G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 11452 | OA
Distributed principal component analysis with limited communication
F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10432 | OA
Elastic consistency: A practical consistency model for distributed stochastic gradient descent
G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 11458 | OA
AC/DC: Alternating Compressed/DeCompressed training of deep neural networks
A. Krumes, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 8557–8570.
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 11463 | OA
M-FAC: Efficient matrix-free approximations of second-order information
E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 14873–14886.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 11464 | OA
Towards tight communication lower bounds for distributed optimisation
D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 7254–7266.
[Published Version] View | Download Published Version (ext.) | 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 | 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: 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 | Thesis | IST-REx-ID: 10429 | OA
On achieving scalability through relaxation
G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

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, A. Krumes, 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: 13147 | OA
Communication-efficient distributed optimization with quantized preconditioners
F. Alimisis, P. Davies, D.-A. Alistarh, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 196–206.
[Published Version] View | Files available | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 8723 | OA
Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging
S. Li, T.B.-N. Tal Ben-Nun, G. Nadiradze, S.D. Girolamo, N. Dryden, D.-A. Alistarh, T. Hoefler, IEEE Transactions on Parallel and Distributed Systems 32 (2021).
[Preprint] View | DOI | Download Preprint (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 | WoS
 

2021 | Published | Conference Paper | IST-REx-ID: 10049 | OA
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 

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.) | WoS | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 15271
Simple, deterministic, constant-round coloring in congested clique and MPC
A. Czumaj, P. Davies, M. Parter, SIAM Journal on Computing 50 (2021) 1603–1626.
View | DOI | WoS
 

2020 | Published | Conference Paper | IST-REx-ID: 8191
Memory tagging: Minimalist synchronization for scalable concurrent data structures
D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2020, pp. 37–49.
View | DOI | WoS
 

Filters and Search Terms

department=DaAl

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed