Haoyi Xiong

Dr. Haoyi Xiong


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
14 September 2022 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
XLXuhong Li
Xuhong Li
HXHaoyi Xiong
Haoyi Xiong
XLXingjian Li
Xingjian Li
XWXuanyu Wu
Xuanyu Wu
XZXiao Zhang
Xiao Zhang
DDDejing Dou
Dejing Dou

13 May 2024 in Nature Machine Intelligence
Verified
Journal Article
Open access
PDF file
NWNing Wang
Ning Wang
JBJiang Bian
Jiang Bian
YLYuchen Li
Yuchen Li
XLXuhong Li
Xuhong Li
Shahid MumtazShahid Mumtaz
Shahid Mumtaz
HXHaoyi Xiong
Haoyi Xiong
Pretrained language models have shown promise in analysing nucleotide sequences, yet a versatile model excelling across diverse tasks with a single pretrained weight set remains elusive. Here we introduce RNAErnie, an RNA-focused pretrained model built upon the transformer architecture, employing two simple yet effective strategies. First, RNAErnie enhances pretraining by incorporating RNA motifs as biological priors and introducing motif-level random masking in addition to masked language modelling at base/subsequence levels. It also tokenizes RNA types (for example, miRNA, lnRNA) as stop words, appending them to sequences during pretraining. Second, subject to out-of-distribution tasks with RNA sequences not seen during the pretraining phase, RNAErnie proposes a type-guided fine-tuning strategy that first predicts possible RNA types using an RNA sequence and then appends the predicted type to the tail of sequence to refine feature embedding in a post hoc way. Our extensive evaluation across seven datasets and five tasks demonstrates the superiority of RNAErnie in both supervised and unsupervised learning. It surpasses baselines with up to 1.8% higher accuracy in classification, 2.2% greater accuracy in interaction prediction and 3.3% improved F1 score in structure prediction, showcasing its robustness and adaptability with a unified pretrained foundation.

7 August 2014 in IEEE Communications Magazine
Verified
Journal Article
Closed access
DZDaqing Zhang
Daqing Zhang
LWLeye Wang
Leye Wang
HXHaoyi Xiong
Haoyi Xiong
BGBin Guo
Bin Guo
With the rapid proliferation of sensor-rich smartphones, mobile crowd sensing has become a popular research field. In this article, we propose a four-stage life cycle (i.e., task creation, task assignment, individual task execution, and crowd data integration) to characterize the mobile crowd sensing process, and use 4W1H (i.e., what, when, where, who, and how) to sort out the research problems in the mobile crowd sensing domain. Furthermore, we attempt to foresee some new research directions in future mobile crowd sensing research.

3 March 2017 in Journal of Medical Internet Research
Verified
Journal Article
Open access
PCPhilip I Chow
Philip I Chow
KFKarl Fua
Karl Fua
YHYu Huang
Yu Huang
WBWesley Bonelli
Wesley Bonelli
HXHaoyi Xiong
Haoyi Xiong
BTBethany A Teachman
Bethany A Teachman
Journal of Medical Internet Research - International Scientific Journal for Medical Research, Information and Communication on the Internet

29 September 2015 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HXHaoyi Xiong
Haoyi Xiong
DZDaqing Zhang
Daqing Zhang
GCGuanling Chen
Guanling Chen
LWLeye Wang
Leye Wang
VGVincent Gauthier
Vincent Gauthier
LBLaura E. Barnes
Laura E. Barnes
This paper first defines a novel spatial-temporal coverage metric, k-depth coverage, for mobile crowdsensing (MCS) problems. This metric considers both the fraction of subareas covered by sensor readings and the number of sensor readings collected in each covered subarea. Then iCrowd, a generic MCS task allocation framework operating with the energy-efficient Piggyback Crowdsensing task model, is proposed to optimize the MCS task allocation with different incentives and k-depth coverage objectives/ constraints. iCrowd first predicts the call and mobility of mobile users based on their historical records, then it selects a set of users in each sensing cycle for sensing task participation, so that the resulting solution achieves two dual optimal MCS data collection goals-i.e., Goal. 1 near-maximal k-depth coverage without exceeding a given incentive budget or Goal. 2 near-minimal incentive payment while meeting a predefined k-depth coverage goal. We evaluated iCrowd extensively using a large-scale real-world dataset for these two data collection goals. The results show that: for Goal.1, iCrowd significantly outperformed three baseline approaches by achieving 3-60 percent higher k-depth coverage; for Goal.2, iCrowd required 10.0-73.5 percent less incentives compared to three baselines under the same k-depth coverage constraint.

22 March 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JBJiang Bian
Jiang Bian
AAAbdullah Al Arafat
Abdullah Al Arafat
HXHaoyi Xiong
Haoyi Xiong
JLJing Li
Jing Li
LLLi Li
Li Li
ZGZhishan Guo
Zhishan Guo
Over the last decade, machine learning (ML) and deep learning (DL) algorithms have significantly evolved and been employed in diverse applications, such as computer vision, natural language processing, automated speech recognition, etc. Real-time safety-critical embedded and Internet of Things (IoT) systems, such as autonomous driving systems, UAVs, drones, security robots, etc., heavily rely on ML/DL-based technologies, accelerated with the improvement of hardware technologies. The cost of a deadline (required time constraint) missed by ML/DL algorithms would be catastrophic in these safety-critical systems. However, ML/DL algorithm-based applications have more concerns about accuracy than strict time requirements. Accordingly, researchers from the real-time systems (RTSs) community address the strict timing requirements of ML/DL technologies to include in RTSs. This article will rigorously explore the state-of-the-art results emphasizing the strengths and weaknesses in ML/DL-based scheduling techniques, accuracy versus execution time tradeoff policies of ML algorithms, and security and privacy of learning-based algorithms in real-time IoT systems.