mlsanityData to 7 Oct 2026

Aggregation in the Mirror Space (AIMS): Fast, Accurate Distributed Machine Learning in Military Settings

arXiv 2210.16181 ↗First posted 28 Oct 2022cs.LG cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

Distributed machine learning (DML) can be an important capability for modern military to take advantage of data and devices distributed at multiple vantage points to adapt and learn. The existing distributed machine learning frameworks, however, cannot realize the full benefits of DML, because they are all based on the simple linear aggregation framework, but linear aggregation cannot handle the textitdivergence challenges arising in military settings: the learning data at different devices can be heterogeneous (textiti.e., Non-IID data), leading to model divergence, but the ability for devices to communicate is substantially limited (textiti.e., weak connectivity due to sparse and dynamic communications), reducing the ability for devices to reconcile model divergence. In this paper, we introduce a novel DML framework called aggregation in the mirror space (AIMS) that allows a DML system to introduce a general mirror function to map a model into a mirror space to conduct aggregation and gradient descent. Adapting the convexity of the mirror function according to the divergence force, AIMS allows automatic optimization of DML. We conduct both rigorous analysis and extensive experimental evaluations to demonstrate the benefits of AIMS. For example, we prove that AIMS achieves a loss of Oleft((fracmr+1T)frac1rright) after T network-wide updates, where m is the number of devices and r the convexity of the mirror function, with existing linear aggregation frameworks being a special case with r=2. Our experimental evaluations using EMANE (Extendable Mobile Ad-hoc Network Emulator) for military communications settings show similar results: AIMS can improve DML convergence rate by up to 57% and scale well to more devices with weak connectivity, all with little additional computation overhead compared to traditional linear aggregation.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 22 references that are in the map. First posted on arXiv 28 Oct 2022.

Builds on

10 of 22 references.

References · 10

  1. 2014Convex Optimization: Algorithms and Complexitycited by 569
  2. 2017Ray: A Distributed Framework for Emerging AI Applicationscited by 516
  3. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
  4. 2019A Survey on Distributed Machine Learningcited by 187
  5. 2021Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Datacited by 69
  6. 2020Decentralized gradient methods: does topology matter?cited by 35
  7. 2019Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Methodcited by 12
  8. 2020TornadoAggregate: Accurate and Scalable Federated Learning via the Ring-Based Architecturecited by 12
  9. 2020Distributed Mirror Descent for Online Composite Optimizationcited by 10
  10. 2016Optimal Distributed Stochastic Mirror Descent for Strongly Convex Optimizationcited by 6

Built on by

Not cited yet.