no code implementations • 3 Jan 2024 • Ethan Zhu, Haijian Sun, Mingyue Ji
Connected and automated vehicles (CAVs) have become a transformative technology that can change our daily life.
no code implementations • 2 Jan 2024 • Ethan Zhu, Haijian Sun, Mingyue Ji
Channel modeling is fundamental in advancing wireless systems and has thus attracted considerable research focus.
no code implementations • 6 Jun 2023 • Shiqiang Wang, Mingyue Ji
In this paper, we address this problem by adapting the aggregation weights in federated averaging (FedAvg) based on the participation history of each client.
no code implementations • 16 Dec 2022 • Shiqiang Wang, Jake Perazzone, Mingyue Ji, Kevin S. Chan
In this paper, we address this problem and propose FlexFL - an FL algorithm with multiple options that can be adjusted flexibly.
no code implementations • 26 May 2022 • Shiqiang Wang, Mingyue Ji
Federated learning (FL) faces challenges of intermittent client availability and computation/communication efficiency.
no code implementations • 26 Mar 2022 • Won Joon Yun, Yunseok Kwak, Hankyul Baek, Soyi Jung, Mingyue Ji, Mehdi Bennis, Jihong Park, Joongheon Kim
However, applying FL in practice is challenging due to the local devices' heterogeneous energy, wireless channel conditions, and non-independently and identically distributed (non-IID) data distributions.
no code implementations • 19 Jan 2022 • Jake Perazzone, Shiqiang Wang, Mingyue Ji, Kevin Chan
Then, using the derived convergence bound, we use stochastic optimization to develop a new client selection and power allocation algorithm that minimizes a function of the convergence bound and the average communication time under a transmit power constraint.
no code implementations • 5 Dec 2021 • Hankyul Baek, Won Joon Yun, Yunseok Kwak, Soyi Jung, Mingyue Ji, Mehdi Bennis, Jihong Park, Joongheon Kim
By applying SC, SlimFL exchanges the superposition of multiple width configurations that are decoded as many as possible for a given communication throughput.
no code implementations • 5 Dec 2021 • Hankyul Baek, Won Joon Yun, Soyi Jung, Jihong Park, Mingyue Ji, Joongheon Kim, Mehdi Bennis
To address the heterogeneous communication throughput problem, each full-width (1. 0x) SNN model and its half-width ($0. 5$x) model are superposition-coded before transmission, and successively decoded after reception as the 0. 5x or $1. 0$x model depending on the channel quality.
no code implementations • 17 Oct 2021 • Xiang Zhang, Shamik Sarkar, Arupjyoti Bhuyan, Sneha Kumar Kasera, Mingyue Ji
The proposed approach can also be integrated into our previously developed Lyapunov stochastic optimization framework for the purpose of network utility maximization with optimality guarantee.
no code implementations • 24 Feb 2021 • Shamik Sarkar, Xiang Zhang, Arupjyoti Bhuyan, Mingyue Ji, Sneha Kumar Kasera
Using stochastic geometry, we develop a general framework for downlink coverage probability analysis of our shared mmWave network in the presence of CS and derive the downlink coverage probability expressions for several CS protocols.
Information Theory Networking and Internet Architecture Information Theory
no code implementations • 2 Feb 2021 • Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire
This paper considers the MuPIR problem with two messages, arbitrary number of users and databases where uncoded prefetching is assumed, i. e., the users directly copy some bits from the library as their cached contents.
no code implementations • 1 Feb 2021 • Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire
Then we focus on the case where the computation cost of each server is minimum and aim to minimize the size of the randomness variable introduced in the system while achieving the optimal communication cost.
Information Theory Information Theory
no code implementations • 28 Dec 2020 • Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire
Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users' local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times.
Information Theory Information Theory
1 code implementation • 24 Oct 2020 • Jiayi Wang, Shiqiang Wang, Rong-Rong Chen, Mingyue Ji
Furthermore, we extend our analytical approach based on "upward" and "downward" divergences to study the convergence for the general case of H-SGD with more than two levels, where the "sandwich behavior" still holds.
no code implementations • 13 Oct 2020 • Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire
Based on the proposed novel approach of \emph{cache-aided interference alignment (CIA)}, first, for the MuPIR problem with $K=2$ messages, $K_{\rm u}=2$ users and $N\ge 2$ databases, we propose achievable retrieval schemes for both uncoded and general cache placement.