{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/lazimpa-lazy-and-impatient-neural-agents","title":"\"LazImpa\": Lazy and Impatient neural agents learn to communicate efficiently","arxiv_id":"2010.01878","date":"2020-10-05","proceeding":null,"authors":["Mathieu Rita","Rahma Chaabouni","Emmanuel Dupoux"],"abstract":"Previous work has shown that artificial neural agents naturally develop surprisingly non-efficient codes. This is illustrated by the fact that in a referential game involving a speaker and a listener neural networks optimizing accurate transmission over a discrete channel, the emergent messages fail to achieve an optimal length. Furthermore, frequent messages tend to be longer than infrequent ones, a pattern contrary to the Zipf Law of Abbreviation (ZLA) observed in all natural languages. Here, we show that near-optimal and ZLA-compatible messages can emerge, but only if both the speaker and the listener are modified. We hence introduce a new communication system, \"LazImpa\", where the speaker is made increasingly lazy, i.e. avoids long messages, and the listener impatient, i.e.,~seeks to guess the intended content as soon as possible.","url_abs":"https://arxiv.org/abs/2010.01878v1","url_pdf":"https://arxiv.org/pdf/2010.01878v1.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":"lazimpa-lazy-and-impatient-neural-agents","repo_url":"https://github.com/MathieuRita/Lazimpa","is_official":1,"mentioned_in_paper":1,"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/2010.01878","atlas_url":"https://app.syntology.ai/?focus=2010.01878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01878"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/MathieuRita/Lazimpa","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":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,"samples":[{"code_sha256_prefix":"e2719e4662b94c84","entry":"build_optimizer","repo":"MathieuRita/Lazimpa","repo_kind":"official","path":"egg/core/util.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/core/util.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e2719e4662b94c84"}},{"code_sha256_prefix":"91d0aad2cab137d2","entry":"dump_sender_receiver","repo":"MathieuRita/Lazimpa","repo_kind":"official","path":"egg/core/util.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/core/util.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"91d0aad2cab137d2"}},{"code_sha256_prefix":"3c2081da5221dfd6","entry":"init","repo":"MathieuRita/Lazimpa","repo_kind":"official","path":"egg/core/util.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/core/util.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3c2081da5221dfd6"}},{"code_sha256_prefix":"4e69343bf76117a3","entry":"parse_json_sweep","repo":"MathieuRita/Lazimpa","repo_kind":"official","path":"egg/nest/common.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/nest/common.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4e69343bf76117a3"}},{"code_sha256_prefix":"7febd697258e8673","entry":"sweep","repo":"MathieuRita/Lazimpa","repo_kind":"official","path":"egg/nest/common.py","file_url":"https://github.com/MathieuRita/Lazimpa/blob/HEAD/egg/nest/common.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7febd697258e8673"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}