{"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/neural-amortized-inference-for-nested-multi","title":"Neural Amortized Inference for Nested Multi-agent Reasoning","arxiv_id":"2308.11071","date":"2023-08-21","proceeding":null,"authors":["Kunal Jha","Tuan Anh Le","Chuanyang Jin","Yen-Ling Kuo","Joshua B. Tenenbaum","Tianmin Shu"],"abstract":"Multi-agent interactions, such as communication, teaching, and bluffing, often rely on higher-order social inference, i.e., understanding how others infer oneself. Such intricate reasoning can be effectively modeled through nested multi-agent reasoning. Nonetheless, the computational complexity escalates exponentially with each level of reasoning, posing a significant challenge. However, humans effortlessly perform complex social inferences as part of their daily lives. To bridge the gap between human-like inference capabilities and computational limitations, we propose a novel approach: leveraging neural networks to amortize high-order social inference, thereby expediting nested multi-agent reasoning. We evaluate our method in two challenging multi-agent interaction domains. The experimental results demonstrate that our method is computationally efficient while exhibiting minimal degradation in accuracy.","url_abs":"https://arxiv.org/abs/2308.11071v1","url_pdf":"https://arxiv.org/pdf/2308.11071v1.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":[{"paper_slug":"neural-amortized-inference-for-nested-multi","repo_url":"https://github.com/KJha02/AmortizedNestedReasoning","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2308.11071","atlas_url":"https://app.syntology.ai/?focus=2308.11071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11071"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2308.11071"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2308.11071"},"call":"get_harvested_code_for_paper(arxiv_id=\"2308.11071\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2308.11071"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2308.11071\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2308.11071"},"call":"get_concepts_for_paper(arxiv_id=\"2308.11071\")"}],"by_repo":[{"repo":"KJha02/AmortizedNestedReasoning","kind":"official","samples":10,"ran":8,"instrument":0,"unverified":2}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2308.11071.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2308.11071.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/KJha02/AmortizedNestedReasoning","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":8,"unverified":2},"n_samples":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":10,"ran":8,"n_ran_checked":8,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":8,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"b7f32e53dd138e62","code_sha256_prefix":"b7f32e53dd138e62","entry":"KL","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/accuracyViewer.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/accuracyViewer.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"gt_distrib:ndarray/1/float, approx_distrib:ndarray/1/float","fixture_out_type":"float64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"b7f32e53dd138e62"},"code_page":"/code/kl","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b7f32e53dd138e62"}},{"code_sha256":"d2bffbbb4b3517ad","code_sha256_prefix":"d2bffbbb4b3517ad","entry":"avg_KL","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/accuracyViewer.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/accuracyViewer.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"gt_distribs:ndarray/2/float, approx_distribs:ndarray/2/float","fixture_out_type":"float64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d2bffbbb4b3517ad"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d2bffbbb4b3517ad"}},{"code_sha256":"97486dfe3a8b8d21","code_sha256_prefix":"97486dfe3a8b8d21","entry":"color_rgb","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/graphics.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/graphics.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"r:int/0/int, g:int/0/int, b:int/0/int","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"97486dfe3a8b8d21"}},{"code_sha256":"657bcb7c245e9d6f","code_sha256_prefix":"657bcb7c245e9d6f","entry":"get_config_name","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/car_utils/network.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/car_utils/network.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"args:Args/0/?","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"657bcb7c245e9d6f"}},{"code_sha256":"7f3bd4d6b585ad79","code_sha256_prefix":"7f3bd4d6b585ad79","entry":"get_corrected_log_weight","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/reasoning_about_car_L0.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/reasoning_about_car_L0.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"log_weights:ndarray/1/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"7f3bd4d6b585ad79"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7f3bd4d6b585ad79"}},{"code_sha256":"2644c2fd692a5c0e","code_sha256_prefix":"2644c2fd692a5c0e","entry":"numberCorrect","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/accuracyViewer.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/accuracyViewer.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"predictions:Tensor/2/float, target:Tensor/1/int","fixture_out_type":"float","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2644c2fd692a5c0e"}},{"code_sha256":"46d082a51094b915","code_sha256_prefix":"46d082a51094b915","entry":"onSegment","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/geometry.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/geometry.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"p:Point/0/?, q:Point/0/?, r:Point/0/?","fixture_out_type":"bool","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"46d082a51094b915"}},{"code_sha256":"7b23f2ea2f888664","code_sha256_prefix":"7b23f2ea2f888664","entry":"orientation","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/geometry.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/geometry.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"p:Point/0/?, q:Point/0/?, r:Point/0/?","fixture_out_type":"int","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7b23f2ea2f888664"}},{"code_sha256":"c4601ed1507b2962","code_sha256_prefix":"c4601ed1507b2962","entry":"expand_batch","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/car_utils/network.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/car_utils/network.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c4601ed1507b2962"}},{"code_sha256":"b270670148e673b6","code_sha256_prefix":"b270670148e673b6","entry":"expand_vec","repo":"KJha02/AmortizedNestedReasoning","repo_kind":"official","path":"CARLO/car_utils/network.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/car_utils/network.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b270670148e673b6"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"eed87ba1cd77a35863f084d26edbc07dba0a476856ede7ee97510defbdcf57a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}