{"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/tallyqa-answering-complex-counting-questions","title":"TallyQA: Answering Complex Counting Questions","arxiv_id":"1810.12440","date":"2018-10-29","proceeding":null,"authors":["Manoj Acharya","Kushal Kafle","Christopher Kanan"],"abstract":"Most counting questions in visual question answering (VQA) datasets are\nsimple and require no more than object detection. Here, we study algorithms for\ncomplex counting questions that involve relationships between objects,\nattribute identification, reasoning, and more. To do this, we created TallyQA,\nthe world's largest dataset for open-ended counting. We propose a new algorithm\nfor counting that uses relation networks with region proposals. Our method lets\nrelation networks be efficiently used with high-resolution imagery. It yields\nstate-of-the-art results compared to baseline and recent systems on both\nTallyQA and the HowMany-QA benchmark.","url_abs":"http://arxiv.org/abs/1810.12440v2","url_pdf":"http://arxiv.org/pdf/1810.12440v2.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":"tallyqa-answering-complex-counting-questions","repo_url":"https://github.com/manoja328/tallyqacode","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"object-counting","task_name":"Object Counting"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":null,"task_name":"Relation"},{"task_slug":"visual-question-answering-1","task_name":"Visual Question Answering"},{"task_slug":"visual-question-answering","task_name":"Visual Question Answering (VQA)"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[],"datasets_introduced":[{"slug":"tallyqa","name":"TallyQA","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/object-counting-on-howmany-qa","task":"Object Counting","dataset":"HowMany-QA","model":"RCN","rank_in_archive_order":3,"of":3,"metrics":{"Accuracy":"60.3","RMSE":"2.35"},"uses_additional_data":false},{"leaderboard":"/sota/object-counting-on-tallyqa-complex","task":"Object Counting","dataset":"TallyQA-Complex","model":"RCN","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy":"56.2","RMSE":"1.43"},"uses_additional_data":false},{"leaderboard":"/sota/object-counting-on-tallyqa-simple","task":"Object Counting","dataset":"TallyQA-Simple","model":"RCN","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy":"71.8","RMSE":"1.13"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1810.12440","atlas_url":"https://app.syntology.ai/?focus=1810.12440","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":"1810.12440"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1810.12440\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1810.12440"},"call":"get_concepts_for_paper(arxiv_id=\"1810.12440\")"}],"by_repo":[{"repo":"manoja328/tallyqacode","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"78465797fe38f301b91d845edd27eccd1fe3c2d254636210c183da778c4309b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}