Yueqi Xie, Tao Qi, Jingwei Yi, Xiyuan Yang, Ryan Whalen, Junming Huang, Qian Ding, Yu Xie, Xing Xie, Fangzhao Wu. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.

The task of predicting product quality in injection molding aims to forecast quality based on the manufacturing process parameters. Previous works have gravitated toward constructing ANFIS model integrated with heuristic algorithms to relocate the model to the optimal position. However, this constrains the model's own capacity for learning by relying on the heuristic algorithm and depends on time-consuming and costly industrial data. To address these issues, we pro pose an Evolution-ANFIS (EANFIS) framework incorporating the KL-Divergence diffusion model, Self-Evolutionary Search (SES), Neuron Evolutionary Iteration (NEI) and Space Pre Optimization (SPO) modules. Our method is divided into two parts: data generation and model learning. The KL-Divergence diffusion model aligns the distribution between pseudo-sample and original-sample to complete the first stage. The latter stage utilizes multiple ANFIS sub-models and enables these models to autonomously learn deep representations through diverse strategies. Specifically, SES facilitates deep-level feature extraction by employing arc-length strategy to steer sub-models toward optimal feature representations. Furthermore, NEI and SPO are proposed to prevent learning bias, which assists each sub model in escaping suboptimal dilemmas and focuses on learning fine-grained feature mapping. Extensive experiments validate the superiority of our EANFIS approach, even outperforming certain machine learning counterparts. The code is available at https://github.com/hejk/EANFIS.

Automated annotation of electronic medical records for patients with cerebral palsy (CP) is crucial for downstream clinical applications. However, most existing methods lack mechanisms to verify model predictions before their acceptance and suffer from labeled data scarcity. To address this challenge, we propose a Deep Cooperative Learning for Automated Annotation (DCLA) framework. DCLA integrates named entity recognition (NER) and relation extraction (RE) models that employ the multi-head attention mechanism and the global pointer to handle complex entities and relations. Building on this foundation, a cooperative learning (CL) mechanism is introduced to evaluate prediction quality through score matrices for sample ranking and selection. Low-quality predictions are verified by annotators, while high-quality predictions are accepted automatically, enabling iterative retraining with cooperatively labeled data. Experiments on a CP-specific corpus demonstrate that DCLA's NER and RE models outperform state-of-the-art methods, while the CL mechanism enhances proofreading efficiency. Overall, DCLA enhances proofreading efficiency, mitigates data scarcity, and supports continuous model refinement.

Personalized Federated Learning (PFL) is primarily de-signed to provide customized models for each client to better fit the non-iid distributed client data, which is a inherent challenge in Federated Learning. However, current PFL methods suffer from inconsistencies in both intra-client and inter-client levels: 1) The intra-client inconsistency stems from the asynchronous update strategy for personalized and shared parameters. In PFL, clients update their shared parameters to communicate and learn from others, while keeping personalized parts unchanged, leading to poor coordination between these two components. 2) The Inter-client inconsistency arises from “stragglers” - inactive clients that communicate and train with the server less frequently. This results in their under-trained personalized models and impedes the collaborative training stage for other clients. In this paper, we present a novel PFL framework named FedAS, which uses Federated Parameter-Alignment and Client-Synchronization to overcome above challenges. Initially, we enhance the localization of global parameters by infusing them with local insights. We make the shared parts learn from previous model, thereby increasing their local relevance and reducing the impact of parameter inconsistency. Furthermore, we design a robust aggregation method to mitigate the impact of stragglers by preventing the incorporation of their under-trained knowledge into aggregated model. Experimental results on CifarlO and CifarlOO validate the effectiveness of our FedAS in achieving better performance and robustness against data heterogeneity.

Model heterogeneous federated learning is a realistic and challenging problem. However, due to the limitations of data collection, storage, and transmission conditions, as well as the existence of free-rider participants, the clients may suffer from data corruption. This paper starts the first attempt to investigate the problem of data corruption in the model heterogeneous federated learning framework. We design a novel method named Augmented Heterogeneous Federated Learning (AugHFL), which consists of two stages: 1) In the local update stage, a corruption-robust data augmentation strategy is adopted to minimize the adverse effects of local corruption while enabling the models to learn rich local knowledge. 2) In the collaborative update stage, we design a robust re-weighted communication approach, which implements communication between heterogeneous models while mitigating corrupted knowledge transfer from others. Extensive experiments demonstrate the effectiveness of our method in coping with various corruption patterns in the model heterogeneous federated learning setting.

Unsupervised domain adaptive person re-identification has garnered considerable attention due to its practical significance. Previous research has focused on utilizing the teacher-student framework within the clustering and fine-tuning paradigm to reduce the domain gap between different person re-identification datasets. Building upon these recent advancements, we propose a novel approach to further explore the structural information of the teacher and student networks from multiple perspectives, including adaptive sample updating, global feature arrangement, and local discrepancy learning. By integrating these three components, we introduce the Adaptive Structure Learning Framework (ASL) for unsupervised domain adaptive person re-identification. Compared to the baseline method, our approach achieves a significant improvement of 7.3% in mean Average Precision (mAP) on the Market2MSMT task. Furthermore, our experimental results across three benchmark datasets provide further evidence of the effectiveness of our proposed method.

Personalized federated learning with differential privacy has been considered a feasible solution to address non-IID distribution of data and privacy leakage risks. However, current personalized federated learning methods suffer from inflexible personalization and convergence difficulties due to two main factors: 1) Firstly, we observe that the prevailing personalization methods mainly achieve this by personalizing a fixed portion of the model, which lacks flexibility. 2) Moreover, we further demonstrate that the default gradient calculation is sensitive to the widely-used clipping operations in differential privacy, resulting in difficulties in convergence. Considering that Fisher information values can serve as an effective measure for estimating the information content of parameters by reflecting the model sensitivity to parameters, we aim to leverage this property to address the aforementioned challenges. In this paper, we propose a novel federated learning method with Dynamic Fisher Personalization and Adaptive Constraint (FedDPA) to handle these challenges. Firstly, by using layer-wise Fisher information to measure the information content of local parameters, we retain local parameters with high Fisher values during the personalization process, which are considered informative, simultaneously prevent these parameters from noise perturbation. Secondly, we introduce an adaptive approach by applying differential constraint strategies to personalized parameters and shared parameters identified in the previous for better convergence. Our method boosts performance through flexible personalization while mitigating the slow convergence caused by clipping operations. Experimental results on CIFAR-10, FEMNIST and SVHN dataset demonstrate the effectiveness of our approach in achieving better performance and robustness against clipping, under personalized federated learning with differential privacy.

Xiyuan Yang, Xiaotao Gu, Sheng Lin, Siliang Tang, Yueting Zhuang, Fei Wu, Zhigang Chen, Guoping Hu, Xiang Ren. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.

Object detection methods fall into two categories, i.e., two-stage and single-stage detectors. The former is characterized by high detection accuracy while the latter usually has a considerable inference speed. Hence, it is imperative to fuse their merits for a better accuracy vs. speed trade-off. To this end, we propose a dual refinement network (DRN) to boost the performance of the single-stage detector. Inheriting from the advantages of two-stage approaches (i.e., two-step regression and accurate features for detection), anchor refinement and feature offset refinement are conducted in a novel anchor-offset detection, where the detection head is comprised of deformable convolutions. Moreover, to leverage contextual information for describing objects, we design a multi-deformable head, in which multiple detection paths with different receptive field sizes devote themselves to detecting objects. Extensive experiments on PASCAL VOC and ImageNet VID datasets are conducted, and we achieve a state-of-the-art detection performance in terms of both accuracy and inference speed.