Lingfei Deng

Lingfei Deng

Auto-generated profile, based on publicly available information

Lingfei Deng

Alibaba Cloud, Alibaba Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
24 August 2024
Verified
Conference Paper
Open access
LDLingfei Deng
Lingfei Deng
YWYunong Wang
Yunong Wang
HWHaoran Wang
Haoran Wang
XMXuhua Ma
Xuhua Ma
XDXiaoming Du
Xiaoming Du
DWDongrui Wu
Dongrui Wu
Log-based failure prediction helps identify and mitigate system failures ahead of time, increasing the reliability of cloud elastic computing systems. However, most existing log-based failure prediction approaches only focus on semantic information, and do not make full use of the information contained in the timestamps of log messages. This paper proposes time-aware attention-based transformer (TAAT), a failure prediction approach that extracts semantic and temporal information simultaneously from log messages and their timestamps. TAAT first tokenizes raw log messages into specific exceptions, and then performs: 1) exception sequence embedding that reorganizes the exceptions of each node as an ordered sequence and converts them to vectors; 2) time relation estimation that computes time relation matrices from the timestamps; and, 3) time-aware attention that computes semantic correlation matrices from the exception sequences and then combines them with time relation matrices. Experiments on Alibaba Cloud demonstrated that TAAT achieves an approximately 10% performance improvement compared with the state-of-the-art approaches. TAAT is now used in the daily operation of Alibaba Cloud. Moreover, this paper also releases the real-world cloud computing failure prediction dataset used in our study, which consists of about 2.7 billion syslogs from about 300,000 node controllers during a 4-month period. To our knowledge, this is the largest dataset of its kind, and is expected to be very useful to the community.

8 January 2024 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
LDLingfei Deng
Lingfei Deng
CZChangming Zhao
Changming Zhao
ZDZhenbang Du
Zhenbang Du
KXKun Xia
Kun Xia
DWDongrui Wu
Dongrui Wu
Semi-supervised domain adaptation (SSDA) aims at training a high-performance model for a target domain using few labeled target data, many unlabeled target data, and plenty of auxiliary data from a source domain. Previous works in SSDA mainly focused on learning transferable representations across domains. However, it is difficult to find a feature space where the source and target domains share the same conditional probability distribution. Additionally, there is no flexible and effective strategy extending existing unsupervised domain adaptation (UDA) approaches to SSDA settings. In order to solve the above two challenges, we propose a novel fine-tuning framework, semi-supervised transfer boosting (SS-TrBoosting). Given a well trained deep learning-based UDA or SSDA model, we use it as the initial model, generate additional base learners by boosting, and then use all of them as an ensemble. More specifically, half of the base learners are generated by supervised domain adaptation, and half by semi-supervised learning. Furthermore, for more efficient data transmission and better data privacy protection, we propose a source data generation approach to extend SS-TrBoosting to semi-supervised source-free domain adaptation (SS-SFDA). Extensive experiments showed that SS-TrBoosting can be applied to a variety of existing UDA, SSDA and SFDA approaches to further improve their performance.

20 April 2026
Verified
Conference Paper
Open access
LDLingfei Deng
Lingfei Deng
RXRuqiao Xu
Ruqiao Xu
YWYunong Wang
Yunong Wang
XDXiaoming Du
Xiaoming Du
XMXuhua Ma
Xuhua Ma
DWDongrui Wu
Dongrui Wu