Li-Ping Liu

Li-Ping Liu

Auto-generated profile, based on publicly available information

Li-Ping Liu

Tufts University, Medford, MA, USA

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
3 May 2024 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
HGHan Gao
Han Gao
XHXu Han
Xu Han
XFXiantao Fan
Xiantao Fan
LSLuning Sun
Luning Sun
LLLi-Ping Liu
Li-Ping Liu
JWJian-Xun Wang
Jian-Xun Wang

4 August 2023
Verified
Conference Paper
Open access
XCXiaohui Chen
Xiaohui Chen
JSJiankai Sun
Jiankai Sun
TWTaiqing Wang
Taiqing Wang
RGRuocheng Guo
Ruocheng Guo
LLLi-Ping Liu
Li-Ping Liu
AZAonan Zhang
Aonan Zhang
Data subsampling is widely used to speed up the training of large-scale recommendation systems. Most subsampling methods are model-based and often require a pre-trained pilot model to measure data importance via e.g. sample hardness. However, when the pilot model is misspecified, model-based subsampling methods deteriorate. Since model misspecification is persistent in real recommendation systems, we instead propose model-agnostic data subsampling methods by only exploring input data structure represented by graphs. Specifically, we study the topology of the user-item graph to estimate the importance of each user-item interaction (an edge in the user-item graph) via graph conductance, followed by a propagation step on the network to smooth out the estimated importance value. Since our proposed method is model-agnostic, we can marry the merits of both model-agnostic and model-based subsampling methods. Empirically, we show that combing the two consistently improves over any single method on the used datasets. Experimental results on KuaiRec and MIND datasets demonstrate that our proposed methods achieve superior results compared to baseline approaches.