Yuan Liang

h-index13
2papers
636citations

2 Papers

8.5LGAug 17, 2020Code
FLBench: A Benchmark Suite for Federated Learning

Yuan Liang, Yange Guo, Yanxia Gong et al.

Federated learning is a new machine learning paradigm. The goal is to build a machine learning model from the data sets distributed on multiple devices so-called an isolated data island, while keeping their data secure and private. Most existing federated learning benchmarks work manually splits commonly used public datasets into partitions to simulate real world isolated data island scenarios. Still, this simulation fails to capture real world isolated data island intrinsic characteristics. This paper presents a federated learning (FL) benchmark suite named FLBench. FLBench contains three domains: medical, financial, and AIoT. By configuring various domains, FLBench is qualified to evaluate federated learning systems and algorithms essential aspects, like communication, scenario transformation, privacy-preserving, data distribution heterogeneity, and cooperation strategy. Hence, it becomes a promising platform for developing novel federated learning algorithms. Currently, FLBench is open sourced and in fast evolution. We package it as an automated deployment tool. The benchmark suite is available from https://www.benchcouncil.org/flbench.html.

3.0HCJun 14, 2018
Online Variant of Parcel Allocation in Last-mile Delivery

Yuan Liang

We investigate the problem of last-mile delivery, where a large pool of citizen crowd-workers are hired to perform a variety of location-specific urban logistics parcel delivering tasks. Current approaches focus on offline scenarios, where all the spatio temporal information of parcels and workers are given. However, the offline scenarios can be impractical since parcels and workers appear dynamically in real applications, and their information is unknown in advance. In this paper, in order to solve the shortcomings of the offline setting, we first formalize the online parcel allocation in last-mile delivery problem, where all parcels were put in pop-stations in advance, while workers arrive dynamically. Then we propose an algorithm which provides theoretical guarantee for the parcel allocation in last-mile delivery. Finally, we verify the effectiveness and efficiency of the proposed method through extensive experiments on real and synthetic datasets.