{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/probabilistic-reasoning-via-deep-learning","title":"Probabilistic Reasoning via Deep Learning: Neural Association Models","arxiv_id":"1603.07704","date":"2016-03-24","proceeding":null,"authors":["Quan Liu","Hui Jiang","Andrew Evdokimov","Zhen-Hua Ling","Xiaodan Zhu","Si Wei","Yu Hu"],"abstract":"In this paper, we propose a new deep learning approach, called neural\nassociation model (NAM), for probabilistic reasoning in artificial\nintelligence. We propose to use neural networks to model association between\nany two events in a domain. Neural networks take one event as input and compute\na conditional probability of the other event to model how likely these two\nevents are to be associated. The actual meaning of the conditional\nprobabilities varies between applications and depends on how the models are\ntrained. In this work, as two case studies, we have investigated two NAM\nstructures, namely deep neural networks (DNN) and relation-modulated neural\nnets (RMNN), on several probabilistic reasoning tasks in AI, including\nrecognizing textual entailment, triple classification in multi-relational\nknowledge bases and commonsense reasoning. Experimental results on several\npopular datasets derived from WordNet, FreeBase and ConceptNet have all\ndemonstrated that both DNNs and RMNNs perform equally well and they can\nsignificantly outperform the conventional methods available for these reasoning\ntasks. Moreover, compared with DNNs, RMNNs are superior in knowledge transfer,\nwhere a pre-trained model can be quickly extended to an unseen relation after\nobserving only a few training samples. To further prove the effectiveness of\nthe proposed models, in this work, we have applied NAMs to solving challenging\nWinograd Schema (WS) problems. Experiments conducted on a set of WS problems\nprove that the proposed models have the potential for commonsense reasoning.","url_abs":"http://arxiv.org/abs/1603.07704v2","url_pdf":"http://arxiv.org/pdf/1603.07704v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"natural-language-inference","task_name":"Natural Language Inference"},{"task_slug":"natural-language-understanding","task_name":"Natural Language Understanding"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"},{"task_slug":"triple-classification","task_name":"Triple Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/natural-language-understanding-on-pdp60","task":"Natural Language Understanding","dataset":"PDP60","model":"USSM + Cause-Effect Knowledge Base","rank_in_archive_order":11,"of":13,"metrics":{"Accuracy":"55.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.07704","atlas_url":"https://app.syntology.ai/?focus=1603.07704","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1603.07704"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.07704\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.07704"},"call":"get_concepts_for_paper(arxiv_id=\"1603.07704\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"419bd117aae4ec5cd7c29b00cc970a2f26c14f5d089caf638d398980da0ac058","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}