Hefei Mei

Hefei Mei

Auto-generated profile, based on publicly available information

Hefei Mei

University of Electronic Science and Technology of China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
29 July 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
TZTaijin Zhao
Taijin Zhao
HQHeqian Qiu
Heqian Qiu
YDYu Dai
Yu Dai
LWLanxiao Wang
Lanxiao Wang
HMHefei Mei
Hefei Mei
HLHongliang Li
Hongliang Li

16 July 2025 in Neurocomputing
Verified
Journal Article
Closed access
HMHefei Mei
Hefei Mei
TZTaijin Zhao
Taijin Zhao
STShiyuan Tang
Shiyuan Tang
HQHeqian Qiu
Heqian Qiu
LWLanxiao Wang
Lanxiao Wang
HLHongliang Li
Hongliang Li


1 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
JJJian Jiao
Jian Jiao
YDYu Dai
Yu Dai
HMHefei Mei
Hefei Mei
HQHeqian Qiu
Heqian Qiu
CGChuanyang Gong
Chuanyang Gong
HLHongliang Li
Hongliang Li
Recent video class-incremental learning usually excessively pursues the accuracy of the newly seen classes and relies on memory sets to mitigate catastrophic forgetting of the old classes. However, limited storage only allows storing a few representative videos. So we propose SNRO, which slightly shifts the features of new classes to remember old classes. Specifically, SNRO contains Examples Sparse(ES) and Early Break(EB). ES decimates at a lower sample rate to build memory sets and uses interpolation to align those sparse frames in the future. By this, SNRO stores more examples under the same memory consumption and forces the model to focus on low-semantic features which are harder to be forgotten. EB terminates the training at a small epoch, preventing the model from overstretching into the high-semantic space of the current task. Experiments on UCF101, HMDB51, and UESTC-MMEA-CL datasets show that SNRO performs better than other approaches while consuming the same memory consumption.

26 January 2026 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SYShen You
Shen You
WJWei Jiang
Wei Jiang
HMHefei Mei
Hefei Mei
DGDanei Gong
Danei Gong
ZLZhongshen Li
Zhongshen Li
Ka-Chun WongKa-Chun Wong
Ka-Chun Wong
Large Language Models (LLMs) demonstrate promising capabilities in natural language understanding and reasoning with enormous parameter spaces and vast amounts of training data. These attributes have facilitated their deployment into diverse application domains. However, the underlying parameters implicitly assume decision-making boundaries, resulting in a significant number of decision spaces not covered by training data. This makes them susceptible to adversarial manipulations through carefully crafted inputs. To illuminate the vulnerabilities of LLMs, we propose a unified token-level jailbreaking attack that makes victim models generate responses for potentially harmful queries. Specifically, we propose an evolutionary algorithm to evolve perturbation sets, utilizing gradient-based and crossover-based operators to enhance performance under multiple scenarios. Furthermore, we develop a repository for reusing past perturbations and conduct an analysis of token sensitivity within LLMs, facilitating zero-shot attacks with convergence. Extensive benchmark experiments validate the effectiveness of our method on three different models, achieving increases of 62.36%, 57.89%, and 64.81% in attack success rates compared to baseline methods under white-box scenarios. In addition, the evaluation experiments demonstrate our method is effective for multiple scenarios and different size of models. This research reveals vulnerabilities of LLMs, provides theoretical foundations for developing more robust defense strategies, and contributes to building more reliable AI systems.

29 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
HMHefei Mei
Hefei Mei
TZTaijin Zhao
Taijin Zhao
STShiyuan Tang
Shiyuan Tang
HQHeqian Qiu
Heqian Qiu
LWLanxiao Wang
Lanxiao Wang
HLHongliang Li
Hongliang Li
Few-shot object detection (FSOD) aims to achieve object detection only using a few novel class training data. Most of the existing methods usually adopt a transfer-learning strategy to construct the novel class distribution by transferring the base class knowledge. However, this direct way easily results in confusion between the novel class and other similar categories in the decision space. To address the problem, we propose generating local reverse samples (LRSamples) in Prototype Reference Frames to adaptively adjust the center position and boundary range of the novel class distribution to learn more discriminative novel class samples for FSOD. Firstly, we propose a Center Calibration Variance Augmentation (CCVA) module, which contains the selection rule of LRSamples, the generator of LRSamples, and augmentation on the calibrated distribution centers. Specifically, we design an intra-class feature converter (IFC) as the generator of CCVA to learn the selecting rule. By transferring the knowledge of IFC from the base training to fine-tuning, the IFC generates plentiful novel samples to calibrate the novel class distribution. Moreover, we propose a Feature Density Boundary Optimization (FDBO) module to adaptively adjust the importance of samples depending on their distance from the decision boundary. It can emphasize the importance of the high-density area of the similar class (closer decision boundary area) and reduce the weight of the low-density area of the similar class (farther decision boundary area), thus optimizing a clearer decision boundary for each category. We conduct extensive experiments to demonstrate the effectiveness of our proposed method. Our method achieves consistent improvement on the Pascal VOC and MS COCO datasets based on DeFRCN and MFDC baselines.