{"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/epsanet-an-efficient-pyramid-split-attention","title":"EPSANet: An Efficient Pyramid Squeeze Attention Block on Convolutional Neural Network","arxiv_id":"2105.14447","date":"2021-05-30","proceeding":null,"authors":["Hu Zhang","Keke Zu","Jian Lu","Yuru Zou","Deyu Meng"],"abstract":"Recently, it has been demonstrated that the performance of a deep convolutional neural network can be effectively improved by embedding an attention module into it. In this work, a novel lightweight and effective attention method named Pyramid Squeeze Attention (PSA) module is proposed. By replacing the 3x3 convolution with the PSA module in the bottleneck blocks of the ResNet, a novel representational block named Efficient Pyramid Squeeze Attention (EPSA) is obtained. The EPSA block can be easily added as a plug-and-play component into a well-established backbone network, and significant improvements on model performance can be achieved. Hence, a simple and efficient backbone architecture named EPSANet is developed in this work by stacking these ResNet-style EPSA blocks. Correspondingly, a stronger multi-scale representation ability can be offered by the proposed EPSANet for various computer vision tasks including but not limited to, image classification, object detection, instance segmentation, etc. Without bells and whistles, the performance of the proposed EPSANet outperforms most of the state-of-the-art channel attention methods. As compared to the SENet-50, the Top-1 accuracy is improved by 1.93% on ImageNet dataset, a larger margin of +2.7 box AP for object detection and an improvement of +1.7 mask AP for instance segmentation by using the Mask-RCNN on MS-COCO dataset are obtained. Our source code is available at:https://github.com/murufeng/EPSANet.","url_abs":"https://arxiv.org/abs/2105.14447v2","url_pdf":"https://arxiv.org/pdf/2105.14447v2.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":"epsanet-an-efficient-pyramid-split-attention","repo_url":"https://github.com/murufeng/EPSANet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"epsanet-an-efficient-pyramid-split-attention","repo_url":"https://github.com/xmu-xiaoma666/External-Attention-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"epsanet-an-efficient-pyramid-split-attention","repo_url":"https://github.com/MindSpore-scientific/code-12/tree/main/EPRNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"epsanet-an-efficient-pyramid-split-attention","repo_url":"https://github.com/mindspore-courses/External-Attention-MindSpore/blob/main/model/attention/EPSA.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"instance-segmentation","task_name":"Instance Segmentation"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"image-classification","task_name":"image-classification"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"split-attention","method_name":"Split Attention"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2105.14447","atlas_url":"https://app.syntology.ai/?focus=2105.14447","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":"2105.14447"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2105.14447\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2105.14447"},"call":"get_concepts_for_paper(arxiv_id=\"2105.14447\")"}],"by_repo":[{"repo":"murufeng/EPSANet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xmu-xiaoma666/External-Attention-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":7,"harvested_for":["1706.03762","2101.03697","2103.06255","2103.12731","2105.01601","2105.08050","2110.02178"],"harvested_for_calls":[{"arxiv_id":"1706.03762","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1706.03762"},"call":"get_harvested_code_for_paper(arxiv_id=\"1706.03762\")"},{"arxiv_id":"2101.03697","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.03697"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.03697\")"},{"arxiv_id":"2103.06255","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.06255"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.06255\")"},{"arxiv_id":"2103.12731","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.12731"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.12731\")"},{"arxiv_id":"2105.01601","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.01601"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.01601\")"},{"arxiv_id":"2105.08050","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.08050"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.08050\")"},{"arxiv_id":"2110.02178","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.02178"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.02178\")"}]},{"repo":"MindSpore-scientific/code-12","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2503.09573"],"harvested_for_calls":[{"arxiv_id":"2503.09573","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2503.09573"},"call":"get_harvested_code_for_paper(arxiv_id=\"2503.09573\")"}]},{"repo":"mindspore-courses/External-Attention-MindSpore","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"e35e731c50a202cbb7ce57a6fe2909088ac43d4ef4bd9a3a4ad63bd503916b9d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}