{"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/hadamard-product-for-low-rank-bilinear","title":"Hadamard Product for Low-rank Bilinear Pooling","arxiv_id":"1610.04325","date":"2016-10-14","proceeding":null,"authors":["Jin-Hwa Kim","Kyoung-Woon On","Woosang Lim","Jeonghee Kim","Jung-Woo Ha","Byoung-Tak Zhang"],"abstract":"Bilinear models provide rich representations compared with linear models.\nThey have been applied in various visual tasks, such as object recognition,\nsegmentation, and visual question-answering, to get state-of-the-art\nperformances taking advantage of the expanded representations. However,\nbilinear representations tend to be high-dimensional, limiting the\napplicability to computationally complex tasks. We propose low-rank bilinear\npooling using Hadamard product for an efficient attention mechanism of\nmultimodal learning. We show that our model outperforms compact bilinear\npooling in visual question-answering tasks with the state-of-the-art results on\nthe VQA dataset, having a better parsimonious property.","url_abs":"http://arxiv.org/abs/1610.04325v4","url_pdf":"http://arxiv.org/pdf/1610.04325v4.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":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/jnhwkim/MulLowBiVQA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"torch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/Adam1679/mutan-article-net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/Cadene/vqa.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/facebookresearch/ParlAI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/gabegrand/adversarial-vqa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/jnhwkim/nips-mrn-vqa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/vuhoangminh/vqa_medical","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/yikang-li/iqan","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/MindSpore-scientific-2/code-10/tree/main/PR_Product","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/MindSpore-scientific-2/code-8/tree/main/PR_Product","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"hadamard-product-for-low-rank-bilinear","repo_url":"https://github.com/MindSpore-scientific/code-8/tree/main/PR_Product","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"visual-question-answering-1","task_name":"Visual Question Answering"},{"task_slug":"visual-question-answering","task_name":"Visual Question Answering (VQA)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.04325","atlas_url":"https://app.syntology.ai/?focus=1610.04325","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":"1610.04325"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.04325\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.04325"},"call":"get_concepts_for_paper(arxiv_id=\"1610.04325\")"}],"by_repo":[{"repo":"jnhwkim/MulLowBiVQA","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Adam1679/mutan-article-net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Cadene/vqa.pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"facebookresearch/ParlAI","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2212.07919"],"harvested_for_calls":[{"arxiv_id":"2212.07919","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2212.07919"},"call":"get_harvested_code_for_paper(arxiv_id=\"2212.07919\")"}]},{"repo":"gabegrand/adversarial-vqa","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1906.08430"],"harvested_for_calls":[{"arxiv_id":"1906.08430","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.08430"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.08430\")"}]},{"repo":"jnhwkim/nips-mrn-vqa","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vuhoangminh/vqa_medical","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yikang-li/iqan","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-scientific-2/code-10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2412.06329"],"harvested_for_calls":[{"arxiv_id":"2412.06329","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.06329"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.06329\")"}]},{"repo":"MindSpore-scientific-2/code-8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2307.16372"],"harvested_for_calls":[{"arxiv_id":"2307.16372","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.16372"},"call":"get_harvested_code_for_paper(arxiv_id=\"2307.16372\")"}]},{"repo":"MindSpore-scientific/code-8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2410.09754"],"harvested_for_calls":[{"arxiv_id":"2410.09754","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.09754"},"call":"get_harvested_code_for_paper(arxiv_id=\"2410.09754\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"d44ad279862606aa90988885ca0d43cc5af962e358a3d97b71ddffccfb9d9578","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}