Towards Tight Communication Lower Bounds for Distributed Optimisation.
Janne H. KorhonenDan AlistarhPublished in: NeurIPS (2021)
Keyphrases
- lower bound
- upper bound
- communication overhead
- communication cost
- worst case
- branch and bound
- branch and bound algorithm
- computer networks
- distributed control
- np hard
- distributed systems
- objective function
- spatially distributed
- upper and lower bounds
- fully distributed
- distributed computation
- lower and upper bounds
- optimal solution
- distributed network
- open systems
- cooperative
- information sharing
- genetic algorithm
- communication networks
- multimedia communication
- distributed environment
- communication protocol
- linear programming relaxation
- information dissemination
- data structure
- quadratic assignment problem
- sample complexity
- vc dimension
- search algorithm
- group communication
- communication channels
- lightweight
- fault tolerant
- remote sites
- global knowledge
- multi party