Tung T. Vu

Tung T. Vu, Hien Quoc Ngo, Thomas L. Marzetta et al.

Federated learning (FL) has been considered as a promising learning framework for future machine learning systems due to its privacy preservation and communication efficiency. In beyond-5G/6G systems, it is likely to have multiple FL groups with different learning purposes. This scenario leads to a question: How does a wireless network support multiple FL groups? As an answer, we first propose to use a cell-free massive multiple-input multiple-output (MIMO) network to guarantee the stable operation of multiple FL processes by letting the iterations of these FL processes be executed together within a large-scale coherence time. We then develop a novel scheme that asynchronously executes the iterations of FL processes under multicasting downlink and conventional uplink transmission protocols. Finally, we propose a simple/low-complexity resource allocation algorithm which optimally chooses the power and computation resources to minimize the execution time of each iteration of each FL process.

Canh T. Dinh, Tung T. Vu, Nguyen H. Tran et al.

Non-Independent and Identically Distributed (non- IID) data distribution among clients is considered as the key factor that degrades the performance of federated learning (FL). Several approaches to handle non-IID data such as personalized FL and federated multi-task learning (FMTL) are of great interest to research communities. In this work, first, we formulate the FMTL problem using Laplacian regularization to explicitly leverage the relationships among the models of clients for multi-task learning. Then, we introduce a new view of the FMTL problem, which in the first time shows that the formulated FMTL problem can be used for conventional FL and personalized FL. We also propose two algorithms FedU and dFedU to solve the formulated FMTL problem in communication-centralized and decentralized schemes, respectively. Theoretically, we prove that the convergence rates of both algorithms achieve linear speedup for strongly convex and sublinear speedup of order 1/2 for nonconvex objectives. Experimentally, we show that our algorithms outperform the algorithm FedAvg, FedProx, SCAFFOLD, and AFL in FL settings, MOCHA in FMTL settings, as well as pFedMe and Per-FedAvg in personalized FL settings.

Tung T. Vu, Ha Hoang Kha, Trung Q. Duong et al.

In this paper, we investigate the downlink multiple-input-multipleoutput (MIMO) broadcast channels in which a base transceiver station (BTS) broadcasts multiple data streams to K MIMO mobile stations (MSs) simultaneously. In order to maximize the weighted sum-rate (WSR) of the system subject to the transmitted power constraint, the design problem is to find the pre-coding matrices at BTS and the decoding matrices at MSs. However, such a design problem is typically a nonlinear and nonconvex optimization and, thus, it is quite hard to obtain the analytical solutions. To tackle with the mathematical difficulties, we propose an efficient stochastic optimization algorithm to optimize the transceiver matrices. Specifically, we utilize the linear minimum mean square error (MMSE) Wiener filters at MSs. Then, we introduce the constrained particle swarm optimization (PSO) algorithm to jointly optimize the precoding and decoding matrices. Numerical experiments are exhibited to validate the effectiveness of the proposed algorithm in terms of convergence, computational complexity and total WSR.