SearcharxivSearch

arXiv subjects

Wangli He

Publications and source records attributed to Wangli He.

2 recordsLinked to original sources

Ternary Compression for Communication-Efficient Federated Learning

Learning over massive data stored in different locations is essential in many real-world applications. However, sharing data is full of challenges due to the increasing demands of privacy and security with the growing use of smart mobile devices and IoT devices. Federated learning provides a potential solution to privacy-preserving and secure machine learning, by means of jointly training a global model without uploading data distributed on multiple devices to a central server. However, most existing work on federated learning adopts machine learning models with full-precision weights, and almost all these models contain a large number of redundant parameters that do not need to be transmitted to the server, consuming an excessive amount of communication costs. To address this issue, we propose a federated trained ternary quantization (FTTQ) algorithm, which optimizes the quantized networks on the clients through a self-learning quantization factor. Theoretical proofs of the convergence of quantization factors, unbiasedness of FTTQ, as well as a reduced weight divergence are given. On the basis of FTTQ, we propose a ternary federated averaging protocol (T-FedAvg) to reduce the upstream and downstream communication of federated learning systems. Empirical experiments are conducted to train widely used deep learning models on publicly available datasets, and our results demonstrate that the proposed T-FedAvg is effective in reducing communication costs and can even achieve slightly better performance on non-IID data in contrast to the canonical federated learning algorithms.

cs.LG

Leader Selection in Multi-Agent Networks with Switching Topologies via Submodular Optimization

In leader-follower multi-agent networks with switching topologies, choosing a subset of agents as leaders is a critical step to achieve desired performances. In this paper, we concentrate on the problem of selecting a minimum-size set of leaders that ensure the tracking of a reference signal in a highorder linear multi-agent network with a set of given topology dependent dwell time (TDDT). First, we derive a sufficient condition that guarantees the states of all agents converging to an expected state trajectory. Second, by exploiting submodular optimization method, we formulate the problem of identifying a minimal leader set which satisfies the proposed sufficient condition. Third, we present an algorithm with the provable optimality bound to solve the formulated problem. Finally, several numerical examples are provided to verify the effectiveness of the designed selection scheme.

cs.MA