首页 > 最新文献
paperpass

Artificial Intelligence最新文献

英文 中文
Mitigating Data Reconstruction Attacks in Federated Learning: Conditions, Bounds, and Theoretical Guarantees 减轻联邦学习中的数据重构攻击:条件、界限和理论保证
IF 14.4 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-10-01 DOI: 10.1016/j.artint.2026.104641
Xiaojin Zhang,Mingcong Xu,Wei Chen,Qiang Yang
{"title":"Mitigating Data Reconstruction Attacks in Federated Learning: Conditions, Bounds, and Theoretical Guarantees","authors":"Xiaojin Zhang,Mingcong Xu,Wei Chen,Qiang Yang","doi":"10.1016/j.artint.2026.104641","DOIUrl":"https://doi.org/10.1016/j.artint.2026.104641","url":null,"abstract":"","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"8 1","pages":"104641"},"PeriodicalIF":14.4,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149150510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ITEACH-Net: Inverted Teacher-studEnt seArCH Network for Emotion Recognition in Conversation 面向会话情感识别的逆向师生搜索网络
IF 14.4 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-10-01 DOI: 10.1016/j.artint.2026.104643
Haiyang Sun,Zheng Lian,Chenglong Wang,Kang Chen,Licai Sun,Bin Liu,Jianhua Tao
{"title":"ITEACH-Net: Inverted Teacher-studEnt seArCH Network for Emotion Recognition in Conversation","authors":"Haiyang Sun,Zheng Lian,Chenglong Wang,Kang Chen,Licai Sun,Bin Liu,Jianhua Tao","doi":"10.1016/j.artint.2026.104643","DOIUrl":"https://doi.org/10.1016/j.artint.2026.104643","url":null,"abstract":"","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"27 1","pages":"104643"},"PeriodicalIF":14.4,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149208859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Shapley Value Computation in Ontology-Mediated Query Answering 本体中介查询应答中的Shapley值计算
IF 14.4 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-09-01 DOI: 10.1016/j.artint.2026.104619
Meghyn Bienvenu,Diego Figueira,Pierre Lafourcade
{"title":"Shapley Value Computation in Ontology-Mediated Query Answering","authors":"Meghyn Bienvenu,Diego Figueira,Pierre Lafourcade","doi":"10.1016/j.artint.2026.104619","DOIUrl":"https://doi.org/10.1016/j.artint.2026.104619","url":null,"abstract":"","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"81 1","pages":"104619"},"PeriodicalIF":14.4,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148932530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Predictable artificial intelligence 可预测的人工智能
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-30 DOI: 10.1016/j.artint.2026.104491
Lexin Zhou , Pablo A.M. Casares , Fernando Martínez-Plumed , John Burden , Ryan Burnell , Lucy Cheke , Cèsar Ferri , Alexandru Marcoci , Behzad Mehrbakhsh , Yael Moros-Daval , Seán Ó hÉigeartaigh , Danaja Rutar , Wout Schellaert , Konstantinos Voudouris , José Hernández-Orallo
{"title":"Predictable artificial intelligence","authors":"Lexin Zhou , Pablo A.M. Casares , Fernando Martínez-Plumed , John Burden , Ryan Burnell , Lucy Cheke , Cèsar Ferri , Alexandru Marcoci , Behzad Mehrbakhsh , Yael Moros-Daval , Seán Ó hÉigeartaigh , Danaja Rutar , Wout Schellaert , Konstantinos Voudouris , José Hernández-Orallo","doi":"10.1016/j.artint.2026.104491","DOIUrl":"10.1016/j.artint.2026.104491","url":null,"abstract":"","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"353 ","pages":"Article 104491"},"PeriodicalIF":4.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146089270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
One mind, many tongues: A deep dive into language-agnostic knowledge neurons in large language models 一个头脑,多种语言:深入研究大型语言模型中与语言无关的知识神经元
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-04 DOI: 10.1016/j.artint.2026.104490
Pengfei Cao , Yuheng Chen , Zhuoran Jin , Yubo Chen , Kang Liu , Jun Zhao
Large language models (LLMs) have learned vast amounts of factual knowledge through self-supervised pre-training on large-scale corpora. Meanwhile, LLMs have also demonstrated excellent multilingual capabilities, which can express the learned knowledge in multiple languages. However, the knowledge storage mechanism in LLMs still remains mysterious. Some researchers attempt to demystify the factual knowledge in LLMs from the perspective of knowledge neurons, and subsequently discover language-agnostic knowledge neurons that store factual knowledge in a form that transcends language barriers. However, the preliminary finding suffers from two limitations: 1) High Uncertainty in Localization Results. Existing study only uses a prompt-based probe to localize knowledge neurons for each fact, while LLMs cannot provide consistent answers for semantically equivalent queries. Thus, it leads to inaccurate localization results with high uncertainty. 2) Lack of Analysis in More Languages. The study only analyzes language-agnostic knowledge neurons on English and Chinese data, without exploring more language families and languages. Naturally, it limits the generalizability of the findings. To address aforementioned problems, we first construct a new benchmark called Rephrased Multilingual LAMA (RML-LAMA), which contains high-quality cloze-style multilingual parallel queries for each fact. Then, we propose a novel method named Multilingual Integrated Gradients with Uncertainty Estimation (MaTrice), which quantifies the uncertainty across queries and languages during knowledge localization. Extensive experiments show that our method can accurately localize language-agnostic knowledge neurons. We also further investigate the role of language-agnostic knowledge neurons in cross-lingual knowledge editing, knowledge enhancement and new knowledge injection.
大型语言模型(llm)通过在大规模语料库上的自我监督预训练学习了大量的事实知识。同时,法学硕士也表现出了出色的多语言能力,可以用多种语言表达所学的知识。然而,法学硕士的知识存储机制仍然是一个谜。一些研究者试图从知识神经元的角度揭开法学硕士中事实知识的神秘面纱,随后发现了以超越语言障碍的形式存储事实知识的语言不可知性知识神经元。然而,初步发现存在两个局限性:1)定位结果的不确定性高。现有研究仅使用基于提示的探针来定位每个事实的知识神经元,而llm无法为语义等价的查询提供一致的答案。因此,定位结果不准确,不确定度高。2)更多的语言缺乏分析。这项研究只分析了英语和汉语数据上的语言不可知论知识神经元,没有探索更多的语族和语言。自然,它限制了研究结果的普遍性。为了解决上述问题,我们首先构建一个名为Rephrased Multilingual LAMA (RML-LAMA)的新基准,它包含针对每个事实的高质量完形式多语言并行查询。然后,我们提出了一种新的方法——多语言集成梯度与不确定性估计(矩阵),该方法量化了知识定位过程中查询和语言之间的不确定性。大量的实验表明,我们的方法可以准确地定位语言不可知论知识神经元。我们还进一步研究了语言不可知知识神经元在跨语言知识编辑、知识增强和新知识注入中的作用。
{"title":"One mind, many tongues: A deep dive into language-agnostic knowledge neurons in large language models","authors":"Pengfei Cao ,&nbsp;Yuheng Chen ,&nbsp;Zhuoran Jin ,&nbsp;Yubo Chen ,&nbsp;Kang Liu ,&nbsp;Jun Zhao","doi":"10.1016/j.artint.2026.104490","DOIUrl":"10.1016/j.artint.2026.104490","url":null,"abstract":"<div><div>Large language models (LLMs) have learned vast amounts of factual knowledge through self-supervised pre-training on large-scale corpora. Meanwhile, LLMs have also demonstrated excellent multilingual capabilities, which can express the learned knowledge in multiple languages. However, the knowledge storage mechanism in LLMs still remains mysterious. Some researchers attempt to demystify the factual knowledge in LLMs from the perspective of knowledge neurons, and subsequently discover <em>language-agnostic knowledge neurons</em> that store factual knowledge in a form that transcends language barriers. However, the preliminary finding suffers from two limitations: 1) <em>High Uncertainty in Localization Results</em>. Existing study only uses a prompt-based probe to localize knowledge neurons for each fact, while LLMs cannot provide consistent answers for semantically equivalent queries. Thus, it leads to inaccurate localization results with high uncertainty. 2) <em>Lack of Analysis in More Languages</em>. The study only analyzes language-agnostic knowledge neurons on English and Chinese data, without exploring more language families and languages. Naturally, it limits the generalizability of the findings. To address aforementioned problems, we first construct a new benchmark called Rephrased Multilingual LAMA (<span>RML-LAMA</span>), which contains high-quality cloze-style multilingual parallel queries for each fact. Then, we propose a novel method named <em>Multilingual Integrated Gradients with Uncertainty Estimation</em> (<span>MaTrice</span>), which quantifies the uncertainty across queries and languages during knowledge localization. Extensive experiments show that our method can accurately localize language-agnostic knowledge neurons. We also further investigate the role of language-agnostic knowledge neurons in cross-lingual knowledge editing, knowledge enhancement and new knowledge injection.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"353 ","pages":"Article 104490"},"PeriodicalIF":4.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Defining defense and defeat in abstract argumentation from scratch – A generalizing approach 在抽象论证中从零开始定义辩护和失败——一种一般化的方法
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-03-01 Epub Date: 2025-12-05 DOI: 10.1016/j.artint.2025.104456
Lydia Blümel , Markus Ulbricht
We propose a general framework to investigate semantics of Dung-style argumentation frameworks (AFs) by means of a generic defeat notion formalized by refute operators.The main idea underlying our approach is that, given a refute operator δ, counter-parts to all classical semantics can be deduced in a natural way. We demonstrate how classical as well as recent proposals can be captured by our approach when utilizing suitable refute operators. In addition, we showcase how our general scheme can be employed to propose novel semantics in a systematic manner. This results in what we call cooperative semantics which stem from a novel refute operator we will introduce. We perform an in-depth investigation of basic properties of refute operators and to which extent the induced semantics inherit desirable properties from it. Among others, we show under which conditions i) a counterpart to Dung’s fundamental lemma can be inferred, ii) the generalized version of the grounded extension is unique, or iii) the generalized version of stable semantics does not collapse. Moreover, we contribute to a principle-based study of AF semantics by discussing properties tailored to assess the behavior of different refute operators. This includes an investigation of means to compare refute operators in terms of their aggressiveness. Finally, we conclude the study by reporting computational complexity results for basic reasoning tasks which hold in our general framework.
我们提出了一个通用框架,通过一个由驳斥算子形式化的通用失败概念来研究Dung-style论证框架(AFs)的语义。我们方法的主要思想是,给定一个反驳算子δ,所有经典语义的对应部分都可以以自然的方式推导出来。我们演示了在使用合适的反驳操作符时,如何通过我们的方法捕获经典和最近的建议。此外,我们展示了如何使用我们的一般方案以系统的方式提出新的语义。这导致了我们所说的合作语义,它源于我们将介绍的一个新的驳斥算子。我们对反驳算子的基本性质进行了深入的研究,并在多大程度上从它继承了诱导语义的理想性质。其中,我们证明了在哪些条件下i) Dung的基本引理的对立物可以被推断,ii)基于扩展的广义版本是唯一的,或iii)稳定语义的广义版本不坍缩。此外,我们通过讨论为评估不同驳斥算子的行为而量身定制的属性,为基于原则的AF语义研究做出了贡献。这包括一项调查的手段,比较反驳运营商在其侵略性方面。最后,我们通过报告在我们的一般框架中持有的基本推理任务的计算复杂性结果来总结研究。
{"title":"Defining defense and defeat in abstract argumentation from scratch – A generalizing approach","authors":"Lydia Blümel ,&nbsp;Markus Ulbricht","doi":"10.1016/j.artint.2025.104456","DOIUrl":"10.1016/j.artint.2025.104456","url":null,"abstract":"<div><div>We propose a general framework to investigate semantics of Dung-style argumentation frameworks (AFs) by means of a generic defeat notion formalized by <em>refute operators</em>.The main idea underlying our approach is that, given a refute operator <em>δ</em>, counter-parts to all classical semantics can be deduced in a natural way. We demonstrate how classical as well as recent proposals can be captured by our approach when utilizing suitable refute operators. In addition, we showcase how our general scheme can be employed to propose novel semantics in a systematic manner. This results in what we call <em>cooperative semantics</em> which stem from a novel refute operator we will introduce. We perform an in-depth investigation of basic properties of refute operators and to which extent the induced semantics inherit desirable properties from it. Among others, we show under which conditions i) a counterpart to Dung’s fundamental lemma can be inferred, ii) the generalized version of the grounded extension is unique, or iii) the generalized version of stable semantics does not collapse. Moreover, we contribute to a principle-based study of AF semantics by discussing properties tailored to assess the behavior of different refute operators. This includes an investigation of means to compare refute operators in terms of their aggressiveness. Finally, we conclude the study by reporting computational complexity results for basic reasoning tasks which hold in our general framework.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"352 ","pages":"Article 104456"},"PeriodicalIF":4.6,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145689754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automated planning instance generation with neuro-symbolic AI 使用神经符号AI自动规划实例生成
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-03-01 Epub Date: 2025-12-28 DOI: 10.1016/j.artint.2025.104471
Carlos Núñez-Molina , Pablo Mesejo , Juan Fernández-Olivares
In the field of Automated Planning there is often the need for a set of planning problems from a particular domain, e.g., to be used as training data for Machine Learning methods or as benchmarks in planning competitions. In most cases, these problems are created either by hand or by a domain-specific generator, putting a burden on the human designers. In this paper, we propose NeSIG (Neuro-Symbolic Instance Generator), to the best of our knowledge the first domain-independent method for automatically generating typed-STRIPS planning problems that are valid, diverse and difficult to solve. We formulate problem generation as a Markov Decision Process and train two generative policies with Deep Reinforcement Learning to generate problems with the desired properties. We conduct experiments on five classical domains, comparing our approach against handcrafted, domain-specific instance generators and various ablations. Results show NeSIG is able to automatically generate valid and diverse problems of much greater difficulty (6.8 times more on geometric average) than domain-specific generators, while simultaneously reducing human effort when compared to them. Additionally, it can generalize to problems more than twice the size of those seen during training.
在自动化规划领域,通常需要一组来自特定领域的规划问题,例如,用作机器学习方法的训练数据或作为规划竞赛的基准。在大多数情况下,这些问题要么是手工创建的,要么是由特定于领域的生成器创建的,这给人类设计人员带来了负担。在本文中,我们提出了NeSIG(神经符号实例生成器),据我们所知,这是第一个独立于领域的方法,用于自动生成有效的、多样化的、难以解决的类型条带规划问题。我们将问题生成制定为马尔可夫决策过程,并使用深度强化学习训练两个生成策略来生成具有所需属性的问题。我们在五个经典领域进行了实验,将我们的方法与手工制作的、特定于领域的实例生成器和各种消融进行了比较。结果表明,NeSIG能够自动生成比特定领域生成器难度大得多的有效和多样化的问题(几何平均难度为6.8倍),同时减少了人工工作量。此外,它可以泛化到比训练中看到的问题大一倍以上的问题。
{"title":"Automated planning instance generation with neuro-symbolic AI","authors":"Carlos Núñez-Molina ,&nbsp;Pablo Mesejo ,&nbsp;Juan Fernández-Olivares","doi":"10.1016/j.artint.2025.104471","DOIUrl":"10.1016/j.artint.2025.104471","url":null,"abstract":"<div><div>In the field of Automated Planning there is often the need for a set of planning problems from a particular domain, e.g., to be used as training data for Machine Learning methods or as benchmarks in planning competitions. In most cases, these problems are created either by hand or by a domain-specific generator, putting a burden on the human designers. In this paper, we propose NeSIG (<em>Neuro-Symbolic Instance Generator</em>), to the best of our knowledge the first domain-independent method for automatically generating typed-STRIPS planning problems that are valid, diverse and difficult to solve. We formulate problem generation as a Markov Decision Process and train two generative policies with Deep Reinforcement Learning to generate problems with the desired properties. We conduct experiments on five classical domains, comparing our approach against handcrafted, domain-specific instance generators and various ablations. Results show NeSIG is able to automatically generate valid and diverse problems of much greater difficulty (6.8 times more on geometric average) than domain-specific generators, while simultaneously reducing human effort when compared to them. Additionally, it can generalize to problems more than twice the size of those seen during training.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"352 ","pages":"Article 104471"},"PeriodicalIF":4.6,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145845507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-scale signal modulation for variational graph autoencoders 变分图自编码器的多尺度信号调制
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-03-01 Epub Date: 2026-01-15 DOI: 10.1016/j.artint.2026.104488
Junwei Cheng , Chaobo He , Pengxing Feng , Weixiong Liu , Ke Liang
Variational graph autoencoder (VGAE) has emerged as a prominent framework for graph representation learning, owing to its probabilistic modeling flexibility and expressive power. Most existing VGAE-based methods assume that the posterior distribution of node embeddings follows a Gaussian distribution and rely on graph convolutional networks with low-pass filtering properties to infer the posterior mean and variance. However, our empirical findings reveal that the variance exhibits non-stationary spectral characteristics, indicating a spectral mismatch between the variance signal and the low-pass nature of conventional inference mechanisms. Further analysis reveals a spectral asymmetry between the posterior mean and variance, as they exhibit distinct signal allocations within the node embeddings. Motivated by these insights, we propose MS-VGAE, a novel variational graph autoencoder with multi-scale signal modulation. Specifically, MS-VGAE leverages a Gabor-based wavelet network to perform fine-grained spectral convolution and signal modulation of the posterior variance across multiple frequency scales. Additionally, a compact optimization objective is derived to enable homophily-aware modulation of frequency-band contributions in the variance. To reduce the computational overhead, we develop MS-VGAEcheby, which replaces the spectral filtering operation in MS-VGAE with a Chebyshev polynomial approximation. Comprehensive experiments results demonstrate that MS-VGAE achieves satisfactory performance on both node clustering and link prediction tasks. Moreover, MS-VGAEcheby offers an efficient alternative to MS-VGAE, while maintaining comparable performance on large graphs. The code is available at https://github.com/GDM-SCNU/MS-VGAE.
变分图自编码器(VGAE)由于其概率建模的灵活性和表达能力而成为图表示学习的重要框架。现有的基于vga的方法大多假设节点嵌入的后验分布服从高斯分布,并依靠具有低通滤波特性的图卷积网络来推断后验均值和方差。然而,我们的实证研究结果表明,方差表现出非平稳的光谱特征,表明方差信号与传统推理机制的低通性质之间存在光谱失配。进一步的分析揭示了后验均值和方差之间的谱不对称,因为它们在节点嵌入中表现出不同的信号分配。基于这些见解,我们提出了MS-VGAE,一种具有多尺度信号调制的新型变分图自编码器。具体来说,MS-VGAE利用基于gabor的小波网络在多个频率尺度上执行细粒度的频谱卷积和后验方差的信号调制。此外,还推导了一个紧凑的优化目标,以实现方差中频带贡献的同态感知调制。为了减少计算开销,我们开发了MS-VGAEcheby算法,用Chebyshev多项式近似代替MS-VGAE中的频谱滤波操作。综合实验结果表明,MS-VGAE在节点聚类和链路预测任务上都取得了令人满意的性能。此外,MS-VGAEcheby提供了MS-VGAE的有效替代方案,同时在大型图形上保持相当的性能。代码可在https://github.com/GDM-SCNU/MS-VGAE上获得。
{"title":"Multi-scale signal modulation for variational graph autoencoders","authors":"Junwei Cheng ,&nbsp;Chaobo He ,&nbsp;Pengxing Feng ,&nbsp;Weixiong Liu ,&nbsp;Ke Liang","doi":"10.1016/j.artint.2026.104488","DOIUrl":"10.1016/j.artint.2026.104488","url":null,"abstract":"<div><div>Variational graph autoencoder (VGAE) has emerged as a prominent framework for graph representation learning, owing to its probabilistic modeling flexibility and expressive power. Most existing VGAE-based methods assume that the posterior distribution of node embeddings follows a Gaussian distribution and rely on graph convolutional networks with low-pass filtering properties to infer the posterior mean and variance. However, our empirical findings reveal that the variance exhibits non-stationary spectral characteristics, indicating a spectral mismatch between the variance signal and the low-pass nature of conventional inference mechanisms. Further analysis reveals a spectral asymmetry between the posterior mean and variance, as they exhibit distinct signal allocations within the node embeddings. Motivated by these insights, we propose MS-VGAE, a novel variational graph autoencoder with multi-scale signal modulation. Specifically, MS-VGAE leverages a Gabor-based wavelet network to perform fine-grained spectral convolution and signal modulation of the posterior variance across multiple frequency scales. Additionally, a compact optimization objective is derived to enable homophily-aware modulation of frequency-band contributions in the variance. To reduce the computational overhead, we develop MS-VGAE<sub><em>cheby</em></sub>, which replaces the spectral filtering operation in MS-VGAE with a Chebyshev polynomial approximation. Comprehensive experiments results demonstrate that MS-VGAE achieves satisfactory performance on both node clustering and link prediction tasks. Moreover, MS-VGAE<sub><em>cheby</em></sub> offers an efficient alternative to MS-VGAE, while maintaining comparable performance on large graphs. The code is available at <span><span>https://github.com/GDM-SCNU/MS-VGAE</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"352 ","pages":"Article 104488"},"PeriodicalIF":4.6,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145995524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SHACL validation in the presence of ontologies: Semantics and rewriting techniques 存在本体的SHACL验证:语义和重写技术
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-03-01 Epub Date: 2026-01-13 DOI: 10.1016/j.artint.2026.104483
Anouk Oudshoorn, Magdalena Ortiz, Mantas Šimkus
SHACL and OWL are two prominent W3C standards for managing RDF data. These languages share many features, but they have one fundamental difference: OWL, designed for inferring facts from incomplete data, makes the open-world assumption, whereas SHACL is a constraint language that treats the data as complete and must be validated under the closed-world assumption. The combination of both formalisms is very appealing and has been called for, but their semantic gap is a major challenge, semantically and computationally. In this paper, we advocate a semantics for SHACL validation in the presence of ontologies based on core universal models. We provide a technique for constructing these models for ontologies in the rich data-tractable description logic Horn-ALCHIQ. Furthermore, we use a finite representation of this model to develop a rewriting technique that reduces SHACL validation in the presence of ontologies to standard validation. Finally, we study the complexity of SHACL validation in the presence of ontologies, and show that even very simple ontologies make the problem ExpTime-complete, and PTime-complete in data complexity.
acl和OWL是管理RDF数据的两个重要的W3C标准。这两种语言共享许多特性,但它们有一个根本的区别:OWL设计用于从不完整的数据推断事实,采用开放世界假设,而acl是一种约束语言,将数据视为完整,必须在封闭世界假设下进行验证。这两种形式的结合是非常吸引人的,并且已经被呼吁,但是它们的语义差距是一个主要的挑战,在语义和计算上。在本文中,我们提倡在存在基于核心通用模型的本体的情况下进行SHACL验证的语义。我们提供了一种在富数据可处理描述逻辑Horn-ALCHIQ中为本体构建这些模型的技术。此外,我们使用该模型的有限表示来开发一种重写技术,该技术将存在本体时的SHACL验证减少为标准验证。最后,我们研究了存在本体时的acl验证的复杂性,并表明即使是非常简单的本体也会使数据复杂性的ExpTime-complete和PTime-complete问题。
{"title":"SHACL validation in the presence of ontologies: Semantics and rewriting techniques","authors":"Anouk Oudshoorn,&nbsp;Magdalena Ortiz,&nbsp;Mantas Šimkus","doi":"10.1016/j.artint.2026.104483","DOIUrl":"10.1016/j.artint.2026.104483","url":null,"abstract":"<div><div>SHACL and OWL are two prominent W3C standards for managing RDF data. These languages share many features, but they have one fundamental difference: OWL, designed for inferring facts from incomplete data, makes the <em>open-world assumption</em>, whereas SHACL is a constraint language that treats the data as complete and must be validated under the <em>closed-world assumption</em>. The combination of both formalisms is very appealing and has been called for, but their semantic gap is a major challenge, semantically and computationally. In this paper, we advocate a semantics for SHACL validation in the presence of ontologies based on <em>core universal models</em>. We provide a technique for constructing these models for ontologies in the rich data-tractable description logic Horn-<span><math><mi>ALCHIQ</mi></math></span>. Furthermore, we use a finite representation of this model to develop a <em>rewriting technique</em> that reduces SHACL validation in the presence of ontologies to standard validation. Finally, we study the complexity of SHACL validation in the presence of ontologies, and show that even very simple ontologies make the problem <span>ExpTime</span>-complete, and <span>PTime</span>-complete in data complexity.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"352 ","pages":"Article 104483"},"PeriodicalIF":4.6,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145962643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
LAD2025, A constraint-based solver for the subgraph isomorphism problem 基于约束的子图同构问题求解器LAD2025
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-03-01 Epub Date: 2025-12-25 DOI: 10.1016/j.artint.2025.104474
Christine Solnon
The Subgraph Isomorphism Problem (SIP) is an NP-complete problem that aims at finding a copy of a pattern graph in a target graph. It may be modelled as a constraint satisfaction problem in a very straightforward way, and exact approaches for solving SIPs usually propagate constraints to reduce the search space. In particular, PathLAD is a solver introduced in 2016 that combines Locally All Different (LAD) constraints with path-based supplemental constraints. In this paper, we introduce LAD2025, which combines a complete refactoring of PathLAD with new features: new supplemental constraints, a weight-based variable ordering heuristic, random restarts with nogood recording, a new value ordering heuristic and a rule for selecting the level of filtering.
子图同构问题(SIP)是一个np完全问题,其目的是在目标图中找到一个模式图的副本。它可以以一种非常直接的方式建模为约束满足问题,并且解决sip的精确方法通常传播约束以减少搜索空间。特别是,PathLAD是2016年推出的一款求解器,它结合了局部所有不同(local All Different, LAD)约束和基于路径的补充约束。在本文中,我们介绍了LAD2025,它结合了PathLAD的完整重构和新的特征:新的补充约束,基于权重的变量排序启发式,无良好记录的随机重启,新的值排序启发式和选择过滤级别的规则。
{"title":"LAD2025, A constraint-based solver for the subgraph isomorphism problem","authors":"Christine Solnon","doi":"10.1016/j.artint.2025.104474","DOIUrl":"10.1016/j.artint.2025.104474","url":null,"abstract":"<div><div>The Subgraph Isomorphism Problem (SIP) is an <span><math><mrow><mi>N</mi><mi>P</mi></mrow></math></span>-complete problem that aims at finding a copy of a pattern graph in a target graph. It may be modelled as a constraint satisfaction problem in a very straightforward way, and exact approaches for solving SIPs usually propagate constraints to reduce the search space. In particular, PathLAD is a solver introduced in 2016 that combines Locally All Different (LAD) constraints with path-based supplemental constraints. In this paper, we introduce LAD2025, which combines a complete refactoring of PathLAD with new features: new supplemental constraints, a weight-based variable ordering heuristic, random restarts with nogood recording, a new value ordering heuristic and a rule for selecting the level of filtering.</div></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":"352 ","pages":"Article 104474"},"PeriodicalIF":4.6,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145823168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Artificial Intelligence
全部 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