Lixuan Yang

Lixuan Yang

Auto-generated profile, based on publicly available information

Lixuan Yang

Data Communication Network Algorithm and Measurement Technology Laboratory, Paris Research Center, Huawei Technologies France, Boulogne-Billancourt, France

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 April 2023 in Entropy
Verified
Journal Article
Open access
PDF file
GFGiulio Franzese
Giulio Franzese
SRSimone Rossi
Simone Rossi
LYLixuan Yang
Lixuan Yang
AFAlessandro Finamore
Alessandro Finamore
DRDario Rossi
Dario Rossi
Pietro MichiardiPietro Michiardi
Pietro Michiardi
Score-based diffusion models are a class of generative models whose dynamics is described by stochastic differential equations that map noise into data. While recent works have started to lay down a theoretical foundation for these models, a detailed understanding of the role of the diffusion time T is still lacking. Current best practice advocates for a large T to ensure that the forward dynamics brings the diffusion sufficiently close to a known and simple noise distribution; however, a smaller value of T should be preferred for a better approximation of the score-matching objective and higher computational efficiency. Starting from a variational interpretation of diffusion models, in this work we quantify this trade-off and suggest a new method to improve quality and efficiency of both training and sampling, by adopting smaller diffusion times. Indeed, we show how an auxiliary model can be used to bridge the gap between the ideal and the simulated forward dynamics, followed by a standard reverse diffusion process. Empirical results support our analysis; for image data, our method is competitive with regard to the state of the art, according to standard sample quality metrics and log-likelihood.

26 October 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
LYLixuan Yang
Lixuan Yang
AFAlessandro Finamore
Alessandro Finamore
FJFeng Jun
Feng Jun
DRDario Rossi
Dario Rossi
The increasing success of Machine Learning (ML) and Deep Learning (DL) has recently re-sparked interest towards traffic classification. While supervised techniques provide satisfactory performance when classifying known traffic, the detection of zero-day (i.e., unknown) traffic is a more challenging task. At the same time, zero-day detection, generally tackled with unsupervised techniques such as clustering, received less coverage by the traffic classification literature which focuses more on deriving DL models via supervised techniques. Moreover, the combination of supervised and unsupervised techniques poses challenges not fully covered by the traffic classification literature. In this paper, we share our experience on a commercial-grade DL traffic classification engine that combines supervised and unsupervised techniques to identify known and zero-day traffic. In particular, we rely on a dataset with hundreds of very fine grained application labels, and perform a thorough assessment of two state of the art traffic classifiers in commercial-grade settings. This pushes the boundaries of traffic classifiers evaluation beyond the few tens of classes typically used in the literature. Our main contribution is the design and evaluation of , a novel technique for zero-day applications detection. Based on gradient backpropagation and tailored for DL models, yields superior performance with respect to state of the art alternatives, in both accuracy and computational cost. Overall, while ML and DL models are both equally able to provide excellent performance for the classification of known traffic, the non-linear feature extraction process of DL models backbone provides sizable advantages for the detection of unknown classes over classical ML models.

19 June 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
GBGIAMPAOLO BOVENZI
GIAMPAOLO BOVENZI
ANAlfredo Nascita
Alfredo Nascita
LYLixuan Yang
Lixuan Yang
AFAlessandro Finamore
Alessandro Finamore
Giuseppe AcetoGiuseppe Aceto
Giuseppe Aceto
DRDario Rossi
Dario Rossi
Traffic Classification (TC) is experiencing a renewed interest, fostered by the growing popularity of Deep Learning (DL) approaches. In exchange for their proved effectiveness, DL models are characterized by a computationally-intensive training procedure that badly matches the fast-paced release of new (mobile) applications, resulting in significantly limited efficiency of model updates. To address this shortcoming, in this work we systematically explore Class Incremental Learning (CIL) techniques, aimed at adding new apps/services to pre-existing DL-based traffic classifiers without a full retraining, hence speeding up the model’s updates cycle. We investigate a large corpus of state-of-the-art CIL approaches for the DL-based TC task, and delve into their working principles to highlight relevant insight, aiming to understand if there is a case for CIL in TC. We evaluate and discuss their performance varying the number of incremental learning episodes, and the number of new apps added for each episode. Our evaluation is based on the publicly available MIRAGE19 dataset comprising traffic of 40 popular Android applications, fostering reproducibility. Despite our analysis reveals their infancy, CIL techniques are a promising research area on the roadmap towards automated DL-based traffic analysis systems.

9 July 2021 in arXiv
Verified
Preprint
Open access
PDF file
GBGIAMPAOLO BOVENZI
GIAMPAOLO BOVENZI
LYLixuan Yang
Lixuan Yang
AFAlessandro Finamore
Alessandro Finamore
Giuseppe AcetoGiuseppe Aceto
Giuseppe Aceto
Domenico CiuonzoDomenico Ciuonzo
Domenico Ciuonzo
DRDario Rossi
Dario Rossi
The recent popularity growth of Deep Learning (DL) re-ignited the interest towards traffic classification, with several studies demonstrating the accuracy of DL-based classifiers to identify Internet applications' traffic. Even with the aid of hardware accelerators (GPUs, TPUs), DL model training remains expensive, and limits the ability to operate frequent model updates necessary to fit to the ever evolving nature of Internet traffic, and mobile traffic in particular. To address this pain point, in this work we explore Incremental Learning (IL) techniques to add new classes to models without a full retraining, hence speeding up model's updates cycle. We consider iCarl, a state of the art IL method, and MIRAGE-2019, a public dataset with traffic from 40 Android apps, aiming to understand "if there is a case for incremental learning in traffic classification". By dissecting iCarl internals, we discuss ways to improve its design, contributing a revised version, namely iCarl+. Despite our analysis reveals their infancy, IL techniques are a promising research area on the roadmap towards automated DL-based traffic analysis systems.

12 November 2020 in arXiv
Verified
Preprint
Open access
PDF file
LYLixuan Yang
Lixuan Yang
CBCedric Beliard
Cedric Beliard
DRDario Rossi
Dario Rossi
Federated learning (FL) is an appealing concept to perform distributed training of Neural Networks (NN) while keeping data private. With the industrialization of the FL framework, we identify several problems hampering its successful deployment, such as presence of non i.i.d data, disjoint classes, signal multi-modality across datasets. In this work, we address these problems by proposing a novel method that not only (1) aggregates generic model parameters (e.g. a common set of task generic NN layers) on server (e.g. in traditional FL), but also (2) keeps a set of parameters (e.g, a set of task specific NN layer) specific to each client. We validate our method on the traditionally used public benchmarks (e.g., Femnist) as well as on our proprietary collected dataset (i.e., traffic classification). Results show the benefit of our method, with significant advantage on extreme cases.