Improving the Bit Complexity of Communication for Distributed Convex Optimization
STOC ’24, June 24–28, 2024, Vancouver, BC, Canada
Main Authors: | Ghadiri, Mehrdad, Lee, Yin Tat, Padmanabhan, Swati, Swartworth, William, Woodruff, David P., Ye, Guanghao |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 56th Annual ACM Symposium on Theory of Computing
2024
|
Online Access: | https://hdl.handle.net/1721.1/155725 |
Similar Items
-
Convexity of Solvability Set of Power Distribution Networks
by: Dymarsky, Anatoly, et al.
Published: (2024) -
The computational complexity of finding stationary points in non-convex optimization
by: Hollender, A, et al.
Published: (2024) -
Ultra-high bit rate optical soliton communication
by: Shum, Ping, et al.
Published: (2008) -
Improved video quality for low bit rate video conferencing
by: Kittisak Intharaphithak.
Published: (2009) -
Bit-level multiplierless FIR filter optimization incorporating sparse filter technique
by: Ye, Wen Bin, et al.
Published: (2014)