{"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/igcv2-interleaved-structured-sparse","title":"IGCV$2$: Interleaved Structured Sparse Convolutional Neural Networks","arxiv_id":"1804.06202","date":"2018-04-17","proceeding":null,"authors":["Guotian Xie","Jingdong Wang","Ting Zhang","Jian-Huang Lai","Richang Hong","Guo-Jun Qi"],"abstract":"In this paper, we study the problem of designing efficient convolutional\nneural network architectures with the interest in eliminating the redundancy in\nconvolution kernels. In addition to structured sparse kernels, low-rank kernels\nand the product of low-rank kernels, the product of structured sparse kernels,\nwhich is a framework for interpreting the recently-developed interleaved group\nconvolutions (IGC) and its variants (e.g., Xception), has been attracting\nincreasing interests.\n  Motivated by the observation that the convolutions contained in a group\nconvolution in IGC can be further decomposed in the same manner, we present a\nmodularized building block, {IGCV$2$:} interleaved structured sparse\nconvolutions. It generalizes interleaved group convolutions, which is composed\nof two structured sparse kernels, to the product of more structured sparse\nkernels, further eliminating the redundancy. We present the complementary\ncondition and the balance condition to guide the design of structured sparse\nkernels, obtaining a balance among three aspects: model size, computation\ncomplexity and classification accuracy. Experimental results demonstrate the\nadvantage on the balance among these three aspects compared to interleaved\ngroup convolutions and Xception, and competitive performance compared to other\nstate-of-the-art architecture design methods.","url_abs":"http://arxiv.org/abs/1804.06202v1","url_pdf":"http://arxiv.org/pdf/1804.06202v1.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":"igcv2-interleaved-structured-sparse","repo_url":"https://github.com/homles11/IGCV3","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"igcv2-interleaved-structured-sparse","repo_url":"https://github.com/xxradon/IGCV3-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"depthwise-convolution","method_name":"Depthwise Convolution"},{"method_slug":"depthwise-separable-convolution","method_name":"Depthwise Separable Convolution"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"pointwise-convolution","method_name":"Pointwise Convolution"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.06202","atlas_url":"https://app.syntology.ai/?focus=1804.06202","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":"1804.06202"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.06202\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.06202"},"call":"get_concepts_for_paper(arxiv_id=\"1804.06202\")"}],"by_repo":[{"repo":"homles11/IGCV3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xxradon/IGCV3-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1801.04381"],"harvested_for_calls":[{"arxiv_id":"1801.04381","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1801.04381"},"call":"get_harvested_code_for_paper(arxiv_id=\"1801.04381\")"}]}],"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":"ca53970346ba07b067c62f34836e68fb1048c127f716488469e0177d364590f3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}