Towards machine learning as AGM-style belief change

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Theofanis Aravanis
{"title":"Towards machine learning as AGM-style belief change","authors":"Theofanis Aravanis","doi":"10.1016/j.ijar.2025.109437","DOIUrl":null,"url":null,"abstract":"<div><div>Artificial Neural Networks (ANNs) are powerful computational models that are able to reproduce complex non-linear processes, and are being widely used in a plethora of contemporary disciplines. In this article, we study the statics and dynamics of a certain class of ANNs, called binary ANNs, from the perspective of belief-change theory. A binary ANN is a feed-forward ANN whose inputs and outputs take binary values, and as such, it is suitable for a wide range of practical applications. For this type of ANNs, we point out that their knowledge (expressed via their input-output relationship) can symbolically be represented in terms of a propositional logic language. Furthermore, in the realm of belief change, we identify the process of changing (revising/contracting) an initial belief set to a modified belief set, as a process of a gradual transition of intermediate belief sets — such a gradualist approach to belief change is more congruent with the behaviors of real-world agents. Along these lines, we provide natural metrics for measuring the distance between these intermediate belief sets, effectively quantifying the disparity in their encoded knowledge. Thereafter, we demonstrate that, similar to belief change, the training process of binary ANNs, through backpropagation, can be emulated via a sequence of successive transitions of belief sets, the distance between which is intuitively related through one of the aforementioned metrics. We also prove that the alluded successive transitions of belief sets can be modeled by means of rational revision and contraction operators, defined within the fundamental belief-change framework of Alchourrón, Gärdenfors and Makinson (AGM). Thus, the process of machine learning (specifically, training binary ANNs) is framed as an operation of AGM-style belief change, offering a modular and logically structured perspective on neural learning.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"183 ","pages":"Article 109437"},"PeriodicalIF":3.2000,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25000787","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Artificial Neural Networks (ANNs) are powerful computational models that are able to reproduce complex non-linear processes, and are being widely used in a plethora of contemporary disciplines. In this article, we study the statics and dynamics of a certain class of ANNs, called binary ANNs, from the perspective of belief-change theory. A binary ANN is a feed-forward ANN whose inputs and outputs take binary values, and as such, it is suitable for a wide range of practical applications. For this type of ANNs, we point out that their knowledge (expressed via their input-output relationship) can symbolically be represented in terms of a propositional logic language. Furthermore, in the realm of belief change, we identify the process of changing (revising/contracting) an initial belief set to a modified belief set, as a process of a gradual transition of intermediate belief sets — such a gradualist approach to belief change is more congruent with the behaviors of real-world agents. Along these lines, we provide natural metrics for measuring the distance between these intermediate belief sets, effectively quantifying the disparity in their encoded knowledge. Thereafter, we demonstrate that, similar to belief change, the training process of binary ANNs, through backpropagation, can be emulated via a sequence of successive transitions of belief sets, the distance between which is intuitively related through one of the aforementioned metrics. We also prove that the alluded successive transitions of belief sets can be modeled by means of rational revision and contraction operators, defined within the fundamental belief-change framework of Alchourrón, Gärdenfors and Makinson (AGM). Thus, the process of machine learning (specifically, training binary ANNs) is framed as an operation of AGM-style belief change, offering a modular and logically structured perspective on neural learning.
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest. Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning. Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信