Methods › General › Feedforward Networks › DExTra

DExTra

1 paper tagged archive 2025-07-28

Introduced by Sachin Mehta et al. in DeLighT: Deep and Light-weight Transformer

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

DExTra, or Deep and Light-weight Expand-reduce Transformation, is a light-weight expand-reduce transformation that enables learning wider representations efficiently.

DExTra maps a dₘ dimensional input vector into a high dimensional space (expansion) and then reduces it down to a dₒ dimensional output vector (reduction) using N layers of group transformations. During these expansion and reduction phases, DExTra uses group linear transformations because they learn local representations by deriving the output from a specific part of the input and are more efficient than linear transformations. To learn global representations, DExTra shares information between different groups in the group linear transformation using feature shuffling

Formally, the DExTra transformation is controlled by five configuration parameters: (1) depth N, (2) width multiplier m_w, (3) input dimension dₘ, (4) output dimension dₒ, and (5) maximum groups gₘₐₓ in a group linear transformation. In the expansion phase, DExTra projects the dₘ-dimensional input to a high-dimensional space, dₘₐₓ = m_wdₘ, linearly using ceil(N/2) layers. In the reduction phase, DExTra projects the dₘₐₓ-dimensional vector to a dₒ-dimensional space using the remaining N -ceil(N/2) layers. Mathematically, we define the output Y at each layer l as:

𝐘ₗ = ℱ(𝐗, 𝐖ˡ, 𝐛ˡ, gˡ) if l=1 𝐘ₗ = ℱ(ℋ(𝐗, 𝐘ˡ⁻¹), 𝐖ˡ, 𝐛ˡ, gˡ) Otherwise

where the number of groups at each layer l are computed as:

gˡ = min(2ˡ⁻¹, gₘₐₓ), 1 ≤l ≤ceil(N/2) gᴺ⁻ˡ, Otherwise

In the above equations, ℱ is a group linear transformation function. The function ℱ takes the input (𝐗 or ℋ(𝐗, 𝐘ˡ⁻¹) ), splits it into gˡ groups, and then applies a linear transformation with learnable parameters 𝐖ˡ and bias 𝐛ˡ to each group independently. The outputs of each group are then concatenated to produce the final output 𝐘ˡ. The function ℋ first shuffles the output of each group in 𝐘ˡ⁻¹ and then combines it with the input 𝐗 using an input mixer connection.

In the authors' experiments, they use gₘₐₓ = ceil(dₘ/32) so that each group has at least 32 input elements. Note that (i) group linear transformations reduce to linear transformations when gˡ = 1, and (ii) DExTra is equivalent to a multi-layer perceptron when gₘₐₓ = 1.

PaperSourceSee Code · sacmehta/delight

Papers archive 2025-07-28

1 shown of 1, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.

Tasks archive 2025-07-28

4 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
Language Modeling1
Language Modelling1
Machine Translation1
Translation1

Usage over time archive 2025-07-28

Papers per year tagged with DExTra: 2020 to 2020, peak 1 1 0 2020: 1 paper 2020
Papers per year the archive tags with this method, by the paper's archive date (1 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

Feedforward Networks

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