mirror of https://github.com/google/gemma.cpp.git
Move AssertClose to test_util, add U16
PiperOrigin-RevId: 853321311
This commit is contained in:
parent
2ee1fac74c
commit
aeade052c6
|
|
@ -17,6 +17,10 @@
|
||||||
#ifndef THIRD_PARTY_GEMMA_CPP_COMPRESSION_TEST_UTIL_INL_H_
|
#ifndef THIRD_PARTY_GEMMA_CPP_COMPRESSION_TEST_UTIL_INL_H_
|
||||||
#define THIRD_PARTY_GEMMA_CPP_COMPRESSION_TEST_UTIL_INL_H_
|
#define THIRD_PARTY_GEMMA_CPP_COMPRESSION_TEST_UTIL_INL_H_
|
||||||
|
|
||||||
|
#include <stddef.h>
|
||||||
|
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
// IWYU pragma: begin_exports
|
// IWYU pragma: begin_exports
|
||||||
#include "compression/distortion.h"
|
#include "compression/distortion.h"
|
||||||
#include "util/mat.h"
|
#include "util/mat.h"
|
||||||
|
|
@ -153,6 +157,126 @@ MatStorageT<MatT> GenerateTransposedMat(const Extents2D extents,
|
||||||
return compressed;
|
return compressed;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Returns 1-norm, used for estimating tolerable numerical differences.
|
||||||
|
inline double MaxRowAbsSum(const MatStorageT<float>& a) {
|
||||||
|
double max_row_abs_sum = 0.0;
|
||||||
|
for (size_t r = 0; r < a.Rows(); r++) {
|
||||||
|
const float* row = a.Row(r);
|
||||||
|
double row_abs_sum = 0.0;
|
||||||
|
for (size_t c = 0; c < a.Cols(); c++) {
|
||||||
|
row_abs_sum += hwy::ScalarAbs(row[c]);
|
||||||
|
}
|
||||||
|
max_row_abs_sum = HWY_MAX(max_row_abs_sum, row_abs_sum);
|
||||||
|
}
|
||||||
|
return max_row_abs_sum;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Returns the maximum absolute value of `a`.
|
||||||
|
inline float MaxAbs(const MatStorageT<float>& a) {
|
||||||
|
float max_abs = 0.0f;
|
||||||
|
for (size_t c = 0; c < a.Cols(); c++) {
|
||||||
|
for (size_t r = 0; r < a.Rows(); r++) {
|
||||||
|
const float* row = a.Row(r);
|
||||||
|
max_abs = HWY_MAX(max_abs, hwy::ScalarAbs(row[c]));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return max_abs;
|
||||||
|
}
|
||||||
|
|
||||||
|
// B is already transposed.
|
||||||
|
template <typename TA, typename TB, typename TC>
|
||||||
|
void AssertClose(const MatPtrT<TA>& A, const MatPtrT<TB>& B,
|
||||||
|
const MatPtrT<TC>& C_slow, const MatPtrT<TC>& C,
|
||||||
|
const Allocator& allocator,
|
||||||
|
std::vector<hwy::AlignedFreeUniquePtr<uint8_t*[]>>& row_ptrs,
|
||||||
|
int line) {
|
||||||
|
const hn::ScalableTag<float> df;
|
||||||
|
const size_t cols = A.Cols();
|
||||||
|
const size_t B_rows = B.Rows();
|
||||||
|
// Round up for DecompressAndZeroPad.
|
||||||
|
MatStorageT<float> a_batch("a_batch", A.Extents(), allocator,
|
||||||
|
MatPadding::kOdd);
|
||||||
|
MatStorageT<float> b_trans_batch("b_trans_batch", B.Extents(), allocator,
|
||||||
|
MatPadding::kOdd);
|
||||||
|
MatStorageT<float> c_batch("c_batch", Extents2D(A.Rows(), B_rows), allocator,
|
||||||
|
MatPadding::kOdd);
|
||||||
|
c_batch.AllocateAndAttachRowPtrs(row_ptrs);
|
||||||
|
MatStorageT<float> c_slow_batch("c_slow_batch", Extents2D(A.Rows(), B_rows),
|
||||||
|
allocator, MatPadding::kOdd);
|
||||||
|
for (size_t m = 0; m < A.Rows(); ++m) {
|
||||||
|
DecompressAndZeroPad(df, MakeSpan(A.Row(m), cols), 0, a_batch.Row(m), cols);
|
||||||
|
DecompressAndZeroPad(df, MakeSpan(C.Row(m), B_rows), 0, c_batch.Row(m),
|
||||||
|
B_rows);
|
||||||
|
DecompressAndZeroPad(df, MakeSpan(C_slow.Row(m), B_rows), 0,
|
||||||
|
c_slow_batch.Row(m), B_rows);
|
||||||
|
}
|
||||||
|
for (size_t n = 0; n < B_rows; ++n) {
|
||||||
|
DecompressAndZeroPad(df, MakeSpan(B.Row(n), cols), 0, b_trans_batch.Row(n),
|
||||||
|
cols);
|
||||||
|
}
|
||||||
|
|
||||||
|
// MatMul rounds inputs to BF16, so error is proportional to the max input
|
||||||
|
// magnitude, but also to f32 accumulation of rows in A and B.
|
||||||
|
const double norm = MaxRowAbsSum(a_batch) * MaxRowAbsSum(b_trans_batch);
|
||||||
|
const float max_abs = MaxAbs(a_batch) * MaxAbs(b_trans_batch);
|
||||||
|
const double eps_bf16 = hwy::ConvertScalarTo<double>(hwy::Epsilon<BF16>());
|
||||||
|
const double eps_f32 = hwy::ConvertScalarTo<double>(hwy::Epsilon<float>());
|
||||||
|
// Dot() uses double-precision summation.
|
||||||
|
double tolerance = 20 * norm * eps_f32;
|
||||||
|
// If either is F32, Dot() promotes F32 or even F64, but MatMul demotes the
|
||||||
|
// F32 to BF16, so add extra tolerance.
|
||||||
|
if (IsF32<TA>() || IsF32<TB>()) {
|
||||||
|
tolerance += 2 * max_abs * eps_bf16;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (tolerance > 500.0) {
|
||||||
|
HWY_WARN("high tolerance %f norm %f maxabs %f\n", tolerance, norm, max_abs);
|
||||||
|
}
|
||||||
|
const double rel_tolerance =
|
||||||
|
1.0 + hwy::ConvertScalarTo<double>(hwy::Epsilon<TC>());
|
||||||
|
|
||||||
|
double max_rel = 0.0;
|
||||||
|
size_t worst_r = 0;
|
||||||
|
size_t worst_c = 0;
|
||||||
|
double worst_actual = 0.0;
|
||||||
|
double worst_expected = 0.0;
|
||||||
|
size_t num_outside = 0;
|
||||||
|
for (size_t r = 0; r < A.Rows(); r++) {
|
||||||
|
const float* expected_row = c_slow_batch.Row(r);
|
||||||
|
const float* actual_row = c_batch.Row(r);
|
||||||
|
for (size_t c = 0; c < B.Rows(); c++) {
|
||||||
|
const double expected_value = static_cast<double>(expected_row[c]);
|
||||||
|
const double actual_value = static_cast<double>(actual_row[c]);
|
||||||
|
const bool in_range = expected_value - tolerance <= actual_value &&
|
||||||
|
actual_value <= expected_value + tolerance;
|
||||||
|
|
||||||
|
if (!in_range) {
|
||||||
|
const double max = HWY_MAX(expected_value, actual_value);
|
||||||
|
const double min = HWY_MIN(expected_value, actual_value);
|
||||||
|
const double rel = max / HWY_MAX(min, 1E-6);
|
||||||
|
if (rel > max_rel) {
|
||||||
|
worst_expected = expected_value;
|
||||||
|
worst_actual = actual_value;
|
||||||
|
worst_r = r;
|
||||||
|
worst_c = c;
|
||||||
|
max_rel = rel;
|
||||||
|
++num_outside;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (max_rel > rel_tolerance) {
|
||||||
|
hwy::Abort(__FILE__, line,
|
||||||
|
"(%zu,%zu): expected %f, actual %f, norm %f maxabs %f "
|
||||||
|
"tolerance %f rel %E max_rel %E num_outside %zu\n",
|
||||||
|
worst_r, worst_c, worst_expected, worst_actual, norm, max_abs,
|
||||||
|
tolerance, max_rel, rel_tolerance, num_outside);
|
||||||
|
}
|
||||||
|
HWY_ASSERT(hn::AllFalse(
|
||||||
|
df, hn::IsEitherNaN(hn::Set(df, norm), hn::Set(df, max_abs))));
|
||||||
|
}
|
||||||
|
|
||||||
// NOLINTNEXTLINE(google-readability-namespace-comments)
|
// NOLINTNEXTLINE(google-readability-namespace-comments)
|
||||||
} // namespace HWY_NAMESPACE
|
} // namespace HWY_NAMESPACE
|
||||||
} // namespace gcpp
|
} // namespace gcpp
|
||||||
|
|
|
||||||
|
|
@ -218,12 +218,23 @@ constexpr bool SupportsPointerArithmetic() {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Tensor types for loading weights. Not all of these are supported weight
|
// Tensor types for loading weights. Not all of these are supported weight
|
||||||
// types, some are only used for `Activations`.
|
// types, some are only used for `Activations`. Append-only.
|
||||||
enum class Type { kUnknown, kF32, kBF16, kSFP, kNUQ, kF64, kU32, kU64, kI8 };
|
enum class Type {
|
||||||
|
kUnknown,
|
||||||
|
kF32,
|
||||||
|
kBF16,
|
||||||
|
kSFP,
|
||||||
|
kNUQ,
|
||||||
|
kF64,
|
||||||
|
kU32,
|
||||||
|
kU64,
|
||||||
|
kI8,
|
||||||
|
kU16
|
||||||
|
};
|
||||||
// These are used in `ModelConfig.Specifier`, hence the strings will not
|
// These are used in `ModelConfig.Specifier`, hence the strings will not
|
||||||
// change, though new ones may be added.
|
// change, though new ones may be added.
|
||||||
static constexpr const char* kTypeStrings[] = {
|
static constexpr const char* kTypeStrings[] = {
|
||||||
"unknown", "f32", "bf16", "sfp", "nuq", "f64", "u32", "u64", "i8"};
|
"unknown", "f32", "bf16", "sfp", "nuq", "f64", "u32", "u64", "i8", "u16"};
|
||||||
static constexpr size_t kNumTypes =
|
static constexpr size_t kNumTypes =
|
||||||
sizeof(kTypeStrings) / sizeof(kTypeStrings[0]);
|
sizeof(kTypeStrings) / sizeof(kTypeStrings[0]);
|
||||||
static constexpr size_t kTypeBits[] = {
|
static constexpr size_t kTypeBits[] = {
|
||||||
|
|
@ -236,6 +247,7 @@ static constexpr size_t kTypeBits[] = {
|
||||||
8 * sizeof(uint32_t),
|
8 * sizeof(uint32_t),
|
||||||
8 * sizeof(uint64_t),
|
8 * sizeof(uint64_t),
|
||||||
8 * sizeof(I8Stream),
|
8 * sizeof(I8Stream),
|
||||||
|
8 * sizeof(uint16_t),
|
||||||
};
|
};
|
||||||
|
|
||||||
static inline bool EnumValid(Type type) {
|
static inline bool EnumValid(Type type) {
|
||||||
|
|
@ -262,6 +274,8 @@ Type TypeEnum() {
|
||||||
return Type::kU64;
|
return Type::kU64;
|
||||||
} else if constexpr (hwy::IsSame<Packed, I8Stream>()) {
|
} else if constexpr (hwy::IsSame<Packed, I8Stream>()) {
|
||||||
return Type::kI8;
|
return Type::kI8;
|
||||||
|
} else if constexpr (hwy::IsSame<Packed, uint16_t>()) {
|
||||||
|
return Type::kU16;
|
||||||
} else {
|
} else {
|
||||||
HWY_DASSERT(false);
|
HWY_DASSERT(false);
|
||||||
return Type::kUnknown;
|
return Type::kUnknown;
|
||||||
|
|
|
||||||
|
|
@ -58,122 +58,6 @@ extern int64_t first_target;
|
||||||
namespace HWY_NAMESPACE {
|
namespace HWY_NAMESPACE {
|
||||||
namespace hn = hwy::HWY_NAMESPACE;
|
namespace hn = hwy::HWY_NAMESPACE;
|
||||||
|
|
||||||
// Returns 1-norm, used for estimating tolerable numerical differences.
|
|
||||||
double MaxRowAbsSum(const MatStorageT<float>& a) {
|
|
||||||
double max_row_abs_sum = 0.0;
|
|
||||||
for (size_t r = 0; r < a.Rows(); r++) {
|
|
||||||
const float* row = a.Row(r);
|
|
||||||
double row_abs_sum = 0.0;
|
|
||||||
for (size_t c = 0; c < a.Cols(); c++) {
|
|
||||||
row_abs_sum += hwy::ScalarAbs(row[c]);
|
|
||||||
}
|
|
||||||
max_row_abs_sum = HWY_MAX(max_row_abs_sum, row_abs_sum);
|
|
||||||
}
|
|
||||||
return max_row_abs_sum;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns the maximum absolute value of `a`.
|
|
||||||
float MaxAbs(const MatStorageT<float>& a) {
|
|
||||||
float max_abs = 0.0f;
|
|
||||||
for (size_t c = 0; c < a.Cols(); c++) {
|
|
||||||
for (size_t r = 0; r < a.Rows(); r++) {
|
|
||||||
const float* row = a.Row(r);
|
|
||||||
max_abs = HWY_MAX(max_abs, hwy::ScalarAbs(row[c]));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return max_abs;
|
|
||||||
}
|
|
||||||
|
|
||||||
// B is already transposed.
|
|
||||||
template <typename TA, typename TB, typename TC>
|
|
||||||
void AssertClose(const MatPtrT<TA>& A, const MatPtrT<TB>& B,
|
|
||||||
const MatPtrT<TC>& C_slow, const MatPtrT<TC>& C,
|
|
||||||
MatMulEnv& env, int line) {
|
|
||||||
const hn::ScalableTag<float> df;
|
|
||||||
const size_t cols = A.Cols();
|
|
||||||
const size_t B_rows = B.Rows();
|
|
||||||
// Round up for DecompressAndZeroPad.
|
|
||||||
MatStorageT<float> a_batch("a_batch", A.Extents(), env.ctx.allocator,
|
|
||||||
MatPadding::kOdd);
|
|
||||||
MatStorageT<float> b_trans_batch("b_trans_batch", B.Extents(),
|
|
||||||
env.ctx.allocator, MatPadding::kOdd);
|
|
||||||
MatStorageT<float> c_batch("c_batch", Extents2D(A.Rows(), B_rows),
|
|
||||||
env.ctx.allocator, MatPadding::kOdd);
|
|
||||||
c_batch.AllocateAndAttachRowPtrs(env.row_ptrs);
|
|
||||||
MatStorageT<float> c_slow_batch("c_slow_batch", Extents2D(A.Rows(), B_rows),
|
|
||||||
env.ctx.allocator, MatPadding::kOdd);
|
|
||||||
for (size_t m = 0; m < A.Rows(); ++m) {
|
|
||||||
DecompressAndZeroPad(df, MakeSpan(A.Row(m), cols), 0, a_batch.Row(m), cols);
|
|
||||||
DecompressAndZeroPad(df, MakeSpan(C.Row(m), B_rows), 0, c_batch.Row(m),
|
|
||||||
B_rows);
|
|
||||||
DecompressAndZeroPad(df, MakeSpan(C_slow.Row(m), B_rows), 0,
|
|
||||||
c_slow_batch.Row(m), B_rows);
|
|
||||||
}
|
|
||||||
for (size_t n = 0; n < B_rows; ++n) {
|
|
||||||
DecompressAndZeroPad(df, MakeSpan(B.Row(n), cols), 0, b_trans_batch.Row(n),
|
|
||||||
cols);
|
|
||||||
}
|
|
||||||
|
|
||||||
// MatMul rounds inputs to BF16, so error is proportional to the max input
|
|
||||||
// magnitude, but also to f32 accumulation of rows in A and B.
|
|
||||||
const double norm = MaxRowAbsSum(a_batch) * MaxRowAbsSum(b_trans_batch);
|
|
||||||
const float max_abs = MaxAbs(a_batch) * MaxAbs(b_trans_batch);
|
|
||||||
const double eps_bf16 = hwy::ConvertScalarTo<double>(hwy::Epsilon<BF16>());
|
|
||||||
const double eps_f32 = hwy::ConvertScalarTo<double>(hwy::Epsilon<float>());
|
|
||||||
// Dot() uses double-precision summation.
|
|
||||||
double tolerance = 20 * norm * eps_f32;
|
|
||||||
// If either is F32, Dot() promotes F32 or even F64, but MatMul demotes the
|
|
||||||
// F32 to BF16, so add extra tolerance.
|
|
||||||
if (IsF32<TA>() || IsF32<TB>()) {
|
|
||||||
tolerance += 2 * max_abs * eps_bf16;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (tolerance > 500.0) {
|
|
||||||
HWY_WARN("high tolerance %f norm %f maxabs %f\n", tolerance, norm, max_abs);
|
|
||||||
}
|
|
||||||
const double rel_tolerance =
|
|
||||||
1.0 + hwy::ConvertScalarTo<double>(hwy::Epsilon<TC>());
|
|
||||||
|
|
||||||
double max_rel = 0.0;
|
|
||||||
size_t worst_r = 0;
|
|
||||||
size_t worst_c = 0;
|
|
||||||
double worst_actual = 0.0;
|
|
||||||
double worst_expected = 0.0;
|
|
||||||
size_t num_outside = 0;
|
|
||||||
for (size_t r = 0; r < A.Rows(); r++) {
|
|
||||||
const float* expected_row = c_slow_batch.Row(r);
|
|
||||||
const float* actual_row = c_batch.Row(r);
|
|
||||||
for (size_t c = 0; c < B.Rows(); c++) {
|
|
||||||
const double expected_value = static_cast<double>(expected_row[c]);
|
|
||||||
const double actual_value = static_cast<double>(actual_row[c]);
|
|
||||||
const bool in_range = expected_value - tolerance <= actual_value &&
|
|
||||||
actual_value <= expected_value + tolerance;
|
|
||||||
|
|
||||||
if (!in_range) {
|
|
||||||
const double max = HWY_MAX(expected_value, actual_value);
|
|
||||||
const double min = HWY_MIN(expected_value, actual_value);
|
|
||||||
const double rel = max / HWY_MAX(min, 1E-6);
|
|
||||||
if (rel > max_rel) {
|
|
||||||
worst_expected = expected_value;
|
|
||||||
worst_actual = actual_value;
|
|
||||||
worst_r = r;
|
|
||||||
worst_c = c;
|
|
||||||
max_rel = rel;
|
|
||||||
++num_outside;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (max_rel > rel_tolerance) {
|
|
||||||
hwy::Abort(__FILE__, line,
|
|
||||||
"(%zu,%zu): expected %f, actual %f, norm %f maxabs %f "
|
|
||||||
"tolerance %f rel %E max_rel %E num_outside %zu\n",
|
|
||||||
worst_r, worst_c, worst_expected, worst_actual, norm, max_abs,
|
|
||||||
tolerance, max_rel, rel_tolerance, num_outside);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// B is already transposed.
|
// B is already transposed.
|
||||||
template <typename TA, typename TB, typename TC>
|
template <typename TA, typename TB, typename TC>
|
||||||
HWY_INLINE void MatMulSlow(const MatPtrT<TA> A, const MatPtrT<TB> B,
|
HWY_INLINE void MatMulSlow(const MatPtrT<TA> A, const MatPtrT<TB> B,
|
||||||
|
|
@ -257,7 +141,7 @@ void TestMatMul(size_t rows_ac, size_t cols_a_rows_b, size_t cols_bc, bool add,
|
||||||
MMOptions options;
|
MMOptions options;
|
||||||
for (size_t rep = 0; rep < 16; ++rep) {
|
for (size_t rep = 0; rep < 16; ++rep) {
|
||||||
MMPerKey* per_key = MatMulStatic(A, BT, add_row, env, C, options);
|
MMPerKey* per_key = MatMulStatic(A, BT, add_row, env, C, options);
|
||||||
AssertClose(A, BT, C_slow, C, env, line);
|
AssertClose(A, BT, C_slow, C, env.ctx.allocator, env.row_ptrs, line);
|
||||||
// Check before TwoMatMulStatic(), which can invalidate per_key.
|
// Check before TwoMatMulStatic(), which can invalidate per_key.
|
||||||
const bool autotune_done = !!per_key->autotune.Best();
|
const bool autotune_done = !!per_key->autotune.Best();
|
||||||
|
|
||||||
|
|
@ -295,7 +179,7 @@ void TestMatMul(size_t rows_ac, size_t cols_a_rows_b, size_t cols_bc, bool add,
|
||||||
|
|
||||||
// TwoMatMulStatic() does not support adding a bias vector.
|
// TwoMatMulStatic() does not support adding a bias vector.
|
||||||
if (!add) {
|
if (!add) {
|
||||||
AssertClose(A, BT, C, C2, env, line);
|
AssertClose(A, BT, C, C2, env.ctx.allocator, env.row_ptrs, line);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -65,7 +65,6 @@ cc_test(
|
||||||
"//:benchmark_helper",
|
"//:benchmark_helper",
|
||||||
"//:configs",
|
"//:configs",
|
||||||
"//:gemma_lib",
|
"//:gemma_lib",
|
||||||
"//io",
|
|
||||||
"@highway//:hwy_test_util",
|
"@highway//:hwy_test_util",
|
||||||
],
|
],
|
||||||
)
|
)
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue