Struct burn::tensor::quantization::AffineQuantization

pub struct AffineQuantization<E, Q, A>
where
    E: Float,
    Q: PrimInt,
    A: PrimInt,
{
    pub scale: E,
    pub offset: Q,
    /* private fields */
}

Affine quantization scheme.

Note that the accumulation type A should have a bigger range than quantized type Q.

Fields

scale: E

The scaling factor.

offset: Q

The zero-point offset.

Implementations

impl<E, Q, A> AffineQuantization<E, Q, A>

where E: Float, Q: PrimInt, A: PrimInt,

pub fn init(scale: E, offset: Q) -> AffineQuantization<E, Q, A>

Initialize an affine quantization scheme with the given parameters.

Trait Implementations

impl<E, Q, A> Clone for AffineQuantization<E, Q, A>

where E: Clone + Float, Q: Clone + PrimInt, A: Clone + PrimInt,

fn clone(&self) -> AffineQuantization<E, Q, A>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<E, Q, A> Debug for AffineQuantization<E, Q, A>

where E: Debug + Float, Q: Debug + PrimInt, A: Debug + PrimInt,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'de, E, Q, A> Deserialize<'de> for AffineQuantization<E, Q, A>

where E: Float + Deserialize<'de>, Q: PrimInt + Deserialize<'de>, A: PrimInt,

fn deserialize<__D>( __deserializer: __D, ) -> Result<AffineQuantization<E, Q, A>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<E, Q, A> Hash for AffineQuantization<E, Q, A>

where E: Float, Q: PrimInt + Hash, A: PrimInt,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<E, Q, A> PartialEq for AffineQuantization<E, Q, A>

where E: Float, Q: PrimInt, A: PrimInt,

fn eq(&self, other: &AffineQuantization<E, Q, A>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<E, Q, A> Quantization<E, Q> for AffineQuantization<E, Q, A>

where E: Float, Q: PrimInt, A: PrimInt,

fn new(alpha: E, beta: E) -> AffineQuantization<E, Q, A>

Create a new quantization scheme for an input range [alpha, beta].

fn quantize(&self, values: &[E]) -> Vec<Q>

Convert the values to a lower precision data type.

fn dequantize(&self, values: &[Q]) -> Vec<E>

Convert the values back to a higher precision data type.

impl<E, Q, A> Serialize for AffineQuantization<E, Q, A>

where E: Float + Serialize, Q: PrimInt + Serialize, A: PrimInt,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<E, Q, A> Copy for AffineQuantization<E, Q, A>

where E: Copy + Float, Q: Copy + PrimInt, A: Copy + PrimInt,

impl<E, Q, A> Eq for AffineQuantization<E, Q, A>

where E: Float, Q: PrimInt, A: PrimInt,