Haoran Luo

Haoran Luo

Auto-generated profile, based on publicly available information

Haoran Luo

Nanyang technological university, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
2 November 2022 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Closed access
GZGengxian Zhou
Gengxian Zhou
Haihong EHaihong E
Haihong E
ZKZemin Kuang
Zemin Kuang
LTLing Tan
Ling Tan
XXXiaoxuan Xie
Xiaoxuan Xie
HLHaoran Luo
Haoran Luo

22 April 2025
Verified
Conference Paper
Open access
YFYu Feng
Yu Feng
YGYangli-ao Geng
Yangli-ao Geng
Yifan ZhuYifan Zhu
Yifan Zhu
ZHZongfu Han
Zongfu Han
XYXie Yu
Xie Yu
MSMeina Song
Meina Song

28 October 2024
Verified
Conference Paper
Open access
YFYu Feng
Yu Feng
ZTZhen Tian
Zhen Tian
Yifan ZhuYifan Zhu
Yifan Zhu
ZHZongfu Han
Zongfu Han
HLHaoran Luo
Haoran Luo
MSMeina Song
Meina Song
The key challenge of cross-modal domain-incremental learning (DIL) is to enable the learning model to continuously learn from novel data with different feature distributions under the same task without forgetting old ones. However, existing top-performing methods still cause high forgetting rates, by lacking intra-domain knowledge extraction and inter-domain common prompting strategy. In this paper, we propose a simple yet effective framework, CP-Prompt, by training limited parameters to instruct a pre-trained model to learn new domains and avoid forgetting existing feature distributions. CP-Prompt captures intra-domain knowledge by compositionally inserting personalized prompts into multi-head self-attention layers and then learns the inter-domain knowledge with a common prompting strategy. CP-Prompt shows superiority compared with state-of-the-art baselines among three widely evaluated DIL tasks. The source code is available at https://github.com/dannis97500/CP_Prompt.

3 November 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
WKWenjun Ke
Wenjun Ke
YGYikai Guo
Yikai Guo
QLQi Liu
Qi Liu
WCWanyi Chen
Wanyi Chen
PWPeng Wang
Peng Wang
ZLZhizhao Luo
Zhizhao Luo

29 April 2024 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
WZWentai Zhang
Wentai Zhang
Haihong EHaihong E
Haihong E
HLHaoran Luo
Haoran Luo
MSMingzhi Sun
Mingzhi Sun
Landmark-based 3-hop cover labeling is a category of approaches for shortest distance/path queries on large-scale complex networks. It pre-computes an index offline to accelerate the online distance/path query. Most real-world graphs undergo rapid changes in topology, which makes index maintenance on dynamic graphs necessary. So far, the majority of index maintenance methods can handle only one edge update (either an addition or deletion) each time. To keep up with frequently changing graphs, we research the ful ly b atch m aintenance problem for the 3-hop cover labeling, and proposed the method called FulBM . FulBM is composed of two algorithms: InsBM and DelBM, which are designed to handle batch edge insertions and deletions, respectively. This separation is motivated by the insight that batch maintenance for edge insertions are much more time-efficient and the fact that most edge updates in the real world are incremental. Both InsBM and DelBM are equipped with well-designed pruning strategies to minimize the number of vertex accesses. We have conducted comprehensive experiments on both synthetic and real-world graphs to verify the efficiency of FulBM and its variants for weighted graphs. The results show that our methods achieve 5.5× to 228× speedup compared with the state-of-the-art method.

19 December 2025 in Information Fusion
Verified
Journal Article
Closed access
RPRui Pan
Rui Pan
HLHaoran Luo
Haoran Luo
Quan YuanQuan Yuan
Quan Yuan
Guiyang LuoGuiyang Luo
Guiyang Luo
JLJinglin Li
Jinglin Li
Erik CambriaErik Cambria
Erik Cambria