Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Fei Yu 0012

dblp:08/3571-12 · DBLP profile ↗
← Back
17ranked-venue papers
3as first author
14since 2021 · last 2026
0000-0001-8970-6269ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 1 first-author · 8 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Vision and language · 35% Trustworthy machine learning · 21% 3D vision · 17%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 77% Embedded and real-time systems · 23%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 21 heaviest of 21, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d scene understanding
3d scene graph
1.012026
Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning · AAAI 2026
Computer vision › 3D vision
3d scene understanding
1.012026
Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning · AAAI 2026
Computer vision › Vision and language › vision-language model
multimodal large language model
1.012026
Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models · IEEE Trans. Inf. Forensics Secur. 2026
Computer vision › Vision and language
multimodal reasoning
1.012026
Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning · AAAI 2026
Natural language and speech › Question answering and dialogue systems
retrieval-augmented reasoning
1.012026
Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning · AAAI 2026
Security and privacy of machine learning
adversarial attack
1.012026
Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning › adversarial attack
black-box attack
1.012026
Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models · IEEE Trans. Inf. Forensics Secur. 2026
Security and privacy of machine learning › adversarial attack
transferable adversarial attack
1.012026
Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models · IEEE Trans. Inf. Forensics Secur. 2026
Machine learning › Trustworthy machine learning › fairness › bias evaluation
cultural bias evaluation
0.912025
CVLUE: A New Benchmark Dataset for Chinese Vision-Language Understanding Evaluation · AAAI 2025
Computer vision › Vision and language
multimodal benchmark
0.912025
CVLUE: A New Benchmark Dataset for Chinese Vision-Language Understanding Evaluation · AAAI 2025
Computer vision › Vision and language
multimodal understanding
0.912025
CVLUE: A New Benchmark Dataset for Chinese Vision-Language Understanding Evaluation · AAAI 2025
Machine learning › Efficient and distributed learning › federated learning › model aggregation
byzantine-robust aggregation
0.812024
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning · AAAI 2024
Machine learning › Trustworthy machine learning › robustness
byzantine robustness
0.812024
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning · AAAI 2024
Machine learning › Efficient and distributed learning
federated learning
0.812024
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning · AAAI 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
A Huber Loss Minimization Approach to Byzantine Robust Federated Learning · AAAI 2024
Operating systems › resource management
power management
0.812024
OS-Level PMC-Based Runtime Thermal Control for ARM Mobile CPUs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Energy-efficient computing
thermal management
0.812024
OS-Level PMC-Based Runtime Thermal Control for ARM Mobile CPUs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Machine learning › Deep learning architectures and training
attention mechanism
0.312026
Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models · IEEE Trans. Inf. Forensics Secur. 2026
Computer vision › Segmentation and scene understanding
scene understanding
0.312026
Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning · AAAI 2026
Computer vision › Vision and language › vision-language model › vision-language foundation model
multilingual vision-language models
0.312025
CVLUE: A New Benchmark Dataset for Chinese Vision-Language Understanding Evaluation · AAAI 2025
Embedded and real-time systems › embedded processor
mobile processor
0.212024
OS-Level PMC-Based Runtime Thermal Control for ARM Mobile CPUs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024

Methods — techniques the papers use, named apart from their topics

shared adversarial feature · 2.0dynamic update strategy · 2.0polynomial regression · 1.5PMC sampling · 1.5vision-language model · 1.0vector database · 1.0retrieval-augmented generation · 1.0fine-tuning · 0.9benchmark construction · 0.9theoretical analysis · 0.8huber loss minimization · 0.8
YearPublicationVenuePosition
2026 Open-World 3D Scene Graph Generation for Retrieval-Augmented Reasoning
abstract
Open-world 3D scene understanding is fundamentally challenging for vision and robotics, due to the constraints of closed-vocabulary supervision and static annotations. To address this, we propose a unified framework for Open-World 3D Scene Graph Generation with Retrieval-Augmented Reasoning, which enables generalizable and interactive 3D scene understanding. Our method integrates vision-language models with retrieval-based reasoning to support multimodal exploration and language-guided interaction. The framework comprises two key components: (1) a dynamic scene graph generation module that detects objects and infers semantic relationships without fixed label sets, and (2) a retrieval-augmented reasoning pipeline that encodes scene graphs into a vector database to support text/image-conditioned queries. We evaluate our method on 3DSSG and Replica benchmarks across four tasks—scene question answering, visual grounding, instance retrieval, and task planning—demonstrating robust generalization and superior performance in diverse environments. Our results highlight the effectiveness of combining open-vocabulary perception with retrieval-based reasoning for scalable 3D scene understanding.
Fei Yu 0012, Shengeng Tang, Lechao Cheng
AAAI1
2026 RPA: Recursive Perturbation-Based Universal Adversarial Attacks on Multimodal Generative Tasks
abstract
Current adversarial attacks pose a serious threat to the robustness of visual-language models (VLMs), including vision-language pre-trained models (VLPMs) and multimodal large language models (MLLMs). Traditional adversarial attacks are example-specific and rely on specific datasets. This practice suffers from low transferability and additional computation cost, while universal adversarial perturbations (UAPs) offer example-agnostic solutions by generalizing across inputs. However, current UAP methods mainly target VLPMs, demonstrating limited transferability and effectiveness in MLLMs. To bridge this gap, we propose the Recursive Perturbation Attack (RPA), a novel black-box UAP method for both VLPMs and MLLMs. RPA employs a recursive perturbations strategy, utilizing token filtering and polynomial sampling methods to generate perturbations, thereby achieving incremental disruption and enhancing the transferability of the attack. To further enhance the effectiveness of the attack, RPA integrates a three-tier modality decoupling strategy, disentangling intra-modal, cross-modal, and fusion-modal features to effectively disrupt feature alignment and interactions. Extensive experiments validate that RPA achieves superior attack performance compared to existing UAP approaches. This work highlights new security concerns in multimodal AI systems and provides insights into the design of more robust models. Code is available at https://github.com/chilljudaoren/RPAttack.
Yaguan Qian, Qiqi Bao 0001, Chang Zong, Fei Yu 0012, Shouling Ji, Bin Wang 0062, Zhaoquan Gu, Zhen Lei 0001
IEEE Trans. Circuits Syst. Video Technol.5
2026 Exploiting Shared Adversarial Features for Dynamic Attacks in Large Vision-Language Models
abstract
With the rapid development of Large Language Models (LLMs), an increasing number of Large Visual-Language Models (LVLMs) have achieved unprecedented performance in response generation. Recent work shows that LVLMs are vulnerable to adversarial attacks. However, many existing methods tend to overfit to the source model by overemphasizing specific features, which compromises their transferability. Other approaches suffer from reduced attack effectiveness due to insufficient differentiation between features. In this paper, we propose a novel transfer-based black-box untargeted attack—Shared Adversarial Feature (SAF) dynamic attack. By exploring the feature extraction patterns of LVLMs, we identify the features shared among various models that are most susceptible to adversarial attacks and disrupt them. Moreover, due to the powerful attention mechanisms of LVLMs, they are still able to extract similar semantics from perturbed images, even when primary features are disrupted. We design a dynamic update strategy to address this challenge. Finally, from the perspective of SAF, we conduct an in-depth analysis of vulnerabilities in the vision encoder and projector within LVLMs and find that attacking the projector exhibits stronger transferability across heterogeneous model architectures. Extensive experiments show that our method exhibits superior attack performance compared to existing methods across different models, datasets, and tasks. The code will be publicly available after publication.
Yaguan Qian, Xucheng Zhu, Qiqi Bao 0001, Fei Yu 0012, Shouling Ji, Zhaoquan Gu, Wei Wang 0012, Bin Wang 0062, Zhen Lei 0001
IEEE Trans. Inf. Forensics Secur.4
2025 CVLUE: A New Benchmark Dataset for Chinese Vision-Language Understanding Evaluation
abstract
Despite the rapid development of Chinese vision-language models (VLMs), most existing Chinese vision-language (VL) datasets are constructed on Western-centric images from existing English VL datasets. The cultural bias in the images makes these datasets unsuitable for evaluating VLMs in Chinese culture. To remedy this issue, we present a new Chinese Vision-Language Understanding Evaluation (CVLUE) benchmark dataset, where the selection of object categories and images is entirely driven by Chinese native speakers, ensuring that the source images are representative of Chinese culture. The benchmark contains four distinct VL tasks ranging from image-text retrieval to visual question answering, visual grounding and visual dialogue. We present a detailed statistical analysis of CVLUE and provide a baseline performance analysis with several open-source multilingual VLMs on CVLUE and its English counterparts to reveal their performance gap between English and Chinese. Our in-depth category-level analysis reveals a lack of Chinese cultural knowledge in existing VLMs. We also find that fine-tuning on Chinese culture-related VL datasets effectively enhances VLMs' understanding of Chinese culture.
Yuxuan Wang 0001, Fei Yu 0012, Zhiguo Wan, Wanxiang Che, Hongyang Chen 0001
AAAI3
2025 Open-Scene Understanding-oriented 3D Scene Graph Generation
abstract
Understanding complex 3D environments is essential for many computer vision and robotic applications, especially in highly dynamic open-scene scenarios. The 3D scene graph plays an important role in the comprehension of 3D environments. However, most existing methods for 3D scene graph generation depend on pre-specified object and relationship classes (i.e., closed vocabulary) and labeled data for training, which restricts their effectiveness in the open-scene setting. To address this issue, we propose a novel Open-Scene Understanding-oriented 3D Scene Graph (OSU-3DSG) framework that can operate without labeled training data. The OSU-3DSG framework effectively extracts visual features from RGB-D image sequences and fuses them with camera pose estimates to create accurate 3D object maps. Then, by leveraging a pre-trained Vision Language Model (VLM), it generates relational triplets and constructs 3D scene graphs in a zero-shot manner. In particular, it excels at adaptively recognizing and interpreting object relationships, making it suitable for open-world applications. Finally, we perform extensive experiments on two open-world 3D datasets, namely 3DSSG and Replica, to evaluate the effectiveness and adaptability of the OSU-3DSG framework, demonstrating its potential to pave the way for the advancement of open-scene understanding. Our code and data are published at https://github.com/YuansuHao/OSU-3DSG.
Yuansu Hao, Fei Yu 0012, Yanhao Wang 0001, Nan Che
ICME2
2025 InfoSyncNet: Information Synchronization Temporal Convolutional Network for Visual Speech Recognition
abstract
Estimating spoken content from silent videos is crucial for applications in Assistive Technology (AT) and Augmented Reality (AR). However, accurately mapping lip movement sequences in videos to words poses significant challenges due to variability across sequences and the uneven distribution of information within each sequence. To tackle this, we introduce InfoSyncNet, a non-uniform sequence modeling network enhanced by tailored data augmentation techniques. Central to InfoSyncNet is a non-uniform quantization module positioned between the encoder and decoder, enabling dynamic adjustment to the network’s focus and effectively handling the natural inconsistencies in visual speech data. Additionally, multiple training strategies are incorporated to enhance the model’s capability to handle variations in lighting and the speaker’s orientation. Comprehensive experiments on the LRW and LRW1000 datasets confirm the superiority of InfoSyncNet, achieving new state-of-the-art accuracies of 92.0% and 60.7% Top-1 ACC1.
Junxiao Xue, Fei Yu 0012
IJCNN4
2025 Task-Oriented Semantic Communication Via Federated Learning
abstract
The transition from 5 G to beyond 5 G (B5G) networks is accelerating the development of ubiquitous and intelligent IoT applications. Semantic communication (SemCom) has emerged as a transformative paradigm that prioritizes task-relevant meaning over bit-level accuracy. However, deploying computationally intensive semantic models on resource-constrained end devices presents a major challenge. To address this issue, we propose FedSC, a new task-oriented semantic communication framework that enables end-edge collaborative learning by integrating federated learning with knowledge distillation. FedSC distributes model training between edge servers and end devices, where lightweight terminal models are collaboratively optimized with the assistance of more capable edge nodes, thus ensuring efficient and privacy-preserving semantic communication across heterogeneous environments. The framework adopts a hierarchical learning architecture in which the end and edge models cooperate via dynamic feature alignment, guided by the information bottleneck principle to balance semantic fidelity and compression. To further enhance efficiency and robustness, FedSC incorporates Gumbel-Softmax discretization for bandwidth-efficient semantic representation and introduces an SNR-adaptive inference mechanism to adapt to fluctuating wireless conditions. Experiments on Raspberry Pi clusters show that FedSC achieves improved performance in image classification and reconstruction tasks while significantly reducing communication overhead compared to existing baseline approaches.
Zhe Xiang, Yuandi Li, Fei Yu 0012, Yanhao Wang 0001, Zeyang Rao
IPCCC3
2025 Topic-aware most influential community search in social networks
Yanhao Wang 0001, Fei Yu 0012
Neurocomputing4
2025 NSC-SSNet: A Self-Supervised Network With Neighborhood Subsampling and Calibration Constraints for Sonar Image Denoising
abstract
Sonar imaging systems play a crucial role in several marine applications. However, complex underwater environment introduces scattering noise, significantly degrading sonar image quality and hindering performance for downstream tasks. Although several self-supervised denoising methods have emerged to address the lack of clean reference images, they often fail to effectively capture both local and global structural information, thus showing suboptimal performance on sonar images. To address these challenges, we propose NSC-SSNet, a Self-Supervised Network with Neighborhood Subsampling and Calibration constraints for sonar image denoising. In particular, NSC-SSNet adopts an end-to-end self-supervised framework that operates in the denoising and calibration stages. By leveraging neighborhood subsampling and calibration constraints, it effectively extracts latent features of clean images from noisy input. Moreover, it simultaneously captures local and global associations between pixels by incorporating additional terms in the loss function to improve image quality while denoising. Extensive experiments on real-world sonar image datasets demonstrate that NSC-SSNet outperforms existing self-supervised denoising methods in terms of both noise removal and quality enhancement.
Yapei Zhang, Yancheng Liu, Yanhao Wang 0001, Fei Yu 0012
IEEE Geosci. Remote. Sens. Lett.4
2025 Temporal multi-modal knowledge graph generation for link prediction
Yuandi Li, Hui Ji 0004, Fei Yu 0012, Lechao Cheng, Nan Che
Neural Networks3
2024 A Huber Loss Minimization Approach to Byzantine Robust Federated Learning
abstract
Federated learning systems are susceptible to adversarial attacks. To combat this, we introduce a novel aggregator based on Huber loss minimization, and provide a comprehensive theoretical analysis. Under independent and identically distributed (i.i.d) assumption, our approach has several advantages compared to existing methods. Firstly, it has optimal dependence on epsilon, which stands for the ratio of attacked clients. Secondly, our approach does not need precise knowledge of epsilon. Thirdly, it allows different clients to have unequal data sizes. We then broaden our analysis to include non-i.i.d data, such that clients have slightly different distributions.
Puning Zhao, Fei Yu 0012, Zhiguo Wan
AAAI2
2024 Multimodality-guided Visual-Caption Semantic Enhancement
Nan Che, Fei Yu 0012, Lechao Cheng, Yuxuan Wang 0001, Chenrui Liu
Comput. Vis. Image Underst.3
2024 Knowledge graph confidence-aware embedding for recommendation
Fei Yu 0012, Zhiguo Wan, Hui Ji 0004, Yuandi Li
Neural Networks2
2024 OS-Level PMC-Based Runtime Thermal Control for ARM Mobile CPUs
abstract
In order to improve performance and avoid overheating on mobile devices, precise thermal control with low overhead is crucial. To achieve this, we propose incorporating a performance monitoring counter (PMC)-based power model into thermal control, which enables a more accurate evaluation of the CPU’s power consumption. We demonstrate the plausibility of this approach using polynomial regression based on Moore’s Law. Additionally, we introduce a lightweight PMC sampling method that can collect multiple PMCs at once in the kernel space, reducing sampling overhead. By replacing the utilization-based model in the original the intelligent power allocation (IPA) with a PMC-based power model, we realize the PMC-based IPA governor can be ported to real mobile devices. After updating the thermal control governor in the Linux kernel, we perform tests on our PMC-based IPA using a mobile phone device. We compare it with Stepwise and IPA, which are commonly used in current mobile phone systems. We choose the CPU-intensive workbench, I/O-intensive workbench, and CPU and I/O-intensive hybrid workbench as workloads. The results show that PMC-based IPA effectively reduces energy consumption while improving performance. In particular, during the CPU and I/O-intensive hybrid experiment, where CPU-intensive and I/O-intensive tasks are executed alternately, PMC-based IPA reduces the running time by 10.0% and energy consumption by 16.6% compared to the original IPA. In order to verify the benefits of PMC-based IPA, mobile phone testing software AI Bench and Antutu are utilized. The results show that our scheme is able to control temperature more precisely than IPA and achieves a better score while consuming less energy, particularly during AI computing. These experiment results suggest that PMC-based IPA is valuable for practical use.
Nan Che, Puning Zhao, Fei Yu 0012, Zhijun Li 0002, Xing Gao 0004, Yuandi Li, Xiaogang Cui
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2019 Heterogeneous Components Fusion Network for Load Forecasting of Charging Stations
abstract
Accurate load forecasting of charging stations enable managers to reduce the drivers' waiting time and operating costs. But the existing works for spatial-temporal sequence forecasting usually assume the spatial-continuity of signals. However, the recharging scenario, in which the above assumptions are not valid due to the sparse spatial distribution of stations, need further research. To fill the gap, we present a Heterogeneous Components Fusion Network to model dual components sourced from the planned and the unplanned recharging events independently. For planned recharging component, we design a customized transformer to 'looks up' the reference 'memory' for the prediction. And we propose the time-variant graph to model highly dynamic unplanned events. Experiments conducted on a load reading dataset of 120 stations suggest that our model achieves better performance than a series of state-of-the-arts for spatial-temporal sequence prediction problem.
Fei Yu 0012, Cheng Feng 0001
CIKM2
2017 Point-of-Interest Recommendation for Location Promotion in Location-Based Social Networks
abstract
With the wide application of location-based social networks (LBSNs), point-of-interest (POI) recommendation has become one of the major services in LBSNs. The behaviors of users in LBSNs are mainly checking in POIs, and these checking-in behaviors are influenced by user's behavior habits and his/her friends. In social networks, social influence is often used to help businesses to attract more users. Each target user has a different influence on different POI in social networks. This paper selects the list of POIs with the greatest influence for recommending users. Our goals are to satisfy the target user's service need, and simultaneously to promote businesses' locations (POIs). This paper defines a POI recommendation problem for location promotion. Additionally, we use submodular properties to solve the optimization problem. At last, this paper conducted a comprehensive performance evaluation for our method using two real LBSN datasets. Experimental results show that our proposed method achieves significantly superior POI recommendations comparing with other state-of-the-art recommendation approaches in terms of location promotion.
Fei Yu 0012, Zhijun Li 0002, Shouxu Jiang, Shirong Lin
MDM1
2017 Friend Recommendation Considering Preference Coverage in Location-Based Social Networks
Fei Yu 0012, Nan Che, Zhijun Li 0002, Shouxu Jiang
PAKDD (2)1