The Communication Complexity of Optimization

DOI10.1137/1.9781611975994.106MaRDI QIDQ5146886zbMATH OpenOpenAlexFDO

Authors Ruosong Wang, David P. Woodruff, Santosh S. Vempala

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.05832

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• On the communication complexity of Lipschitzian optimization for the coordinated model of computation
• The communication complexity of local search
• Communication-efficient distributed graph clustering and sparsification under duplication models
• The bit complexity of dynamic algebraic formulas and their determinants
• Quantum communication complexity of linear regression

This page was built for publication: The Communication Complexity of Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146886)