Skip to content

Commit

Permalink
Fix typos in quantization.mdx (#1989)
Browse files Browse the repository at this point in the history
Fix typos quantization.mdx

Fixed 3 typos
  • Loading branch information
aldakata authored Aug 14, 2024
1 parent 5eaf91b commit fa2a298
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions docs/source/concept_guides/quantization.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -95,11 +95,11 @@ paragraph.

### Symmetric and affine quantization schemes

The equation above is called the *affine quantization sheme* because the mapping from `[a, b]` to `int8` is an affine one.
The equation above is called the *affine quantization scheme* because the mapping from `[a, b]` to `int8` is an affine one.

A common special case of this scheme is the *symmetric quantization scheme*, where we consider a symmetric range of float values `[-a, a]`.
In this case the integer space is usally `[-127, 127]`, meaning that the `-128` is opted out of the regular `[-128, 127]` signed `int8` range.
The reason being that having both ranges symmetric allows to have `Z = 0`. While one value out of the 256 representable
In this case the integer space is usually `[-127, 127]`, meaning that the `-128` is opted out of the regular `[-128, 127]` signed `int8` range.
The reason being that having a symmetric range allows to have `Z = 0`. While one value out of the 256 representable
values is lost, it can provide a speedup since a lot of addition operations can be skipped.

**Note**: To learn how the quantization parameters `S` and `Z` are computed, you can read the
Expand Down

0 comments on commit fa2a298

Please sign in to comment.