BHBingde Hu

Bingde Hu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Bingde Hu has a total of 29 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Adaptive Forensic Feature Refinement via Intrinsic Importance Perception

    by Jiazhen Yang, Junjun Zheng, Kejia Chen, Xiangheng Kong, Jie Lei, Zunlei Feng, Bingde Hu, Yang Gao

  • Open Access

    An Effective Stochastic Response Entropy Criterion for Model Poisoning Detection in Federated Learning

    by Jiazhen Yang, Kejia Chen, Tian Qiu, Yang Gao, Lingxiang Jia, Bingde Hu, Zunlei Feng

    Federated Learning (FL) is vulnerable to model poisoning attacks, where malicious clients directly manipulate local gradient to corrupt global model optimization. Existing methods typically rely on task-relevant validation data or impose strict assumptions on data distributions, and therefore struggle to effectively distinguish malicious gradients from outlying benign gradients caused by data heterogeneity in privacy-constrained real world Non-IID scenarios. In this work, we investigate the fundamental differences in predictive behavior between malicious and benign models from the perspective of random data. Our key observation indicates that malicious models exhibit pronounced prediction bias when evaluated on random data due to tampering with local updates, whereas benign models are driven by prior knowledge and yield more diverse predictions. This provides a novel perspective for defending against model poisoning attacks beyond traditional gradient space analysis. To quantify this behavioral discrepancy, we introduce Stochastic Response Entropy, an entropy-based criterion that measures the diversity of model predictions on random data. Building on this insight, we propose FedSRE, a novel defense framework for FL. FedSRE introduces an adaptive robust aggregation strategy that maximizes global model prediction diversity on random data by dynamically adjusting client aggregation weights. Furthermore, FedSRE conducts cluster analysis on learned weights to identify potentially malicious clients and facilitate contribution-based aggregation of benign clients. Experiments across various datasets and attack settings show that FedSRE not only achieves competitive defense performance by effectively detecting malicious clients, but also quantifies the contributions of benign clients to enhance global model performance. The source code is available at this link.

  • RLV: LLM-based vulnerability detection by retrieving and refining contextual information

    by Fangcheng Qiu, Zhongxin Liu, Bingde Hu, Zhengong Cai, Lingfeng Bao, Xinyu Wang


  • Efficient Distributed Graph Neural Network Training With Source Chunking and Moving Aggregation

    by Wenjie Huang, Tongya Zheng, Rui Wang, Tongtian Zhu, Bingde Hu, Shuibing He, Mingli Song, Xinyu Wang, Sai Wu, Chun Chen

    Graph neural networks (GNNs) are effective models for analyzing graph-structured data, but encounter challenges when training on large distributed graphs. Existing GNN training frameworks use sampling parallelism and historical embedding methods to support distributed training and enhance efficiency. However, these methods suffer from issues like stale historical embeddings, imbalanced communication messages, and redundant storage and computation costs. In this paper, we present Emma, a distributed GNN training framework that incorporates source node centric chunking for frequent updates of embeddings and balanced communication, as well as a moving message aggregation technique to boost training efficiency and reduce storage costs. Experimental results show that Emma significantly enhances training efficiency by reducing computation and communication overhead, leading to a notable speedup while maintaining convergence accuracy compared to state-of-the-art distributed GNN training methods.


  • Open Access

    Disentangled Condensation for Large-scale Graphs

    by Zhenbang Xiao, Yu Wang, Shunyu Liu, Bingde Hu, Huiqiong Wang, Mingli Song, Tongya Zheng


  • HSDN: A High-Order Structural Semantic Disentangled Neural Network

    by Bingde Hu, Xingen Wang, Zunlei Feng, Jie Song, Ji Zhao, Mingli Song, Xinyu Wang

    Graph disentangling is a new promising direction that can help us to discover the latent patterns in the data and understand the behaviors of a graph learning model. Despite the many efforts in disentangling representation learning, few works focus on disentangling the latent factors behind a graph. Most current foci are mainly on studying node-level semantics in the graphs. Compared with node-level, the structure-level view can provide a new interpretable and in-depth insight into graph data. The study of structure-level relations enables us to reveal the high-order structural semantics in the data. To explore the complex high-order structural semantics in the data, we propose the High-order Structural Semantic Disentangled Neural Network (HSDN) to model the graph structure units and disentangle structural semantics. It's the first attempt to hypergraph disentangled networks. Unlike prior methods that disentangle factor graphs based on pair-wise relations only, we introduce hyperedges on pair-wise graphs to model structure units and disentangle the complex high-order structural semantics between different structures. Extensive experiments demonstrate that HSDN achieves state-of-the-art performances in terms of both disentangling and downstream tasks.