SearcharxivSearch

arXiv subjects

Li-Hsing Yen

Publications and source records attributed to Li-Hsing Yen.

2 recordsLinked to original sources

Assessing the Impacts of Imperfect Datasets on Client Selections in Federated Learning

Federated learning (FL) is a popular distributed learning framework where multiple clients perform local training and a server aggregates the locally updated models. FL enables decentralized training while preserving the privacy of clients' datasets. However, non-independent and identically distributed (non-IID) or noisy datasets can lead to low model accuracy or high convergence latency. Precluding these clients through client selection may mitigate the problem, but heavily biased client selections may also degrade the learning performance. In this study, we first experimentally measure the impact of non-IID data (including skews in data quantity and label distribution), noisy data, and fairness in client selection on model accuracy and convergence. We then propose a privacy-preserving scoring method to assess each client's contribution in FL, with experiments conducted to demonstrate the effectiveness of the proposed assessment.

cs.LG

Decentralized Combinatorial Auctions for Multi-Unit Resource Allocation

Auction has been used to allocate resources or tasks to processes, machines or other autonomous entities in distributed systems. When different bidders have different demands and valuations on different types of resources or tasks, the auction becomes a combinatorial auction (CA), for which finding an optimal auction result that maximizes total winning bid is NP-hard. Many time-efficient approximations to this problem work with a bid ranking function (BRF). However, existing approximations are all centralized and mostly for single-unit resource. In this paper, we propose the first decentralized CA schemes for multi-unit resources. It includes a BRF-based winner determination scheme that enables every agent to locally compute a critical bid value for her to win the CA and accordingly take her best response to other agent's win declaration. It also includes a critical-value-based pricing scheme for each winner to locally compute her payment. We analyze stabilization, correctness, and consistency properties of the proposed approach. Simulation results confirms that the proposed approach identifies exactly the same set of winners as the centralized counterpart regardless of initial bid setting, but at the cost of lower total winning bid and payment.

cs.GT