← Mathematical compendium

Published equation contexts

s=max⁡(∣x∣)2 b−1−1s = \frac{\max(|x|)}{2^{\,b-1} - 1}

Why this formula appears here

For weights, a common simplification is symmetric quantization around zero, with z=0 and the scale set directly by the largest magnitude present: s=max⁡(∣x∣)2 b−1−1s = \frac{\max(|x|)}{2^{\,b-1} - 1}. for a signed integer of b bits. An 8-bit integer has 2^8=256 representable levels; a 4-bit integer has 2^4=16 . That sixteen-fold reduction in available codes is the entire cost of quantization in one number. Treating the rounding error as approximately uniform over one quantization step s , its expected squared magnitude is the classical result

Read the full article-specific guide →

Read the representative guide

bb

Symbol b

b occurs below the fraction bar. The quantity above the bar is divided by this expression; zero is excluded as a denominator.

Read this term in its guide →
2 b−1−12^{\,b-1} - 1

Denominator: 2^b-1 - 1

The complete quantity below the fraction bar; it must be nonzero for this division.

Read this term in its guide →

How to interpret it

With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

s=max⁡(∣x∣)2 b−1−1s = \frac{\max(|x|)}{2^{\,b-1} - 1}

Equation 26 · Edge AI & Electronics

How a Model Actually Gets Small Enough to Run on a Phone

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

For weights, a common simplification is symmetric quantization around zero, with z=0 and the scale set directly by the largest magnitude present: s=max⁡(∣x∣)2 b−1−1s = \frac{\max(|x|)}{2^{\,b-1} - 1}. for a signed integer of b bits. An 8-bit integer has 2^8=256 representable levels; a 4-bit integer has 2^4=16 . That sixteen-fold reduction in available codes is the entire cost of quantization in one number. Treating the rounding error as approximately uniform over one quantization step s , its expected squared magnitude is the classical result

Meanings in this article

  • ss: the scale.
Equation guide → · Article →