- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 86 for rmax (0.08 sec)
-
tensorflow/compiler/mlir/quantization/common/ir/FakeQuantSupport.cc
qmax = std::numeric_limits<int32_t>::max(); } else { qmin = std::numeric_limits<uint32_t>::min(); qmax = std::numeric_limits<uint32_t>::max(); } } else { return true; } // Handle narrowRange. if (narrowRange) { qmin += 1; } return false; } // This is a specific implementation of nudging: // If 0.0 < rmin < rmax or rmin < rmax < 0.0, the range will be shifted
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 21 11:52:27 UTC 2024 - 7.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/numerical_utils.cc
std::optional<double> rmax, int32_t qmin, int32_t qmax) { auto quantize = [scale, zero_point](float f) { return zero_point + static_cast<int32_t>(std::round(f / scale)); }; if (rmin.has_value() && rmax.has_value()) { return {std::max(qmin, quantize(rmin.value())), std::min(qmax, quantize(rmax.value()))}; } else if (rmin.has_value()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 17 19:57:04 UTC 2023 - 3.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/common/quantization_lib/quantization_utils.h
// supports only symmetric quantization. rmax = std::max(std::abs(rmin), std::abs(rmax)); rmin = -rmax; } TensorRangeSanityCheck(op, rmin, rmax); mins.push_back(rmin); maxs.push_back(rmax); } quant_type = quantfork::fakeQuantAttrsToType(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 24 20:30:06 UTC 2024 - 41.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/numerical_utils.h
// range is the minimum range defined by [rmin, rmax] and [qmin, qmax]. QuantizedRange CalculateQuantizedRange(double scale, int32_t zero_point, std::optional<double> rmin, std::optional<double> rmax, int32_t qmin, int32_t qmax); } // namespace quant } // namespace mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 07 18:43:51 UTC 2022 - 1.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/common/ir/FakeQuantSupport.h
// - numBits < 8 is promoted to uint8 or int8 // - "narrow_range" narrows the lower bound of the storage type's range by // 1 // - the specified min/max values are "nudged" so that the result has a zero // that can be exactly expressed // - min=max=0 implies scale=0 and zero_point=0 // // With the above assumptions applied, every conforming specified FakeQuant op
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 21 11:52:27 UTC 2024 - 3.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_ops_a_m.cc
float rmin, rmax; if (&semantics == &APFloat::IEEEsingle()) { rmin = op.getMin().convertToFloat(); rmax = op.getMax().convertToFloat(); } else { rmin = op.getMin().convertToDouble(); rmax = op.getMax().convertToDouble(); } // Range boundaries must be valid. if (rmin >= rmax) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 146.7K bytes - Viewed (0) -
src/math/rand/zipf.go
} // NewZipf returns a [Zipf] variate generator. // The generator generates values k ∈ [0, imax] // such that P(k) is proportional to (v + k) ** (-s). // Requirements: s > 1 and v >= 1. func NewZipf(r *Rand, s float64, v float64, imax uint64) *Zipf { z := new(Zipf) if s <= 1.0 || v < 1 { return nil } z.r = r z.imax = float64(imax) z.v = v z.q = s z.oneminusQ = 1.0 - z.q z.oneminusQinv = 1.0 / z.oneminusQ
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 1.8K bytes - Viewed (0) -
src/math/rand/v2/zipf.go
} // NewZipf returns a Zipf variate generator. // The generator generates values k ∈ [0, imax] // such that P(k) is proportional to (v + k) ** (-s). // Requirements: s > 1 and v >= 1. func NewZipf(r *Rand, s float64, v float64, imax uint64) *Zipf { z := new(Zipf) if s <= 1.0 || v < 1 { return nil } z.r = r z.imax = float64(imax) z.v = v z.q = s z.oneminusQ = 1.0 - z.q z.oneminusQinv = 1.0 / z.oneminusQ
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 14:29:30 UTC 2023 - 1.8K bytes - Viewed (0) -
src/hash/adler32/adler32.go
return nil } // Add p to the running checksum d. func update(d digest, p []byte) digest { s1, s2 := uint32(d&0xffff), uint32(d>>16) for len(p) > 0 { var q []byte if len(p) > nmax { p, q = p[:nmax], p[nmax:] } for len(p) >= 4 { s1 += uint32(p[0]) s2 += s1 s1 += uint32(p[1]) s2 += s1 s1 += uint32(p[2]) s2 += s1 s1 += uint32(p[3]) s2 += s1 p = p[4:] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 3K bytes - Viewed (0) -
src/runtime/conv_wasm_test.go
convInt64: -0x8000000000000000, convUInt64: 0x8000000000000000, }, { input: -0x7ffffffffffffdfe, convInt64: -0x7ffffffffffffc00, convUInt64: 0x8000000000000000, }, // umax +- 1 { input: 0xffffffffffffffff, convInt64: -0x8000000000000000, convUInt64: 0x8000000000000000, }, { input: 0x10000000000000000, convInt64: -0x8000000000000000,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 06 13:55:00 UTC 2020 - 3K bytes - Viewed (0)