paper-with-me

Papers

Arbitrarily Applicable Same/Opposite Relational Responding with NARS

2025-05-11 · Robert Johansson, Patrick Hammer, Tony Lofthouse

Same/opposite relational responding, a fundamental aspect of human symbolic cognition, allows the flexible generalization of stimulus relationships based on minimal experience. In this study, we demonstrate the emergence of \textit{arbitrarily applicable} same/opposite relational responding within the Non-Axiomatic Reasoning System (NARS), a computational cognitive architecture designed for adaptive reasoning under uncertainty. Specifically, we extend NARS with an implementation of \textit{acquired relations}, enabling the system to explicitly derive both symmetric (mutual entailment) and novel relational combinations (combinatorial entailment) from minimal explicit training in a contextually controlled matching-to-sample (MTS) procedure. Experimental results show that NARS rapidly internalizes explicitly trained relational rules and robustly demonstrates derived relational generalizations based on arbitrary contextual cues. Importantly, derived relational responding in critical test phases inherently combines both mutual and combinatorial entailments, such as deriving same-relations from multiple explicitly trained opposite-relations. Internal confidence metrics illustrate strong internalization of these relational principles, closely paralleling phenomena observed in human relational learning experiments. Our findings underscore the potential for integrating nuanced relational learning mechanisms inspired by learning psychology into artificial general intelligence frameworks, explicitly highlighting the arbitrary and context-sensitive relational capabilities modeled within NARS.

📄 PDF Abstract BibTeX arXiv:2505.07079

Code (0)

등록된 구현이 없습니다.

Tasks

Relational Reasoning

Similar Papers 제목 키워드 기반

Graph-based semi-supervised learning for relational networks

2016-12-15 · Leto Peel

We address the problem of semi-supervised learning in relational networks, networks in which nodes are entities and links are the relationships or interactions between them. Typically this problem is confounded with the …

General Classification

Learning Autoencoders with Relational Regularization

2020-02-07 · ICML 2020 1 · Hongteng Xu, Dixin Luo, Ricardo Henao, Svati Shah 외

A new algorithmic framework is proposed for learning autoencoders of data distributions. We minimize the discrepancy between the model and target distributions, with a \emph{relational regularization} on the learnable la…

MULTI-VIEW LEARNING

Learning Opposites Using Neural Networks

2016-09-16 · Shivam Kalra, Aditya Sriram, Shahryar Rahnamayan, H. R. Tizhoosh

Many research works have successfully extended algorithms such as evolutionary algorithms, reinforcement agents and neural networks using "opposition-based learning" (OBL). Two types of the "opposites" have been defined …

Evolutionary AlgorithmsVocal Bursts Type Prediction

Injecting Knowledge into Biomedical Pre-trained Models via Polymorphism and Synonymous Substitution

2023-05-24 · Hongbo Zhang, Xiang Wan, Benyou Wang

Pre-trained language models (PLMs) were considered to be able to store relational knowledge present in the training data. However, some relational knowledge seems to be discarded unsafely in PLMs due to \textbf{report bi…

Approximate Feature Collisions in Neural Nets

2019-12-01 · NeurIPS 2019 12 · Ke Li, Tianhao Zhang, Jitendra Malik

Work on adversarial examples has shown that neural nets are surprisingly sensitive to adversarially chosen changes of small magnitude. In this paper, we show the opposite: neural nets could be surprisingly insensitive to…