Pith. sign in

REVIEW 3 cited by

Probabilistic Reasoning via Deep Learning: Neural Association Models

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 1603.07704 v2 pith:INF7AHH4 submitted 2016-03-24 cs.AI cs.LGcs.NE

classification cs.AIcs.LGcs.NE
keywords neuralreasoningmodelmodelsassociationdeepnetworksprobabilistic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper, we propose a new deep learning approach, called neural association model (NAM), for probabilistic reasoning in artificial intelligence. We propose to use neural networks to model association between any two events in a domain. Neural networks take one event as input and compute a conditional probability of the other event to model how likely these two events are to be associated. The actual meaning of the conditional probabilities varies between applications and depends on how the models are trained. In this work, as two case studies, we have investigated two NAM structures, namely deep neural networks (DNN) and relation-modulated neural nets (RMNN), on several probabilistic reasoning tasks in AI, including recognizing textual entailment, triple classification in multi-relational knowledge bases and commonsense reasoning. Experimental results on several popular datasets derived from WordNet, FreeBase and ConceptNet have all demonstrated that both DNNs and RMNNs perform equally well and they can significantly outperform the conventional methods available for these reasoning tasks. Moreover, compared with DNNs, RMNNs are superior in knowledge transfer, where a pre-trained model can be quickly extended to an unseen relation after observing only a few training samples. To further prove the effectiveness of the proposed models, in this work, we have applied NAMs to solving challenging Winograd Schema (WS) problems. Experiments conducted on a set of WS problems prove that the proposed models have the potential for commonsense reasoning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Symbolic Knowledge Extraction and Injection with Sub-symbolic Predictors: A Systematic Literature Review

    cs.AI 2025-01 conditional novelty 6.0 of 10

    A systematic literature review of 132 symbolic knowledge extraction and 117 symbolic knowledge injection methods, with taxonomies and a survey of available software.

  2. A Survey of Task-Oriented Knowledge Graph Reasoning: Status, Applications, and Prospects

    cs.AI 2025-04 conditional novelty 4.0 of 10

    A task-oriented survey of knowledge graph reasoning, covering six task categories, benchmark datasets, downstream applications, and future challenges.

  3. Advancing Reasoning in Large Language Models: Promising Methods and Approaches

    cs.CL 2025-02 conditional

    A survey that categorizes existing LLM reasoning techniques into prompting, architectural, and learning-based approaches, without contributing new results.

Pith tools