Lifan Zhao

Lifan Zhao

Auto-generated profile, based on publicly available information

Lifan Zhao

Shanghai Jiao Tong University

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
LZLifan Zhao
Lifan Zhao
SKShuming Kong
Shuming Kong
YSYanyan Shen
Yanyan Shen
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.


3 February 2026 in ACM Computing Surveys
Verified
Journal Article
Open access
LWLiping Wang
Liping Wang
JLJiawei Li
Jiawei Li
LZLifan Zhao
Lifan Zhao
ZKZhizhuo Kou
Zhizhuo Kou
XWXiaohan Wang
Xiaohan Wang
LCLei Chen
Lei Chen
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.

7 February 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
YSYanyan Shen
Yanyan Shen
LZLifan Zhao
Lifan Zhao
WCWeiyu Cheng
Weiyu Cheng
ZZZibin Zhang
Zibin Zhang
WZWenwen Zhou
Wenwen Zhou
LKLin Kangyi
Lin Kangyi
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.