Equation 37 · Shrink It, Train It Small, or Search for It: The Main Strategies for Small Models, Compared
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
the architecture search pays. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
subscript
subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
How to interpret it
Read this expression with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
Compression pays mostly , a documented small fraction of a from-scratch training cost [ 3 ] , but only if a suitable large model is available to reuse in the first place. Training small on purpose pays and in full, with no discount, in exchange for a model that inherits nothing it was not deliberately given. Architecture search pays , which can be enormous when paid fresh per target [ 7 ] or amortized across many targets when paid once as a supernet [ 10 ] , on top of whatever strategy trains the architecture it discovers. Sparse mixture-of-experts is the odd one out in this accounting: its saving shows up only in \bar…
Read the full surrounding passage
Compression pays mostly , a documented small fraction of a from-scratch training cost [ 3 ] , but only if a suitable large model is available to reuse in the first place. Training small on purpose pays and in full, with no discount, in exchange for a model that inherits nothing it was not deliberately given. Architecture search pays , which can be enormous when paid fresh per target [ 7 ] or amortized across many targets when paid once as a supernet [ 10 ] , on top of whatever strategy trains the architecture it discovers. Sparse mixture-of-experts is the odd one out in this accounting: its saving shows up only in , the cost per served token, and it does essentially nothing to relax the constraint that the other three strategies are built specifically to satisfy [ 13 , 12 ] .
Sources cited in the surrounding passage
- [3] Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning ↗
- [7] Neural Architecture Search with Reinforcement Learning ↗
- [10] Once for All: Train One Network and Specialize it for Efficient Deployment ↗
These citations give research context. Read each source to check which claims it supports.