Improving the Bit Complexity of Communication for Distributed Convex Optimization | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

Improving the Bit Complexity of Communication for Distributed Convex Optimization

Award ID(s):: 2022448 1955217

PAR ID:: 10524740

Author(s) / Creator(s):: Ghadiri, Mehrdad; Lee, Yin Tat; Padmanabhan, Swati; Swartworth, William; Woodruff, David P; Ye, Guanghao

Publisher / Repository:: ACM

Date Published:: 2024-06-10

ISBN:: 9798400703836

Page Range / eLocation ID:: 1130 to 1140

Format(s):: Medium: X

Location:: Vancouver BC Canada

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.1145/3618260.3649787