Yuan Yao

Yuan Yao

Auto-generated profile, based on publicly available information

Yuan Yao

Nanjing University, Nanjing, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
3 November 2022
Verified
Book Chapter
Closed access
PDF file
TWTong Wang
Tong Wang
YYYuan Yao
Yuan Yao
FXFeng Xu
Feng Xu
SAShengwei An
Shengwei An
HTHanghang Tong
Hanghang Tong
TWTing Wang
Ting Wang

7 February 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
HYHaibo Ye
Haibo Ye
XLXinjie Li
Xinjie Li
YYYuan Yao
Yuan Yao
HTHanghang Tong
Hanghang Tong
Neural graph collaborative filtering has received great recent attention due to its power of encoding the high-order neighborhood via the backbone graph neural networks. However, their robustness against noisy user-item interactions remains largely unexplored. Existing work on robust collaborative filtering mainly improves the robustness by denoising the graph structure, while recent progress in other fields has shown that directly adding adversarial perturbations in the embedding space can significantly improve the model robustness. In this work, we propose to improve the robustness of neural graph collaborative filtering via both denoising in the structure space and perturbing in the embedding space. Specifically, in the structure space, we measure the reliability of interactions and further use it to affect the message propagation process of the backbone graph neural networks; in the embedding space, we add in-distribution perturbations by mimicking the behavior of adversarial attacks and further combine it with contrastive learning to improve the performance. Extensive experiments have been conducted on four benchmark datasets to evaluate the effectiveness and efficiency of the proposed approach. The results demonstrate that the proposed approach outperforms the recent neural graph collaborative filtering methods especially when there are injected noisy interactions in the training data.

6 September 2019 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
SXSheng-Qu Xi
Sheng-Qu Xi
YYYuan Yao
Yuan Yao
XXXu-Sheng Xiao
Xu-Sheng Xiao
FXFeng Xu
Feng Xu
JLJian Lv
Jian Lv

27 October 2024
Verified
Conference Paper
Open access
GWGuangyuan Wu
Guangyuan Wu
WCWeining Cao
Weining Cao
YYYuan Yao
Yuan Yao
HWHengfeng Wei
Hengfeng Wei
TCTaolue Chen
Taolue Chen
XMXiaoxing Ma
Xiaoxing Ma
Loop invariant inference, a key component in program verification, is a challenging task due to the inherent undecidability and complex loop behaviors in practice. Recently, machine learning based techniques have demonstrated impressive performance in generating loop invariants automatically. However, these methods highly rely on the labeled training data, and are intrinsically random and uncertain, leading to unstable performance. In this paper, we investigate a synergy of large language models (LLMs) and bounded model checking (BMC) to address these issues. The key observation is that, although LLMs may not be able to return the correct loop invariant in one response, they usually can provide all individual predicates of the correct loop invariant in multiple responses. To this end, we propose a "query-filter-reassemble" strategy, namely, we first leverage the language generation power of LLMs to produce a set of candidate invariants, where training data is not needed. Then, we employ BMC to identify valid predicates from these candidate invariants, which are assembled to produce new candidate invariants and checked by off-the-shelf SMT solvers. The feedback is incorporated into the prompt for the next round of LLM querying. We expand the existing benchmark of 133 programs to 316 programs, providing a more comprehensive testing ground. Experimental results demonstrate that our approach significantly outperforms the state-of-the-art techniques, successfully generating 309 loop invariants out of 316 cases, whereas the existing baseline methods are only able to tackle 219 programs at best. The code is publicly available at https://github.com/SoftWiser-group/LaM4Inv.git.

8 July 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
HSHang Sun
Hang Sun
YYYuan Yao
Yuan Yao
LZLefei Zhang
Lefei Zhang
DRDong Ren
Dong Ren
Recently, transformers have been widely explored in remote sensing image change detection and achieved remarkable performance. However, most existing transformer-based change detection methods overlook exploring the spatiotemporal relationships between bitemporal images at the features within the same layer, which is crucial for learning discriminative features to perceive changes. Moreover, no explicit spatial constraint has been imposed on the final fused bitemporal features, leading to reduced detection performance on small targets. To address these issues, we propose a spatial focused bitemporal interactive network (SFBI-Net) for remote sensing image change detection. Specifically, a bitemporal spatiotemporal interactive (BSI) module is proposed, which performs global interactions on bitemporal features at the same network layer and supplements local information to obtain spatiotemporal relationships of bitemporal features for discriminative representation. Furthermore, a spatial focus diversity loss (SFD-Loss) is developed to maximize bitemporal features in the spatial dimension and further enhance the feature representation of change areas, especially small target areas. The experimental results on challenging benchmark datasets demonstrate the superiority of our SFBI-Net. The source code is available at https://github.com/Mryao-yuan/SFBI-Net.

1 June 2020 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
YWYaojing Wang
Yaojing Wang
YYYuan Yao
Yuan Yao
HTHanghang Tong
Hanghang Tong
XHXuan Huo
Xuan Huo
MLMing Li
Ming Li
JLJian Lu
Jian Lu