Lifan Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lifan Zhao has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Yanyan Shen
Shanghai Jiao Tong University
5 shared publications - Bin Yao
Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Hao Wang
Department of Data Science and Analytics, The Hong Kong University of Science and Technology (GuangZhou)
1 shared publication - Jiawei Li
Data Science and Analytics, The Hong Kong University of Science and Technology (Guangzhou)
1 shared publication - Kangyi Lin
Wechat, Tencent, Guangzhou, China
1 shared publication - Lei Chen
HKUST, Hong Kong, Hong Kong
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-37
Methods for Acquiring and Incorporating Knowledge into Stock Price Prediction: A Survey
Predicting stock prices presents a challenging research problem due to the inherent volatility and non-linear nature of the stock market. In recent years, knowledge-enhanced stock price prediction methods have shown groundbreaking results by utilizing external knowledge to understand the stock market. Despite the importance of these methods, there is a scarcity of scholarly works that systematically synthesize previous studies from the perspective of external knowledge types. Specifically, the external knowledge can be modeled in different data structures, which we group into non-graph-based formats and graph-based formats: (1) non-graph-based knowledge captures contextual information and multimedia descriptions specifically associated with an individual stock; (2) graph-based knowledge captures interconnected and interdependent information in the stock market. This survey article aims to provide a systematic and comprehensive description of methods for acquiring external knowledge from various unstructured data sources and then incorporating it into stock price prediction models. We also explore fusion methods for combining external knowledge with historical price features. Moreover, this article includes a compilation of relevant datasets and delves into potential future research directions in this domain.
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-37
Top Cited PapersOpen AccessMethods for Acquiring and Incorporating Knowledge into Stock Price Prediction: A Survey
Predicting stock prices presents a challenging research problem due to the inherent volatility and non-linear nature of the stock market. In recent years, knowledge-enhanced stock price prediction methods have shown groundbreaking results by utilizing external knowledge to understand the stock market. Despite the importance of these methods, there is a scarcity of scholarly works that systematically synthesize previous studies from the perspective of external knowledge types. Specifically, the external knowledge can be modeled in different data structures, which we group into non-graph-based formats and graph-based formats: (1) non-graph-based knowledge captures contextual information and multimedia descriptions specifically associated with an individual stock; (2) graph-based knowledge captures interconnected and interdependent information in the stock market. This survey article aims to provide a systematic and comprehensive description of methods for acquiring external knowledge from various unstructured data sources and then incorporating it into stock price prediction models. We also explore fusion methods for combining external knowledge with historical price features. Moreover, this article includes a compilation of relevant datasets and delves into potential future research directions in this domain.
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2020-2031
Proactive Model Adaptation Against Concept Drift for Online Time Series Forecasting
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2020-2031
Open AccessProactive Model Adaptation Against Concept Drift for Online Time Series Forecasting
- 2 September 2024
- Published by Springer Nature
- p. 275-284
StockCL: Selective Contrastive Learning for Stock Trend Forecasting via Learnable Concepts
- 2 September 2024
- Published by Springer Nature
- p. 275-284
StockCL: Selective Contrastive Learning for Stock Trend Forecasting via Learnable Concepts
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 3492-3503
DoubleAdapt: A Meta-learning Approach to Incremental Learning for Stock Trend Forecasting
Stock trend forecasting is a fundamental task of quantitative investment where precise predictions of price trends are indispensable. As an online service, stock data continuously arrive over time. It is practical and efficient to incrementally update the forecast model with the latest data which may reveal some new patterns recurring in the future stock market. However, incremental learning for stock trend forecasting still remains under-explored due to the challenge of distribution shifts (a.k.a. concept drifts). With the stock market dynamically evolving, the distribution of future data can slightly or significantly differ from incremental data, hindering the effectiveness of incremental updates. To address this challenge, we propose DoubleAdapt, an end-to-end framework with two adapters, which can effectively adapt the data and the model to mitigate the effects of distribution shifts. Our key insight is to automatically learn how to adapt stock data into a locally stationary distribution in favor of profitable updates. Complemented by data adaptation, we can confidently adapt the model parameters under mitigated distribution shifts. We cast each incremental learning task as a meta-learning task and automatically optimize the adapters for desirable data adaptation and parameter initialization. Experiments on real-world stock datasets demonstrate that DoubleAdapt achieves state-of-the-art predictive performance and shows considerable efficiency.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 3492-3503
Open AccessDoubleAdapt: A Meta-learning Approach to Incremental Learning for Stock Trend Forecasting
Stock trend forecasting is a fundamental task of quantitative investment where precise predictions of price trends are indispensable. As an online service, stock data continuously arrive over time. It is practical and efficient to incrementally update the forecast model with the latest data which may reveal some new patterns recurring in the future stock market. However, incremental learning for stock trend forecasting still remains under-explored due to the challenge of distribution shifts (a.k.a. concept drifts). With the stock market dynamically evolving, the distribution of future data can slightly or significantly differ from incremental data, hindering the effectiveness of incremental updates. To address this challenge, we propose DoubleAdapt, an end-to-end framework with two adapters, which can effectively adapt the data and the model to mitigate the effects of distribution shifts. Our key insight is to automatically learn how to adapt stock data into a locally stationary distribution in favor of profitable updates. Complemented by data adaptation, we can confidently adapt the model parameters under mitigated distribution shifts. We cast each incremental learning task as a meta-learning task and automatically optimize the adapters for desirable data adaptation and parameter initialization. Experiments on real-world stock datasets demonstrate that DoubleAdapt achieves state-of-the-art predictive performance and shows considerable efficiency.
- Open Access
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-26
RESUS: Warm-up Cold Users via Meta-learning Residual User Preferences in CTR Prediction
Click-through Rate (CTR) prediction on cold users is a challenging task in recommender systems. Recent researches have resorted to meta-learning to tackle the cold-user challenge, which either perform few-shot user representation learning or adopt optimization-based meta-learning. However, existing methods suffer from information loss or inefficient optimization process, and they fail to explicitly model global user preference knowledge, which is crucial to complement the sparse and insufficient preference information of cold users. In this article, we propose a novel and efficient approach named RESUS, which decouples the learning of global preference knowledge contributed by collective users from the learning of residual preferences for individual users. Specifically, we employ a shared predictor to infer basis user preferences, which acquires global preference knowledge from the interactions of different users. Meanwhile, we develop two efficient algorithms based on the nearest neighbor and ridge regression predictors, which infer residual user preferences via learning quickly from a few user-specific interactions. Extensive experiments on three public datasets demonstrate that our RESUS approach is efficient and effective in improving CTR prediction accuracy on cold users, compared with various state-of-the-art methods.
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-26
Open AccessRESUS: Warm-up Cold Users via Meta-learning Residual User Preferences in CTR Prediction
Click-through Rate (CTR) prediction on cold users is a challenging task in recommender systems. Recent researches have resorted to meta-learning to tackle the cold-user challenge, which either perform few-shot user representation learning or adopt optimization-based meta-learning. However, existing methods suffer from information loss or inefficient optimization process, and they fail to explicitly model global user preference knowledge, which is crucial to complement the sparse and insufficient preference information of cold users. In this article, we propose a novel and efficient approach named RESUS, which decouples the learning of global preference knowledge contributed by collective users from the learning of residual preferences for individual users. Specifically, we employ a shared predictor to infer basis user preferences, which acquires global preference knowledge from the interactions of different users. Meanwhile, we develop two efficient algorithms based on the nearest neighbor and ridge regression predictors, which infer residual user preferences via learning quickly from a few user-specific interactions. Extensive experiments on three public datasets demonstrate that our RESUS approach is efficient and effective in improving CTR prediction accuracy on cold users, compared with various state-of-the-art methods.