Xiaoyu Shen

Xiaoyu Shen

Auto-generated profile, based on publicly available information

Xiaoyu Shen

Eastern Institute of Technology, Ningbo, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
22 April 2025
Verified
Conference Paper
Open access
HCHongru Cai
Hongru Cai
YLYongqi Li
Yongqi Li
WWWenjie Wang
Wenjie Wang
FZFengbin Zhu
Fengbin Zhu
XSXiaoyu Shen
Xiaoyu Shen
TCTat-Seng Chua
Tat-Seng Chua

26 November 2021 in IEEE/ACM Transactions on Audio, Speech, and Language Processing
Verified
Journal Article
Open access
JGJidong Ge
Jidong Ge
YHYunyun Huang
Yunyun Huang
XSXiaoyu Shen
Xiaoyu Shen
CLChuanyi Li
Chuanyi Li
WHWei Hu
Wei Hu
Automatically recommending relevant law articles to a given legal case has attracted much attention as it can greatly release human labor from searching over the large database of laws. However, current researches only support coarse-grained recommendation where all relevant articles are predicted as a whole without explaining which specific fact each article is relevant with. Since one case can be formed of many supporting facts, traversing over them to verify the correctness of recommendation results can be time-consuming. We believe that learning fine-grained correspondence between each single fact and law articles is crucial for an accurate and trustworthy AI system. With this motivation, we perform a pioneering study and create a corpus with manually annotated fact-article correspondences. We treat the learning as a text matching task and propose a multi-level matching network to address it. To help the model better digest the content of law articles, we parse articles in form of premise-conclusion pairs with random forest. Experiments show that the parsed form yielded better performance and the resulting model surpassed other popular text matching baselines. Furthermore, we compare with previous researches and find that establishing the fine-grained fact-article correspondences can improve the recommendation accuracy by a large margin. Our best system reaches an F1 score of 96.3%, making it of great potential for practical use. It can also significantly boost the downstream task of legal decision prediction, increasing the F1 score by up to 12.7%. Code and dataset are available at https://github.com/gjdnju/MLMN .


24 July 2018 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
MBMichael Backes
Michael Backes
PBPascal Berrang
Pascal Berrang
MHMathias Humbert
Mathias Humbert
XSXiaoyu Shen
Xiaoyu Shen
VWVerena Wolf
Verena Wolf
The dramatically decreasing costs of DNA sequencing have triggered more than a million humans to have their genotypes sequenced. Moreover, these individuals increasingly make their genomic data publicly available, thereby creating privacy threats for themselves and their relatives because of their DNA similarities. More generally, an entity that gains access to a significant fraction of sequenced genotypes might be able to infer even the genomes of unsequenced individuals. In this paper, we propose a simulation-based model for quantifying the impact of continuously sequencing and publicizing personal genomic data on a population's genomic privacy. Our simulation probabilistically models data sharing and takes into account events such as migration and interracial mating. We exemplarily instantiate our simulation with a sample population of 1,000 individuals and evaluate the privacy under multiple settings over 6,000 genomic variants and a subset of phenotype-related variants. Our findings demonstrate that an increasing sharing rate in the future entails a substantial negative effect on the privacy of all older generations. Moreover, we find that mixed populations face a less severe erosion of privacy over time than more homogeneous populations. Finally, we demonstrate that genomic-data sharing can be much more detrimental for the privacy of the phenotype-related variants.

24 February 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
WZWei Zhang
Wei Zhang
SWShanze Wang
Shanze Wang
MTMingao Tan
Mingao Tan
ZYZhibo Yang
Zhibo Yang
XWXianghui Wang
Xianghui Wang
XSXiaoyu Shen
Xiaoyu Shen
In this letter, we present a deep reinforcement learning-based dimension-configurable local planner (DRL-DCLP) for solving robot navigation problems. DRL-DCLP is the first neural-network local planner capable of handling rectangular differential-drive robots with varying dimension configurations without requiring post-fine-tuning. While DRL has shown excellent performance in enabling robots to navigate complex environments, it faces a significant limitation compared to conventional local planners: dimension-specificity. This constraint implies that a trained controller for a specific configuration cannot be generalized to robots with different physical dimensions, velocity ranges, or acceleration limits. To overcome this limitation, we introduce a dimension-configurable input representation and a novel learning curriculum for training the navigation agent. Extensive experiments demonstrate that DRL-DCLP facilitates successful navigation for robots with diverse dimensional configurations, achieving superior performance across various navigation tasks.

1 January 2023
Verified
Conference Paper
Open access
PDF file
XSXiaoyu Shen
Xiaoyu Shen
AAAkari Asai
Akari Asai
BBBill Byrne
Bill Byrne
AGAdria De Gispert
Adria De Gispert
Xiaoyu Shen, Akari Asai, Bill Byrne, Adria De Gispert. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 5: Industry Track). 2023.