首页 > 最新文献
paperpass

Applied Soft Computing最新文献

英文 中文
Bi-directional distillation enabling progressive lightweight model training in edge computing-based federated learning 双向蒸馏,在基于边缘计算的联邦学习中实现渐进式轻量级模型训练
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-22 DOI: 10.1016/j.asoc.2026.114712
Yishan Chen , Wenshuo Dai , Zhen Qin , Junxiao Han
Wireless Federated Learning (FL) has emerged as a promising paradigm for enabling collaborative intelligence in edge computing while preserving data privacy by exchanging model parameters instead of raw data. However, deploying large-scale models remains challenging due to the limited computational resources and constrained communication bandwidth of edge devices. To address this issue, the paper proposes a Bi-Directional Distillation-Driven Hierarchical Framework (BDH-LM) that enables Progressive Lightweight Model Training across edge and cloud. Central to our framework is the Streamline Teacher Network (STN) algorithm, which progressively compresses the network size by generating a series of compact student models that replace large-scale models without significant performance degradation. A bi-directional knowledge distillation mechanism is established to facilitate mutual knowledge exchange between the cloud and edge models, thereby reducing the computational burden on cloud servers while preserving user privacy on edge devices. To further minimize communication overhead, a data-value-aware selection strategy is introduced to identify and transfer only the most informative samples. Moreover, we formulate a joint optimization problem that considers energy and latency constraints, optimizing pruning ratios, CPU frequencies, uplink power, and bandwidth allocation to accelerate the training process under resource limitations. Finally, experiments conducted on CIFAR-10, CIFAR-100, and SVHN datasets further validate the theoretical results.
无线联邦学习(FL)已经成为一种很有前途的范例,可以在边缘计算中实现协作智能,同时通过交换模型参数而不是原始数据来保护数据隐私。然而,由于边缘设备的计算资源有限和通信带宽受限,部署大规模模型仍然具有挑战性。为了解决这个问题,本文提出了一个双向蒸馏驱动的分层框架(BDH-LM),该框架支持跨边缘和云的渐进式轻量级模型训练。我们的框架的核心是精简教师网络(STN)算法,该算法通过生成一系列紧凑的学生模型来逐步压缩网络大小,这些模型可以取代大规模模型,而不会显著降低性能。建立双向知识蒸馏机制,促进云和边缘模型之间的相互知识交换,从而减少云服务器的计算负担,同时保护边缘设备上的用户隐私。为了进一步减少通信开销,引入了数据值感知选择策略,以识别和传输信息量最大的样本。此外,我们制定了一个考虑能量和延迟约束的联合优化问题,优化剪枝比、CPU频率、上行功率和带宽分配,以加速资源限制下的训练过程。最后,在CIFAR-10、CIFAR-100和SVHN数据集上进行的实验进一步验证了理论结果。
{"title":"Bi-directional distillation enabling progressive lightweight model training in edge computing-based federated learning","authors":"Yishan Chen ,&nbsp;Wenshuo Dai ,&nbsp;Zhen Qin ,&nbsp;Junxiao Han","doi":"10.1016/j.asoc.2026.114712","DOIUrl":"10.1016/j.asoc.2026.114712","url":null,"abstract":"<div><div>Wireless Federated Learning (FL) has emerged as a promising paradigm for enabling collaborative intelligence in edge computing while preserving data privacy by exchanging model parameters instead of raw data. However, deploying large-scale models remains challenging due to the limited computational resources and constrained communication bandwidth of edge devices. To address this issue, the paper proposes a Bi-Directional Distillation-Driven Hierarchical Framework (BDH-LM) that enables Progressive Lightweight Model Training across edge and cloud. Central to our framework is the Streamline Teacher Network (STN) algorithm, which progressively compresses the network size by generating a series of compact student models that replace large-scale models without significant performance degradation. A bi-directional knowledge distillation mechanism is established to facilitate mutual knowledge exchange between the cloud and edge models, thereby reducing the computational burden on cloud servers while preserving user privacy on edge devices. To further minimize communication overhead, a data-value-aware selection strategy is introduced to identify and transfer only the most informative samples. Moreover, we formulate a joint optimization problem that considers energy and latency constraints, optimizing pruning ratios, CPU frequencies, uplink power, and bandwidth allocation to accelerate the training process under resource limitations. Finally, experiments conducted on CIFAR-10, CIFAR-100, and SVHN datasets further validate the theoretical results.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114712"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
HQML-NLP: A hybrid quantum machine learning framework for scholarly AI-text detection HQML-NLP:用于学术人工智能文本检测的混合量子机器学习框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114634
Layth Rafea Hazim , Oguz Ata
The swift growth of the gargantuan language models has made it even harder to tell apart writings done by humans and AI especially in academia which led to the need for the setup of trustworthy detection frameworks that will satisfactorily balance accuracy, interpretability, and efficiency. In this paper, we walk you through the HQML-NLP, a detection system using a hybrid quantum-classical machine learning framework for the detection of AI-generated academic content. The system onboard the merging of Sentence-BERT semantic embeddings with quantum feature encoding that is supported by a 6-qubit, two-layer parameterized quantum circuit, thus resulting in a 390-dimensional hybrid representation which is classified through a lightweight multilayer perceptron. The framework has been tested on three benchmark datasets AI-GA, HWAI, and HAGT-1M to check its scalability and generalization to different academic writing situations. The results of the experiments show the framework has consistent and good discriminative capability achieving AUROC scores of more than 0.96 on all datasets and excellent performance (AUROC = 1.000, ACC = 99.98 %) on the large-scale data. Moreover, probability calibration by means of temperature scaling raises the trustworthiness of predicted confidence scores, leading to a 60 % reduction in the Expected Calibration Error (ECE) and without affecting the performance of the discrimination. When compared against the transformer-based and ensemble-learning detectors, HQML-NLP comes out with an equivalent and competitive detection accuracy and calibration quality yet demands more than 2000× less trainable parameters. These findings imply that hybrid quantum-classical representations act as an effective and compact alternative for the detection of AI-text in scholarly journals.
庞大的语言模型的迅速发展使得区分人类和人工智能的作品变得更加困难,特别是在学术界,这导致需要建立可信的检测框架,以令人满意地平衡准确性、可解释性和效率。在本文中,我们将向您介绍HQML-NLP,这是一种使用混合量子经典机器学习框架来检测人工智能生成的学术内容的检测系统。该系统将Sentence-BERT语义嵌入与量子特征编码合并,该编码由6量子位、两层参数化量子电路支持,从而产生390维混合表示,并通过轻量级多层感知器进行分类。该框架在AI-GA、HWAI和HAGT-1M三个基准数据集上进行了测试,以检验其在不同学术写作情况下的可扩展性和泛化性。实验结果表明,该框架具有一致性和良好的判别能力,在所有数据集上AUROC得分均在0.96以上,在大规模数据上表现优异(AUROC = 1.000, ACC = 99.98 %)。此外,通过温度标度的概率校准提高了预测置信度分数的可信度,导致预期校准误差(ECE)降低60 %,而不影响判别的性能。与基于变压器和集成学习的检测器相比,HQML-NLP具有同等且具有竞争力的检测精度和校准质量,但需要的可训练参数要少2000倍以上。这些发现表明,混合量子经典表示作为一种有效而紧凑的替代方法,可用于检测学术期刊中的人工智能文本。
{"title":"HQML-NLP: A hybrid quantum machine learning framework for scholarly AI-text detection","authors":"Layth Rafea Hazim ,&nbsp;Oguz Ata","doi":"10.1016/j.asoc.2026.114634","DOIUrl":"10.1016/j.asoc.2026.114634","url":null,"abstract":"<div><div>The swift growth of the gargantuan language models has made it even harder to tell apart writings done by humans and AI especially in academia which led to the need for the setup of trustworthy detection frameworks that will satisfactorily balance accuracy, interpretability, and efficiency. In this paper, we walk you through the HQML-NLP, a detection system using a hybrid quantum-classical machine learning framework for the detection of AI-generated academic content. The system onboard the merging of Sentence-BERT semantic embeddings with quantum feature encoding that is supported by a 6-qubit, two-layer parameterized quantum circuit, thus resulting in a 390-dimensional hybrid representation which is classified through a lightweight multilayer perceptron. The framework has been tested on three benchmark datasets AI-GA, HWAI, and HAGT-1M to check its scalability and generalization to different academic writing situations. The results of the experiments show the framework has consistent and good discriminative capability achieving AUROC scores of more than 0.96 on all datasets and excellent performance (AUROC = 1.000, ACC = 99.98 %) on the large-scale data. Moreover, probability calibration by means of temperature scaling raises the trustworthiness of predicted confidence scores, leading to a 60 % reduction in the Expected Calibration Error (ECE) and without affecting the performance of the discrimination. When compared against the transformer-based and ensemble-learning detectors, HQML-NLP comes out with an equivalent and competitive detection accuracy and calibration quality yet demands more than 2000× less trainable parameters. These findings imply that hybrid quantum-classical representations act as an effective and compact alternative for the detection of AI-text in scholarly journals.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114634"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiscale personalized federated load forecasting via enhanced ensemble empirical mode decomposition and Bayesian long short-term memory network 基于增强集成经验模态分解和贝叶斯长短期记忆网络的多尺度个性化联邦负荷预测
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-28 DOI: 10.1016/j.asoc.2026.114707
Yang Liu , Yingchun Wang
To enhance the personalized modeling capability of federated learning under non-independent and identically distributed (Non-IID) conditions, this study proposes a multiscale personalized federated framework for load forecasting. The framework employs a dual-model architecture that achieves “global trend sharing” and “local feature modeling,” effectively balancing collaboration and personalization across heterogeneous clients. At the data level, an enhanced ensemble empirical mode decomposition (E-EEMD) with paired noise cancellation and adaptive amplitude control is developed to suppress mode mixing and residual noise. A three-dimensional classification criterion integrating zero-crossing rate, Pearson correlation, and variance contribution enables adaptive component identification and multiscale feature extraction. At the model level, an enhanced Bayesian long short-term memory network (B-LSTM) incorporates temporal representation and uncertainty quantification, supporting confidence-weighted aggregation within federated learning. Experimental results across multiple regions verify that the proposed framework consistently outperforms conventional approaches in forecasting accuracy, robustness, and privacy preservation.
为了增强联邦学习在非独立同分布(非iid)条件下的个性化建模能力,本研究提出了一种多尺度的负荷预测个性化联邦框架。该框架采用双模型架构,实现了“全局趋势共享”和“局部特征建模”,有效地平衡了跨异构客户端的协作和个性化。在数据层面,提出了一种增强的集成经验模态分解(E-EEMD)方法,结合配对噪声抵消和自适应幅度控制来抑制模态混合和残余噪声。基于零交叉率、Pearson相关性和方差贡献的三维分类标准实现了自适应成分识别和多尺度特征提取。在模型层面,增强的贝叶斯长短期记忆网络(B-LSTM)结合了时间表征和不确定性量化,支持联邦学习中的置信度加权聚合。跨多个区域的实验结果验证了所提出的框架在预测准确性、鲁棒性和隐私保护方面始终优于传统方法。
{"title":"Multiscale personalized federated load forecasting via enhanced ensemble empirical mode decomposition and Bayesian long short-term memory network","authors":"Yang Liu ,&nbsp;Yingchun Wang","doi":"10.1016/j.asoc.2026.114707","DOIUrl":"10.1016/j.asoc.2026.114707","url":null,"abstract":"<div><div>To enhance the personalized modeling capability of federated learning under non-independent and identically distributed (Non-IID) conditions, this study proposes a multiscale personalized federated framework for load forecasting. The framework employs a dual-model architecture that achieves “global trend sharing” and “local feature modeling,” effectively balancing collaboration and personalization across heterogeneous clients. At the data level, an enhanced ensemble empirical mode decomposition (E-EEMD) with paired noise cancellation and adaptive amplitude control is developed to suppress mode mixing and residual noise. A three-dimensional classification criterion integrating zero-crossing rate, Pearson correlation, and variance contribution enables adaptive component identification and multiscale feature extraction. At the model level, an enhanced Bayesian long short-term memory network (B-LSTM) incorporates temporal representation and uncertainty quantification, supporting confidence-weighted aggregation within federated learning. Experimental results across multiple regions verify that the proposed framework consistently outperforms conventional approaches in forecasting accuracy, robustness, and privacy preservation.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114707"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards maritime safety with industrial multimodal models: Compliance reasoning from heterogeneous maritime data 用工业多式联运模型实现海上安全:基于异构海事数据的符合性推理
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-27 DOI: 10.1016/j.asoc.2026.114701
Shen Wang , Kejun Wu , Renjie Qiao , Runtian Wang , Chengtao Cai
The advancement of Industrial Large Models offers significant potential for enhancing intelligence and automation within specialized industrial sectors. This paper addresses the maritime industry, a critical domain where ensuring safety and regulatory compliance demands robust understanding and reasoning over complex, heterogeneous data types. Traditional methods often lack the necessary interpretability and generalization capabilities for dynamic maritime environments. To overcome these limitations, we introduce a novel framework leveraging an Industrial Large Model approach for behavioral compliance reasoning. Our methodology utilizes a transformer-based large multimodal model adept at processing diverse industrial maritime data, specifically remote sensing imagery (Synthetic Aperture Radar) and structured navigational records (Automatic Identification System). The system features two core contributions: (1) a large-scale dataset constructed with diverse maritime scenarios, integrating high-resolution visual data, structured metadata, and natural language descriptions tailored for industrial maritime contexts; and (2) a transformer-based vision-language model fine-tuned on this dataset to jointly perform vessel detection, identification, and behavioral compliance assessment—tasks crucial for industrial maritime operations. To improve the model’s reasoning depth and align with the requirements for trustworthy Artificial Intelligence in industrial settings, we incorporate Chain-of-Thought prompting, facilitating transparent, step-by-step decision-making processes. Extensive experiments validate our model’s high accuracy, interpretability, and generalization capabilities in complex operational settings, significantly enhancing anomaly detection and supporting reliable maritime safety decisions. This study underscores the capability of Industrial Large Models to interpret complex multimodal industrial data for enhanced maritime situational awareness, providing a practical illustration of adapting foundational models for safety-critical and regulatory compliance tasks, thereby advancing the understanding and application of large model technology within specialized industrial sectors.
工业大型模型的进步为提高专业工业部门的智能化和自动化提供了巨大的潜力。本文讨论了海运业,这是一个关键领域,确保安全和法规遵从性需要对复杂的异构数据类型进行强大的理解和推理。对于动态海洋环境,传统方法往往缺乏必要的可解释性和泛化能力。为了克服这些限制,我们引入了一个利用工业大模型方法进行行为遵从性推理的新框架。我们的方法利用基于变压器的大型多模态模型,擅长处理各种工业海事数据,特别是遥感图像(合成孔径雷达)和结构化导航记录(自动识别系统)。该系统有两个核心贡献:(1)由不同海事场景构建的大规模数据集,集成了高分辨率视觉数据、结构化元数据和针对工业海事环境量身定制的自然语言描述;(2)基于变压器的视觉语言模型在此数据集上进行微调,以联合执行船舶检测、识别和行为合规评估,这些任务对工业海上作业至关重要。为了提高模型的推理深度,并与工业环境中值得信赖的人工智能的要求保持一致,我们结合了思维链提示,促进透明,逐步的决策过程。大量的实验验证了我们的模型在复杂操作环境中的高精度、可解释性和泛化能力,显著增强了异常检测并支持可靠的海上安全决策。本研究强调了工业大型模型解释复杂多模态工业数据的能力,以增强海上态势感知,为安全关键和监管合规任务调整基础模型提供了一个实际的例证,从而促进了大型模型技术在专业工业部门的理解和应用。
{"title":"Towards maritime safety with industrial multimodal models: Compliance reasoning from heterogeneous maritime data","authors":"Shen Wang ,&nbsp;Kejun Wu ,&nbsp;Renjie Qiao ,&nbsp;Runtian Wang ,&nbsp;Chengtao Cai","doi":"10.1016/j.asoc.2026.114701","DOIUrl":"10.1016/j.asoc.2026.114701","url":null,"abstract":"<div><div>The advancement of Industrial Large Models offers significant potential for enhancing intelligence and automation within specialized industrial sectors. This paper addresses the maritime industry, a critical domain where ensuring safety and regulatory compliance demands robust understanding and reasoning over complex, heterogeneous data types. Traditional methods often lack the necessary interpretability and generalization capabilities for dynamic maritime environments. To overcome these limitations, we introduce a novel framework leveraging an Industrial Large Model approach for behavioral compliance reasoning. Our methodology utilizes a transformer-based large multimodal model adept at processing diverse industrial maritime data, specifically remote sensing imagery (Synthetic Aperture Radar) and structured navigational records (Automatic Identification System). The system features two core contributions: (1) a large-scale dataset constructed with diverse maritime scenarios, integrating high-resolution visual data, structured metadata, and natural language descriptions tailored for industrial maritime contexts; and (2) a transformer-based vision-language model fine-tuned on this dataset to jointly perform vessel detection, identification, and behavioral compliance assessment—tasks crucial for industrial maritime operations. To improve the model’s reasoning depth and align with the requirements for trustworthy Artificial Intelligence in industrial settings, we incorporate Chain-of-Thought prompting, facilitating transparent, step-by-step decision-making processes. Extensive experiments validate our model’s high accuracy, interpretability, and generalization capabilities in complex operational settings, significantly enhancing anomaly detection and supporting reliable maritime safety decisions. This study underscores the capability of Industrial Large Models to interpret complex multimodal industrial data for enhanced maritime situational awareness, providing a practical illustration of adapting foundational models for safety-critical and regulatory compliance tasks, thereby advancing the understanding and application of large model technology within specialized industrial sectors.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114701"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A generalized multi-agent deep reinforcement learning framework for enhancing resilience and energy management in smart grids 一种增强智能电网弹性和能量管理的广义多智能体深度强化学习框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-06 DOI: 10.1016/j.asoc.2026.114793
Pandia Rajan Jeyaraj, Siva Prakash Asokan, Aravind Chellachi Kathiresan, Edward Rajan Samuel Nadar
With the integration of advanced computational algorithms and communication technologies, the smart grid functions as a Cyber-Physical System (CPS), making it vulnerable to cyber-attacks. Enhancing resilience is essential to mitigate these attacks, reduce outages, ensure secure operation, and maintain optimal power dispatch. This research proposes a cyber-constrained Multi-Agent Deep Reinforcement Learning (MADRL) framework for smart grids with distributed renewable energy sources, integrated with cyber-attack mitigation capabilities. The proposed MADRL algorithm enhances security and voltage stability by forming dynamic microgrids using data-driven Markov Decision Processes. It minimizes communication delays by avoiding congestion at non-cooperative nodes through constraint-based monitoring. To counter cyber intrusions, MADRL enables adaptive microgrid formation and learns to detect and respond to attacks through cyber-constrained training. The effectiveness of the proposed approach is validated on the IEEE 300-bus system under various outage and attack scenarios. Real-time simulations on IBM ILOG CPLEX optimization studio demonstrate its capability for online decision-making and resilience enhancement. Results confirm that the MADRL algorithm significantly improves smart grid reliability and security during cyber threats.
智能电网集成了先进的计算算法和通信技术,具有信息物理系统(CPS)的功能,容易受到网络攻击。增强弹性对于减轻这些攻击、减少停电、确保安全运行和保持最佳电力调度至关重要。本研究提出了一个网络约束的多智能体深度强化学习(MADRL)框架,用于具有分布式可再生能源的智能电网,并集成了网络攻击缓解能力。MADRL算法利用数据驱动的马尔可夫决策过程形成动态微电网,提高了系统的安全性和电压稳定性。它通过基于约束的监控来避免非合作节点的拥塞,从而最大限度地减少通信延迟。为了对抗网络入侵,MADRL实现了自适应微电网的形成,并通过网络约束训练学习检测和响应攻击。在IEEE 300总线系统中,在各种中断和攻击场景下验证了该方法的有效性。在IBM ILOG CPLEX优化工作室上进行的实时仿真验证了其在线决策和弹性增强的能力。结果表明,MADRL算法显著提高了智能电网在网络威胁下的可靠性和安全性。
{"title":"A generalized multi-agent deep reinforcement learning framework for enhancing resilience and energy management in smart grids","authors":"Pandia Rajan Jeyaraj,&nbsp;Siva Prakash Asokan,&nbsp;Aravind Chellachi Kathiresan,&nbsp;Edward Rajan Samuel Nadar","doi":"10.1016/j.asoc.2026.114793","DOIUrl":"10.1016/j.asoc.2026.114793","url":null,"abstract":"<div><div>With the integration of advanced computational algorithms and communication technologies, the smart grid functions as a Cyber-Physical System (CPS), making it vulnerable to cyber-attacks. Enhancing resilience is essential to mitigate these attacks, reduce outages, ensure secure operation, and maintain optimal power dispatch. This research proposes a cyber-constrained Multi-Agent Deep Reinforcement Learning (MADRL) framework for smart grids with distributed renewable energy sources, integrated with cyber-attack mitigation capabilities. The proposed MADRL algorithm enhances security and voltage stability by forming dynamic microgrids using data-driven Markov Decision Processes. It minimizes communication delays by avoiding congestion at non-cooperative nodes through constraint-based monitoring. To counter cyber intrusions, MADRL enables adaptive microgrid formation and learns to detect and respond to attacks through cyber-constrained training. The effectiveness of the proposed approach is validated on the IEEE 300-bus system under various outage and attack scenarios. Real-time simulations on IBM ILOG CPLEX optimization studio demonstrate its capability for online decision-making and resilience enhancement. Results confirm that the MADRL algorithm significantly improves smart grid reliability and security during cyber threats.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114793"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A dual-strategy multi-objective evolutionary algorithm with domain-informed mutation and secondary weighted selection for counterfactual explanations in knowledge tracing 基于领域知情突变和二次加权选择的知识追溯反事实解释双策略多目标进化算法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114777
Lu Gao , Xin Yuan , Xiaoxuan Shen , Jianwen Sun
Deep learning-based knowledge tracing (DLKT) models enhance personalized learning with strong predictions. However, their black-box nature hinders educational use, raising concerns about transparency and trust. To address this issue, this paper proposes a dual-strategy multiobjective evolutionary algorithm (DSMOEA) for counterfactual explanation, aimed at providing effective post hoc interpretations of DLKT predictions. Leveraging causal reasoning, DSMOEA avoids spurious correlations and generates actionable counterfactuals by constructing a tutoring-oriented framework that yields optimal, concise practice sequences to enhance future learning gains. We formulate the counterfactual generation task as a multi-objective optimization problem and solve it with a MOEA. Two strategies improve efficiency and quality: domain-informed mutation (DIM) guides solution generation, and secondary weighted selection (SWS) ranks Pareto candidates by educational relevance. Experiments demonstrate superior effectiveness and sparsity over baselines, delivering reliable counterfactuals and actionable guidance for learning path optimization.
基于深度学习的知识跟踪(DLKT)模型通过强大的预测增强了个性化学习。然而,它们的黑箱性质阻碍了教育用途,引发了对透明度和信任的担忧。为了解决这一问题,本文提出了一种用于反事实解释的双策略多目标进化算法(DSMOEA),旨在为DLKT预测提供有效的事后解释。利用因果推理,DSMOEA通过构建一个面向辅导的框架来避免虚假的相关性,并生成可操作的反事实,该框架产生最佳的、简洁的练习序列,以提高未来的学习收益。我们将反事实生成任务描述为一个多目标优化问题,并用MOEA求解。两种策略提高了效率和质量:领域信息突变(DIM)指导解生成,二次加权选择(SWS)根据教育相关性对Pareto候选进行排序。实验证明了在基线上优越的有效性和稀疏性,为学习路径优化提供了可靠的反事实和可操作的指导。
{"title":"A dual-strategy multi-objective evolutionary algorithm with domain-informed mutation and secondary weighted selection for counterfactual explanations in knowledge tracing","authors":"Lu Gao ,&nbsp;Xin Yuan ,&nbsp;Xiaoxuan Shen ,&nbsp;Jianwen Sun","doi":"10.1016/j.asoc.2026.114777","DOIUrl":"10.1016/j.asoc.2026.114777","url":null,"abstract":"<div><div>Deep learning-based knowledge tracing (DLKT) models enhance personalized learning with strong predictions. However, their black-box nature hinders educational use, raising concerns about transparency and trust. To address this issue, this paper proposes a dual-strategy multiobjective evolutionary algorithm (DSMOEA) for counterfactual explanation, aimed at providing effective post hoc interpretations of DLKT predictions. Leveraging causal reasoning, DSMOEA avoids spurious correlations and generates actionable counterfactuals by constructing a tutoring-oriented framework that yields optimal, concise practice sequences to enhance future learning gains. We formulate the counterfactual generation task as a multi-objective optimization problem and solve it with a MOEA. Two strategies improve efficiency and quality: domain-informed mutation (DIM) guides solution generation, and secondary weighted selection (SWS) ranks Pareto candidates by educational relevance. Experiments demonstrate superior effectiveness and sparsity over baselines, delivering reliable counterfactuals and actionable guidance for learning path optimization.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114777"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Intuitionistic fuzzy-valued Choquet operator: theoretical foundations and application to aggregation tasks 直觉模糊值Choquet算子:理论基础及其在聚合任务中的应用
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114751
Michał Boczek , Marek Kaluszka , Paweł Karczmarek , Alicja Żmudzińska , Albert Rachwał , Michał Dolecki
Aggregation function plays a fundamental role in decision-making problems involving incomplete information. In particular, the intuitionistic fuzzy-valued Choquet operator (IFC - operator), based on an Archimedean t-norm, provides a flexible and powerful framework for modeling interactions among criteria in intuitionistic fuzzy environments. Previous studies have mainly focused on examining whether the IFC - operator satisfies the axioms of an aggregation function for selected Archimedean t-norms. In the paper, we present a complete characterization that allows one to determine whether the IFC - operator qualifies as an aggregation function under a fixed total order. To achieve this, we establish a general theoretical framework that characterizes the conditions under which a generalized Choquet-like operator of the form F(xσ(1),…,xσ(n),μ(Bσ(1)),…,μ(Bσ(n))) satisfies the axioms of aggregation functions given a fixed total order, where the values xσ(i) are taken from an arbitrary linearly ordered set and (Bσ(i)) forms a monotonicity family of subsets of {1,…,n}. We also present some applications of the IFC - operator to combine the results of individual classifiers in the multi-class problems. We show that the IFC - operator can be effectively applied to the multi-class problems as the aggregation function to combine the results of individual classifiers. Extensive numerical experiments confirmed the effectiveness of the proposed method, which achieved high accuracy and consistently outperformed the Choquet integral as well as individual classifiers.
聚集函数在不完全信息决策问题中起着重要的作用。特别是,基于阿基米德t范数的直觉模糊值Choquet算子(IFC -算子)为在直觉模糊环境中建模准则之间的相互作用提供了一个灵活而强大的框架。以往的研究主要集中在检验IFC -算子是否满足对选定的阿基米德t-范数的聚合函数的公理。在本文中,我们提出了一个完整的表征,使人们能够确定IFC -算子是否符合固定总顺序下的聚合函数。为了达到这个目的,我们建立了一个一般的理论框架,描述了形式为F(xσ(1),…,xσ(n),μ(Bσ(1)),…,μ(Bσ(n))的广义类choquet算子满足给定固定总阶的聚集函数公理的条件,其中值xσ(i)取自任意线性有序集合,并且(Bσ(i))形成{1,…,n}的子集的单调性族。我们还介绍了IFC算子在多类问题中结合单个分类器结果的一些应用。结果表明,IFC -算子可以作为聚合函数有效地应用于多类问题,将各个分类器的结果组合在一起。大量的数值实验证实了该方法的有效性,该方法取得了较高的准确率,并且始终优于Choquet积分和单个分类器。
{"title":"Intuitionistic fuzzy-valued Choquet operator: theoretical foundations and application to aggregation tasks","authors":"Michał Boczek ,&nbsp;Marek Kaluszka ,&nbsp;Paweł Karczmarek ,&nbsp;Alicja Żmudzińska ,&nbsp;Albert Rachwał ,&nbsp;Michał Dolecki","doi":"10.1016/j.asoc.2026.114751","DOIUrl":"10.1016/j.asoc.2026.114751","url":null,"abstract":"<div><div>Aggregation function plays a fundamental role in decision-making problems involving incomplete information. In particular, the intuitionistic fuzzy-valued Choquet operator (IFC - operator), based on an Archimedean <span><math><mi>t</mi></math></span>-norm, provides a flexible and powerful framework for modeling interactions among criteria in intuitionistic fuzzy environments. Previous studies have mainly focused on examining whether the IFC - operator satisfies the axioms of an aggregation function for selected Archimedean <span><math><mi>t</mi></math></span>-norms. In the paper, we present a complete characterization that allows one to determine whether the IFC - operator qualifies as an aggregation function under a fixed total order. To achieve this, we establish a general theoretical framework that characterizes the conditions under which a generalized Choquet-like operator of the form <span><math><mrow><mtext>F</mtext></mrow><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>σ</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>σ</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></msub><mo>,</mo><mi>μ</mi><mo>(</mo><msub><mi>B</mi><mrow><mi>σ</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></msub><mo>)</mo><mo>,</mo><mo>…</mo><mo>,</mo><mi>μ</mi><mo>(</mo><msub><mi>B</mi><mrow><mi>σ</mi><mo>(</mo><mi>n</mi><mo>)</mo></mrow></msub><mo>)</mo><mo>)</mo></math></span> satisfies the axioms of aggregation functions given a fixed total order, where the values <span><math><msub><mrow><mi>x</mi></mrow><mrow><mi>σ</mi><mo>(</mo><mi>i</mi><mo>)</mo></mrow></msub></math></span> are taken from an arbitrary linearly ordered set and <span><math><mo>(</mo><msub><mi>B</mi><mrow><mi>σ</mi><mo>(</mo><mi>i</mi><mo>)</mo></mrow></msub><mo>)</mo></math></span> forms a monotonicity family of subsets of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></math></span>. We also present some applications of the IFC - operator to combine the results of individual classifiers in the multi-class problems. We show that the IFC - operator can be effectively applied to the multi-class problems as the aggregation function to combine the results of individual classifiers. Extensive numerical experiments confirmed the effectiveness of the proposed method, which achieved high accuracy and consistently outperformed the Choquet integral as well as individual classifiers.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114751"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A rate-distortion optimal evolutionary algorithm under the fixed bit-rate constraints for the JPEG quantization table optimization 一种固定比特率约束下的JPEG量化表优化的率失真优化进化算法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-28 DOI: 10.1016/j.asoc.2026.114697
Qijun Wang , Hongyan Wei , Ke Xu , Bo Du , Xingyi Zhang
JPEG has been widely utilized across diverse applications and devices for approximately 30 years, and it will continue to dominate the image ecosystem for an extended duration. Optimizing the quantization table in JPEG compression not only maintains compatibility with the JPEG standard but also enhances compression efficiency, which is crucial for image storage and transmission. Existing Evolutionary Algorithm (EA) based optimization of JPEG quantization tables primarily focuses on optimizing the luminance quantization tables, but the optimization cannot be tailored for specified bit-rates. To address this problem, this paper proposes a rate-distortion optimal evolutionary algorithm with fixed bit-rates for the JPEG quantization table optimization, which optimizes the quantization tables through a co-evolutionary algorithm with two populations: one with bit-rate constraints and the other without any constraints, adopting the rate-distortion optimal principle based population update and different environmental selection strategies for each population. The two populations are evolved simultaneously and cooperate with each other to achieve better optimization performance. Experimental results on classical benchmark datasets demonstrate that our method can achieve the better quantization tables than current state-of-the-art algorithms in both compression efficiency and image quality while more accurate target bit-rate for JPEG compression can also be achieved through our method.
JPEG已经在不同的应用程序和设备中被广泛使用了大约30年,并且它将在更长的时间内继续主导图像生态系统。对JPEG压缩中的量化表进行优化,不仅保持了与JPEG标准的兼容性,而且提高了压缩效率,对图像的存储和传输至关重要。现有的基于进化算法(EA)的JPEG量化表优化主要集中在亮度量化表的优化上,但无法针对特定的比特率进行优化。针对这一问题,本文提出了一种固定比特率的JPEG量化表优化率失真优化进化算法,该算法采用基于率失真优化原理的种群更新和不同种群的环境选择策略,采用有比特率约束和无比特率约束两种种群的协同进化算法对量化表进行优化。两个种群同时进化并相互协作以获得更好的优化性能。在经典基准数据集上的实验结果表明,我们的方法在压缩效率和图像质量上都比目前最先进的算法得到更好的量化表,并且可以获得更精确的JPEG压缩目标比特率。
{"title":"A rate-distortion optimal evolutionary algorithm under the fixed bit-rate constraints for the JPEG quantization table optimization","authors":"Qijun Wang ,&nbsp;Hongyan Wei ,&nbsp;Ke Xu ,&nbsp;Bo Du ,&nbsp;Xingyi Zhang","doi":"10.1016/j.asoc.2026.114697","DOIUrl":"10.1016/j.asoc.2026.114697","url":null,"abstract":"<div><div>JPEG has been widely utilized across diverse applications and devices for approximately 30 years, and it will continue to dominate the image ecosystem for an extended duration. Optimizing the quantization table in JPEG compression not only maintains compatibility with the JPEG standard but also enhances compression efficiency, which is crucial for image storage and transmission. Existing Evolutionary Algorithm (EA) based optimization of JPEG quantization tables primarily focuses on optimizing the luminance quantization tables, but the optimization cannot be tailored for specified bit-rates. To address this problem, this paper proposes a rate-distortion optimal evolutionary algorithm with fixed bit-rates for the JPEG quantization table optimization, which optimizes the quantization tables through a co-evolutionary algorithm with two populations: one with bit-rate constraints and the other without any constraints, adopting the rate-distortion optimal principle based population update and different environmental selection strategies for each population. The two populations are evolved simultaneously and cooperate with each other to achieve better optimization performance. Experimental results on classical benchmark datasets demonstrate that our method can achieve the better quantization tables than current state-of-the-art algorithms in both compression efficiency and image quality while more accurate target bit-rate for JPEG compression can also be achieved through our method.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114697"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ODPL: An objective-driven decomposed policy learning framework for urban autonomous driving control 面向城市自动驾驶控制的目标驱动分解策略学习框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114781
Lizhi Bi , Bin Shuai , Zhanru Liu , Yichen Sun , Feiyu Yang
In urban driving (UD) environments, deep reinforcement learning (DRL) demonstrates superior adaptability for autonomous driving control. However, fundamental challenges remain unsolved in existing DRL methods: error accumulation in Actor-Critic architectures, inconsistent learning signals from hand-crafted reward functions, and signal confusion in multi-dimensional control tasks. This paper proposes an Objective-Driven Decomposed Policy Learning (ODPL) framework for reliable urban autonomous driving control. The framework deconstructs the traditional reinforcement learning paradigm by eliminating Critic networks and directly utilizing driving-specific objectives as learning signals, thereby improving learning efficiency and accelerating convergence. ODPL employs a task decomposition strategy that decouples steering and throttle control into independent subtasks, resolving the signal confusion problem inherent in unified network architectures. Furthermore, to address credit assignment issues caused by physical delays, ODPL integrates a delay-aware state transition model that establishes precise causal relationships between current states and historical actions through a delay buffering mechanism. Simulation results in the CARLA environment demonstrate that the proposed ODPL framework achieves 70%–110% performance improvements over advanced baseline methods across various driving scenarios. The framework exhibits exceptional performance in complex curve scenarios while maintaining stable learning convergence under cold-start conditions without pre-training data.
在城市驾驶(UD)环境中,深度强化学习(DRL)对自动驾驶控制表现出优越的适应性。然而,在现有的DRL方法中,基本的挑战仍然没有得到解决:Actor-Critic架构中的错误积累、手工制作的奖励函数中不一致的学习信号,以及多维控制任务中的信号混淆。提出了一种目标驱动分解策略学习(ODPL)框架,用于城市自动驾驶的可靠控制。该框架通过消除Critic网络并直接利用特定驱动目标作为学习信号来解构传统的强化学习范式,从而提高学习效率并加速收敛。ODPL采用任务分解策略,将转向和油门控制解耦为独立的子任务,解决了统一网络架构中固有的信号混淆问题。此外,为了解决由物理延迟引起的信用分配问题,ODPL集成了一个延迟感知状态转换模型,该模型通过延迟缓冲机制在当前状态和历史行为之间建立了精确的因果关系。CARLA环境中的仿真结果表明,在各种驾驶场景中,与先进的基线方法相比,所提出的ODPL框架实现了70%-110%的性能改进。该框架在没有预训练数据的冷启动条件下保持稳定的学习收敛性,同时在复杂曲线场景中表现出优异的性能。
{"title":"ODPL: An objective-driven decomposed policy learning framework for urban autonomous driving control","authors":"Lizhi Bi ,&nbsp;Bin Shuai ,&nbsp;Zhanru Liu ,&nbsp;Yichen Sun ,&nbsp;Feiyu Yang","doi":"10.1016/j.asoc.2026.114781","DOIUrl":"10.1016/j.asoc.2026.114781","url":null,"abstract":"<div><div>In urban driving (UD) environments, deep reinforcement learning (DRL) demonstrates superior adaptability for autonomous driving control. However, fundamental challenges remain unsolved in existing DRL methods: error accumulation in Actor-Critic architectures, inconsistent learning signals from hand-crafted reward functions, and signal confusion in multi-dimensional control tasks. This paper proposes an Objective-Driven Decomposed Policy Learning (ODPL) framework for reliable urban autonomous driving control. The framework deconstructs the traditional reinforcement learning paradigm by eliminating Critic networks and directly utilizing driving-specific objectives as learning signals, thereby improving learning efficiency and accelerating convergence. ODPL employs a task decomposition strategy that decouples steering and throttle control into independent subtasks, resolving the signal confusion problem inherent in unified network architectures. Furthermore, to address credit assignment issues caused by physical delays, ODPL integrates a delay-aware state transition model that establishes precise causal relationships between current states and historical actions through a delay buffering mechanism. Simulation results in the CARLA environment demonstrate that the proposed ODPL framework achieves 70%–110% performance improvements over advanced baseline methods across various driving scenarios. The framework exhibits exceptional performance in complex curve scenarios while maintaining stable learning convergence under cold-start conditions without pre-training data.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114781"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MTCCM: A multi-task conflict control model for Web API recommendation with semantic enhancement MTCCM:一个用于Web API推荐的多任务冲突控制模型,带有语义增强
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114749
Kezhou Chen , Hongbin Zhang , Zhengming Chen , Lianglun Cheng , Xu Lu
With the rapid growth of web application programming interfaces (Web APIs), mashup development has emerged as a key paradigm that integrates existing APIs to meet the complex needs of various applications. The increasing number of Web APIs complicates selection and reduces development efficiency, while deep learning-based recommendation methods struggle with data sparsity and unstructured inputs. Multi-task learning (MTL) offers a promising solution by leveraging related tasks; however, many existing approaches fail to account for task conflicts, thereby limiting their effectiveness. We propose a multi-task conflict control model (MTCCM) for Web API recommendation to address these issues, integrating three synergistic modules. The semantic enhancement module (SEM) leverages a large language model with prompt-based inputs to structure unorganized mashups and Web API descriptions, enhancing semantic representation and mitigating issues with unstructured data. The conflict control module (CCM) operates in two stages: task conflict analysis identifies optimal auxiliary tasks, and gradient conflict control refines training by adjusting the direction of conflicting gradients. The neural network module (NNM) adopts a shared architecture with two task-specific outputs: one for Web API prediction and the other for Web API classification, which serves as an auxiliary task to improve the primary prediction performance. Extensive experiments demonstrate that MTCCM significantly outperforms state-of-the-art baselines, establishing a new benchmark in multi-task Web API recommendation.
随着web应用程序编程接口(web api)的快速增长,mashup开发已经成为集成现有api以满足各种应用程序复杂需求的关键范例。越来越多的Web api使选择复杂化并降低了开发效率,而基于深度学习的推荐方法则与数据稀疏性和非结构化输入相斗争。多任务学习(MTL)通过利用相关任务提供了一个有前途的解决方案;然而,许多现有的方法没有考虑到任务冲突,从而限制了它们的有效性。我们提出了一个多任务冲突控制模型(MTCCM)用于Web API推荐来解决这些问题,该模型集成了三个协同模块。语义增强模块(SEM)利用具有基于提示输入的大型语言模型来构建无组织的mashup和Web API描述,从而增强语义表示并减轻非结构化数据的问题。冲突控制模块(CCM)分为两个阶段:任务冲突分析识别最优辅助任务,梯度冲突控制通过调整冲突梯度的方向来细化训练。神经网络模块(NNM)采用共享架构,具有两个特定任务的输出:一个用于Web API预测,另一个用于Web API分类,作为辅助任务来提高主预测性能。大量的实验表明,MTCCM显著优于最先进的基线,为多任务Web API推荐建立了一个新的基准。
{"title":"MTCCM: A multi-task conflict control model for Web API recommendation with semantic enhancement","authors":"Kezhou Chen ,&nbsp;Hongbin Zhang ,&nbsp;Zhengming Chen ,&nbsp;Lianglun Cheng ,&nbsp;Xu Lu","doi":"10.1016/j.asoc.2026.114749","DOIUrl":"10.1016/j.asoc.2026.114749","url":null,"abstract":"<div><div>With the rapid growth of web application programming interfaces (Web APIs), mashup development has emerged as a key paradigm that integrates existing APIs to meet the complex needs of various applications. The increasing number of Web APIs complicates selection and reduces development efficiency, while deep learning-based recommendation methods struggle with data sparsity and unstructured inputs. Multi-task learning (MTL) offers a promising solution by leveraging related tasks; however, many existing approaches fail to account for task conflicts, thereby limiting their effectiveness. We propose a multi-task conflict control model (MTCCM) for Web API recommendation to address these issues, integrating three synergistic modules. The semantic enhancement module (SEM) leverages a large language model with prompt-based inputs to structure unorganized mashups and Web API descriptions, enhancing semantic representation and mitigating issues with unstructured data. The conflict control module (CCM) operates in two stages: task conflict analysis identifies optimal auxiliary tasks, and gradient conflict control refines training by adjusting the direction of conflicting gradients. The neural network module (NNM) adopts a shared architecture with two task-specific outputs: one for Web API prediction and the other for Web API classification, which serves as an auxiliary task to improve the primary prediction performance. Extensive experiments demonstrate that MTCCM significantly outperforms state-of-the-art baselines, establishing a new benchmark in multi-task Web API recommendation.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114749"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Applied Soft Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1