Pith. sign in

REVIEW 2 cited by

Probabilistic Abduction for Visual Abstract Reasoning via Learning Rules in Vector-symbolic Architectures

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.16024 v1 pith:DDXMFBPL submitted 2024-01-29 cs.LG cs.AI

classification cs.LGcs.AI
keywords abstractreasoningapproacharchitecturesdataformulationsintelligencelearn-vrf
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Abstract reasoning is a cornerstone of human intelligence, and replicating it with artificial intelligence (AI) presents an ongoing challenge. This study focuses on efficiently solving Raven's progressive matrices (RPM), a visual test for assessing abstract reasoning abilities, by using distributed computation and operators provided by vector-symbolic architectures (VSA). Instead of hard-coding the rule formulations associated with RPMs, our approach can learn the VSA rule formulations (hence the name Learn-VRF) with just one pass through the training data. Yet, our approach, with compact parameters, remains transparent and interpretable. Learn-VRF yields accurate predictions on I-RAVEN's in-distribution data, and exhibits strong out-of-distribution capabilities concerning unseen attribute-rule pairs, significantly outperforming pure connectionist baselines including large language models. Our code is available at https://github.com/IBM/learn-vector-symbolic-architectures-rule-formulations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Systematic Abductive Reasoning via Diverse Relation Representations in Vector-symbolic Architecture

    cs.AI 2025-01 conditional novelty 5.0 of 10

    Rel-SAR, a vector-symbolic architecture with numeric, circular, and boolean vectors, improves accuracy on Raven's Progressive Matrices, particularly for position-based rules.

  2. Gram-Space: Structure-Preserving Codebook Compression for Memory-Efficient Neuro-Symbolic AI

    cs.LG 2026-08 reject novelty 3.0 of 10

    Projecting a codebook into its own M-dimensional orthonormal basis does not compress it when the basis is stored, so the claimed 15.75x memory reduction is not supported.

Pith tools