paper-with-me

홈 › Papers

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

2022-10-28 · Ryan Yang, Haizhou Du, Andre Wibisono, Patrick Baker

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 $\textit{divergence challenges}$ arising in military settings: the learning data at different devices can be heterogeneous ($\textit{i.e.}$, Non-IID data), leading to model divergence, but the ability for devices to communicate is substantially limited ($\textit{i.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 $O\left((\frac{m^{r+1}}{T})^{\frac1r}\right)$ 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.

📄 PDF Abstract BibTeX arXiv:2210.16181

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Symmetry-Aware Transformer-based Mirror Detection

2022-07-13 · Tianyu Huang, Bowen Dong, Jiaying Lin, Xiaohui Liu 외

Mirror detection aims to identify the mirror regions in the given input image. Existing works mainly focus on integrating the semantic features and structural features to mine specific relations between mirror and non-mi…

DecoderMirror Detection

Transport of Algebraic Structure to Latent Embeddings

2024-05-27 · Samuel Pfrommer, Brendon G. Anderson, Somayeh Sojoudi

Machine learning often aims to produce latent embeddings of inputs which lie in a larger, abstract mathematical space. For example, in the field of 3D modeling, subsets of Euclidean space can be embedded as vectors using…

Short-Term and Long-Term Context Aggregation Network for Video Inpainting

2020-09-12 · ECCV 2020 8 · Ang Li, Shanshan Zhao, Xingjun Ma, Mingming Gong 외

Video inpainting aims to restore missing regions of a video and has many applications such as video editing and object removal. However, existing methods either suffer from inaccurate short-term context aggregation or ra…

Video EditingVideo Inpainting

Active Model Aggregation via Stochastic Mirror Descent

2015-03-28 · Ravi Ganti

We consider the problem of learning convex aggregation of models, that is as good as the best convex aggregation, for the binary classification problem. Working in the stream based active learning setting, where the acti…

Active LearningBinary ClassificationGeneral Classificationmodel

Fast Convergence of Softmax Policy Mirror Ascent

2024-11-18 · Reza Asad, Reza Babanezhad, Issam Laradji, Nicolas Le Roux 외

Natural policy gradient (NPG) is a common policy optimization algorithm and can be viewed as mirror ascent in the space of probabilities. Recently, Vaswani et al. [2021] introduced a policy gradient method that correspon…

MuJoCo