Yingfei Sun

Yingfei Sun


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
27 September 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
CLCanjia Li
Canjia Li
AYAndrew Yates
Andrew Yates
SMSean MacAvaney
Sean MacAvaney
BHBen He
Ben He
YSYingfei Sun
Yingfei Sun
Pre-trained transformer models, such as BERT and T5, have shown to be highly effective at ad hoc passage and document ranking. Due to the inherent sequence length limits of these models, they need to process document passages one at a time rather than processing the entire document sequence at once. Although several approaches for aggregating passage-level signals into a document-level relevance score have been proposed, there has yet to be an extensive comparison of these techniques. In this work, we explore strategies for aggregating relevance signals from a document’s passages into a final ranking score. We find that passage representation aggregation techniques can significantly improve over score aggregation techniques proposed in prior work, such as taking the maximum passage score. We call this new approach PARADE. In particular, PARADE can significantly improve results on collections with broad information needs where relevance signals can be spread throughout the document (such as TREC Robust04 and GOV2). Meanwhile, less complex aggregation techniques may work better on collections with an information need that can often be pinpointed to a single passage (such as TREC DL and TREC Genomics). We also conduct efficiency analyses and highlight several strategies for improving transformer-based aggregation.

30 March 2021
Verified
Book Chapter
Closed access
PDF file
XCXuanang Chen
Xuanang Chen
BHBen He
Ben He
KHKai Hui
Kai Hui
LSLe Sun
Le Sun
YSYingfei Sun
Yingfei Sun

29 November 2016 in Sensors
Verified
Journal Article
Open access
PDF file
JHJiateng Hou
Jiateng Hou
YSYingfei Sun
Yingfei Sun
LSLixin Sun
Lixin Sun
BPBingyu Pan
Bingyu Pan
ZHZhipei Huang
Zhipei Huang
ZZZhiqiang Zhang
Zhiqiang Zhang
This paper proposes a neuromusculoskeletal (NMS) model to predict individual muscle force during elbow flexion and extension. Four male subjects were asked to do voluntary elbow flexion and extension. An inertial sensor and surface electromyography (sEMG) sensors were attached to subject's forearm. Joint angle calculated by fusion of acceleration and angular rate using an extended Kalman filter (EKF) and muscle activations obtained from the sEMG signals were taken as the inputs of the proposed NMS model to determine individual muscle force. The result shows that our NMS model can predict individual muscle force accurately, with the ability to reflect subject-specific joint dynamics and neural control solutions. Our method incorporates sEMG and motion data, making it possible to get a deeper understanding of neurological, physiological, and anatomical characteristics of human dynamic movement. We demonstrate the potential of the proposed NMS model for evaluating the function of upper limb movements in the field of neurorehabilitation.

1 January 2023
Verified
Conference Paper
Open access
PDF file
XPXinlin Peng
Xinlin Peng
YZYing Zhou
Ying Zhou
BHBen He
Ben He
LSLe Sun
Le Sun
YSYingfei Sun
Yingfei Sun
Xinlin Peng, Ying Zhou, Ben He, Le Sun, Yingfei Sun. Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 2023.

11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
XHXumeng Han
Xumeng Han
LWLonghui Wei
Longhui Wei
XYXuehui Yu
Xuehui Yu
ZDZhiyang Dou
Zhiyang Dou
XHXin He
Xin He
QTQi Tian
Qi Tian
The recent Segment Anything Model (SAM) has emerged as a new paradigmatic vision foundation model, showcasing potent zero-shot generalization and flexible prompting. Despite SAM finding applications and adaptations in various domains, its primary limitation lies in the inability to grasp object semantics. In this paper, we present Sambor to seamlessly integrate SAM with the open-vocabulary object detector in an end-to-end framework. While retaining all the remarkable capabilities inherent to SAM, we boost it to detect arbitrary objects from human inputs like category names or reference expressions. Building upon the SAM image encoder, we introduce a novel SideFormer module designed to acquire SAM features adept at perceiving objects and inject comprehensive semantic information for recognition. In addition, we devise an Open-set RPN that leverages SAM proposals to assist in finding potential objects. Consequently, Sambor enables the open-vocabulary detector to equally focus on generalizing both localization and classification sub-tasks. Our approach demonstrates superior zero-shot performance across benchmarks, including COCO and LVIS, proving highly competitive against previous state-of-the-art methods. We aspire for this work to serve as a meaningful endeavor in endowing SAM to recognize diverse object categories and advancing open-vocabulary learning with the support of vision foundation models.

22 October 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
ZYZhipeng Yu
Zhipeng Yu
QXQianqian Xu
Qianqian Xu
YJYangbangyan Jiang
Yangbangyan Jiang
YSYingfei Sun
Yingfei Sun
QHQingming Huang
Qingming Huang
The existence of noisy labels in real-world data negatively impacts the performance of deep learning models. Although much research effort has been devoted to improving the robustness towards noisy labels in classification tasks, the problem of noisy labels in deep metric learning (DML) remains under-explored. Existing noisy label learning methods designed for DML mainly discard suspicious noisy samples, resulting in a waste of the training data. To address this issue, we propose a noise-robust DML framework with SubGroup-based Positive-pair Selection (SGPS), which constructs reliable positive pairs for noisy samples to enhance the sample utilization. Specifically, SGPS first effectively identifies clean and noisy samples by a probability-based clean sample selectionstrategy. To further utilize the remaining noisy samples, we discover their potential similar samples based on the subgroup information given by a subgroup generation module and then aggregate them into informative positive prototypes for each noisy sample via a positive prototype generation module. Afterward, a new contrastive loss is tailored for the noisy samples with their selected positive pairs. SGPS can be easily integrated into the training process of existing pair-wise DML tasks, like image retrieval and face recognition. Extensive experiments on multiple synthetic and real-world large-scale label noise datasets demonstrate the effectiveness of our proposed method. Without any bells and whistles, our SGPS framework outperforms the state-of-the-art noisy label DML methods.