Methods › Computer Vision › Image Model Blocks › ESP

Efficient Spatial Pyramid

ESP

46 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

An Efficient Spatial Pyramid (ESP) is an image model block based on a factorization principle that decomposes a standard convolution into two steps: (1) point-wise convolutions and (2) spatial pyramid of dilated convolutions. The point-wise convolutions help in reducing the computation, while the spatial pyramid of dilated convolutions re-samples the feature maps to learn the representations from large effective receptive field. This allows for increased efficiency compared to another image blocks like ResNeXt blocks and Inception modules.

Source: ESPNet: Efficient Spatial Pyramid of Dilated...See Code · sacmehta/ESPNet

In Syntology no code under this exact name (no_code; paper_only). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2603.17942) is about this method is not checked; it does not say whether this method has code.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2603.17942 (its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 46 · with a code link: 17 · where Syntology ran a sample: 6 (5 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (6 of 46 tagged: 5 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 46 of 46, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 57 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Speech Recognition12
speech-recognition11
Automatic Speech Recognition9
Automatic Speech Recognition (ASR)8
Semantic Segmentation5
Reinforcement Learning4
reinforcement-learning4
GPU3
Language Modeling3
Language Modelling3
Reinforcement Learning (RL)3
Segmentation3
Text to Speech3
text-to-speech3
Decoder2
Object Detection2
Prediction2
Real-Time Semantic Segmentation2
Speech Separation2
object-detection2

Usage over time archive 2025-07-28

Papers per year tagged with ESP: 2018 to 2025, peak 11 11 0 2018: 5 papers 2018 2019: 3 papers 2019 2020: 9 papers 2020 2021: 4 papers 2021 2022: 9 papers 2022 2023: 4 papers 2023 2024: 11 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (46 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Image Model Blocks

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections