Tingting Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tingting Wu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Hao Zhang
Harbin Institute of Technology
10 shared publications - Siyao Cheng
Faculty of Computing, Harbin Institute of Technology, Harbin, China
5 shared publications - Xiao Ding
Harbin Institute of Technology SCIR Lab
5 shared publications - Minji Tang
Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China
4 shared publications - Bing Qin
Harbin Institute of Technology
3 shared publications Jie Liu
Institute for Artificial Intelligence, Harbin Institute of Technology (Shenzhen), Shenzhen, China
3 shared publications
Latest Publications
- 20 November 2025
- Published by Elsevier in Neural Networks
- Vol. 196, 108217
Chain-of-Detection enables robust and efficient jailbreak defense
- 20 November 2025
- Published by Elsevier in Neural Networks
- Vol. 196, 108217
Chain-of-Detection enables robust and efficient jailbreak defense
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 1058-1075
Model-Heterogeneous Federated Learning With Bidirectional Knowledge Distillation
Federated Learning (FL) faces significant challenges in addressing the system heterogeneity of edge devices, which often exhibit diverse computational and resource constraints. To overcome these limitations, we propose FedBid, a novel model-heterogeneous FL framework based on bidirectional, data-free knowledge distillation. By synthesizing data on the server and integrating forward-backward knowledge distillation with group aggregation, FedBid allows devices to adopt different models tailored to their resources and enabling efficient knowledge sharing across diverse model architectures without relying on public datasets. In addition, we further introduce progressive learning and generator perturbation strategies to enhance the efficiency of bidirectional knowledge distillation. Extensive experiments on benchmark datasets (Fashion-MNIST, CIFAR-10) and a real-world dataset (FLAIR) under varied data distributions demonstrate that FedBid achieves superior model performance than the state-of-the-art methods while reducing computational overhead on resource-constrained clients.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (1) , 1058-1075
Model-Heterogeneous Federated Learning With Bidirectional Knowledge Distillation
Federated Learning (FL) faces significant challenges in addressing the system heterogeneity of edge devices, which often exhibit diverse computational and resource constraints. To overcome these limitations, we propose FedBid, a novel model-heterogeneous FL framework based on bidirectional, data-free knowledge distillation. By synthesizing data on the server and integrating forward-backward knowledge distillation with group aggregation, FedBid allows devices to adopt different models tailored to their resources and enabling efficient knowledge sharing across diverse model architectures without relying on public datasets. In addition, we further introduce progressive learning and generator perturbation strategies to enhance the efficiency of bidirectional knowledge distillation. Extensive experiments on benchmark datasets (Fashion-MNIST, CIFAR-10) and a real-world dataset (FLAIR) under varied data distributions demonstrate that FedBid achieves superior model performance than the state-of-the-art methods while reducing computational overhead on resource-constrained clients.
- 23 May 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (9) , 5311-5333
Reasoning subevent relation over heterogeneous event graph
- 23 May 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (9) , 5311-5333
Reasoning subevent relation over heterogeneous event graph
- 9 May 2024
- Published by Elsevier in Neural Networks
- Vol. 176, 106383
Uncertainty-guided label correction with wavelet-transformed discriminative representation enhancement
- 9 May 2024
- Published by Elsevier in Neural Networks
- Vol. 176, 106383
Uncertainty-guided label correction with wavelet-transformed discriminative representation enhancement
- 10 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22530-22541
Data-Augmentation-Based Federated Learning
With the rapid growth of the number of devices generating and collecting data, dispersion becomes an important feature of data in Internet of Things. Federated learning (FL) provides a feasible way to mine information in such distributed data. It involves training machine learning models over multiple distributed participants without raw data transmission. However, due to the data heterogeneity among participants, the performance of the FL model degrades dramatically. Currently, improved methods mainly reduce data heterogeneity from the perspective of modifying the process of model training, which usually have problems such as high resource consumption or the need for auxiliary data. In this paper, we enhance FL model from another perspective, focusing on data rather than model training. We reduce data heterogeneity by enhancing the trained local data to improve FL performance. Specifically, we propose an FL method based on data augmentation (abbr. FedM-UNE), implementing the classic data augmentation method MixUp in federated scenarios without transferring raw data. Furthermore, in order to adapt this method to regression tasks, we first modify MixUp by bilateral neighborhood expansion (MixUp-BNE), and then propose a federated data augmentation method named FedM-BNE based on it. Compared with the conventional FL method, both FedM-UNE and FedM-BNE increase negligible overhead. To demonstrate the effectiveness, we conduct exhaustive experiments on six datasets employing a variety of loss functions. The results indicate that FedM-UNE and FedM-BNE consistently improve the performance of the FL model. Moreover, our methods are compatible with existing FL enhancements, which yield further improvements in performance.
- 10 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (24) , 22530-22541
Data-Augmentation-Based Federated Learning
With the rapid growth of the number of devices generating and collecting data, dispersion becomes an important feature of data in Internet of Things. Federated learning (FL) provides a feasible way to mine information in such distributed data. It involves training machine learning models over multiple distributed participants without raw data transmission. However, due to the data heterogeneity among participants, the performance of the FL model degrades dramatically. Currently, improved methods mainly reduce data heterogeneity from the perspective of modifying the process of model training, which usually have problems such as high resource consumption or the need for auxiliary data. In this paper, we enhance FL model from another perspective, focusing on data rather than model training. We reduce data heterogeneity by enhancing the trained local data to improve FL performance. Specifically, we propose an FL method based on data augmentation (abbr. FedM-UNE), implementing the classic data augmentation method MixUp in federated scenarios without transferring raw data. Furthermore, in order to adapt this method to regression tasks, we first modify MixUp by bilateral neighborhood expansion (MixUp-BNE), and then propose a federated data augmentation method named FedM-BNE based on it. Compared with the conventional FL method, both FedM-UNE and FedM-BNE increase negligible overhead. To demonstrate the effectiveness, we conduct exhaustive experiments on six datasets employing a variety of loss functions. The results indicate that FedM-UNE and FedM-BNE consistently improve the performance of the FL model. Moreover, our methods are compatible with existing FL enhancements, which yield further improvements in performance.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (3) , 4826-4841
CC-FedAvg: Computationally Customized Federated Averaging
Federated learning (FL) is an emerging paradigm to train model with distributed data from numerous Internet of Things (IoT) devices. It inherently assumes a uniform capacity among participants. However, due to different conditions such as differing energy budgets or executing parallel unrelated tasks, participants have diverse computational resources in practice. Participants with insufficient computation budgets must plan for the use of restricted computational resources appropriately; otherwise, they would be unable to complete the entire training procedure, resulting in model performance decline. To address this issue, we propose a strategy for estimating local models without computationally intensive iterations. Based on it, we propose computationally customized federated averaging (CC-FedAvg), which allows participants to determine whether to perform traditional local training or model estimation in each round based on their current computational budgets. Both theoretical analysis and exhaustive experiments indicate that CC-FedAvg has the same convergence rate and comparable performance as FedAvg without resource constraints. Furthermore, CC-FedAvg can be viewed as a computation-efficient version of FedAvg that retains model performance while considerably lowering computation overhead.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (3) , 4826-4841
CC-FedAvg: Computationally Customized Federated Averaging
Federated learning (FL) is an emerging paradigm to train model with distributed data from numerous Internet of Things (IoT) devices. It inherently assumes a uniform capacity among participants. However, due to different conditions such as differing energy budgets or executing parallel unrelated tasks, participants have diverse computational resources in practice. Participants with insufficient computation budgets must plan for the use of restricted computational resources appropriately; otherwise, they would be unable to complete the entire training procedure, resulting in model performance decline. To address this issue, we propose a strategy for estimating local models without computationally intensive iterations. Based on it, we propose computationally customized federated averaging (CC-FedAvg), which allows participants to determine whether to perform traditional local training or model estimation in each round based on their current computational budgets. Both theoretical analysis and exhaustive experiments indicate that CC-FedAvg has the same convergence rate and comparable performance as FedAvg without resource constraints. Furthermore, CC-FedAvg can be viewed as a computation-efficient version of FedAvg that retains model performance while considerably lowering computation overhead.
- 28 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 1957-1968
DiscrimLoss: A Universal Loss for Hard Samples and Incorrect Samples Discrimination
Given data with label noise (i.e., incorrect data), deep neural networks would gradually memorize the label noise and impair model performance. To relieve this issue, curriculum learning is proposed to improve model performance and generalization by ordering training samples in a meaningful (e.g., easy to hard) sequence. Previous work takes incorrect samples as generic hard ones without discriminating between hard samples (i.e., hard samples in correct data) and incorrect samples. Indeed, a model should learn from hard samples to promote generalization rather than overfit to incorrect ones. In this paper, we address this problem by appending a novel loss function DiscrimLoss , on top of the existing task loss. Its main effect is to automatically and stably estimate the importance of easy samples and difficult samples (including hard and incorrect samples) at the early stages of training to improve the model performance. Then, during the following stages, DiscrimLoss is dedicated to discriminating between hard and incorrect samples to improve the model generalization. Such a training strategy can be formulated dynamically in a self-supervised manner, effectively mimicking the main principle of curriculum learning. Experiments on image classification, image regression, text sequence regression, and event relation reasoning demonstrate the versatility and effectiveness of our method, particularly in the presence of diversified noise levels.
- 28 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 1957-1968
DiscrimLoss: A Universal Loss for Hard Samples and Incorrect Samples Discrimination
Given data with label noise (i.e., incorrect data), deep neural networks would gradually memorize the label noise and impair model performance. To relieve this issue, curriculum learning is proposed to improve model performance and generalization by ordering training samples in a meaningful (e.g., easy to hard) sequence. Previous work takes incorrect samples as generic hard ones without discriminating between hard samples (i.e., hard samples in correct data) and incorrect samples. Indeed, a model should learn from hard samples to promote generalization rather than overfit to incorrect ones. In this paper, we address this problem by appending a novel loss function DiscrimLoss , on top of the existing task loss. Its main effect is to automatically and stably estimate the importance of easy samples and difficult samples (including hard and incorrect samples) at the early stages of training to improve the model performance. Then, during the following stages, DiscrimLoss is dedicated to discriminating between hard and incorrect samples to improve the model generalization. Such a training strategy can be formulated dynamically in a self-supervised manner, effectively mimicking the main principle of curriculum learning. Experiments on image classification, image regression, text sequence regression, and event relation reasoning demonstrate the versatility and effectiveness of our method, particularly in the presence of diversified noise levels.
- Open Access
NoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing
Large-scale datasets in the real world inevitably involve label noise. Deep models can gradually overfit noisy labels and thus degrade model generalization. To mitigate the effects of label noise, learning with noisy labels (LNL) methods are designed to achieve better generalization performance. Due to the lack of suitable datasets, previous studies have frequently employed synthetic label noise to mimic real-world label noise. However, synthetic noise is not instance-dependent, making this approximation not always effective in practice. Recent research has proposed benchmarks for learning with real-world noisy labels. However, the noise sources within may be single or fuzzy, making benchmarks different from data with heterogeneous label noises in the real world. To tackle these issues, we contribute NoisywikiHow, the largest NLP benchmark built with minimal supervision. Specifically, inspired by human cognition, we explicitly construct multiple sources of label noise to imitate human errors throughout the annotation, replicating real-world noise, whose corruption is affected by both ground-truth labels and instances. Moreover, we provide a variety of noise levels to support controlled experiments on noisy data, enabling us to evaluate LNL methods systematically and comprehensively. After that, we conduct extensive multi-dimensional experiments on a broad range of LNL methods, obtaining new and intriguing findings.
Open AccessNoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing
Large-scale datasets in the real world inevitably involve label noise. Deep models can gradually overfit noisy labels and thus degrade model generalization. To mitigate the effects of label noise, learning with noisy labels (LNL) methods are designed to achieve better generalization performance. Due to the lack of suitable datasets, previous studies have frequently employed synthetic label noise to mimic real-world label noise. However, synthetic noise is not instance-dependent, making this approximation not always effective in practice. Recent research has proposed benchmarks for learning with real-world noisy labels. However, the noise sources within may be single or fuzzy, making benchmarks different from data with heterogeneous label noises in the real world. To tackle these issues, we contribute NoisywikiHow, the largest NLP benchmark built with minimal supervision. Specifically, inspired by human cognition, we explicitly construct multiple sources of label noise to imitate human errors throughout the annotation, replicating real-world noise, whose corruption is affected by both ground-truth labels and instances. Moreover, we provide a variety of noise levels to support controlled experiments on noisy data, enabling us to evaluate LNL methods systematically and comprehensively. After that, we conduct extensive multi-dimensional experiments on a broad range of LNL methods, obtaining new and intriguing findings.
- Open Access
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 4856-4873
NoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing
Tingting Wu, Xiao Ding, Minji Tang, Hao Zhang, Bing Qin, Ting Liu. Findings of the Association for Computational Linguistics: ACL 2023. 2023.
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 4856-4873
Open AccessNoisywikiHow: A Benchmark for Learning with Real-world Noisy Labels in Natural Language Processing
Tingting Wu, Xiao Ding, Minji Tang, Hao Zhang, Bing Qin, Ting Liu. Findings of the Association for Computational Linguistics: ACL 2023. 2023.