Repository navigation
Expand file tree
/
Copy pathlinalg_test.go
More file actions
269 lines (249 loc) · 9.02 KB
/
Copy pathlinalg_test.go
File metadata and controls
269 lines (249 loc) · 9.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
package ndarray
import (
"errors"
"testing"
)
func TestMatMul(t *testing.T) {
// A (2x3) @ B (3x2), numpy 2.2.4.
a := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 2, 3)))
b := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 3, 2)))
r := mustArr(t, ok(a.MatMul(b)))
eqInts(t, r.Shape(), []int{2, 2})
eqFloats(t, r.materialize(), []float64{10, 13, 28, 40})
// Non-square (3x2)@(2x3) -> (3x3).
A := mustArr(t, ok(FromData([]float64{1, 2, 3, 4, 5, 6}, 3, 2)))
B := mustArr(t, ok(FromData([]float64{7, 8, 9, 10, 11, 12}, 2, 3)))
rr := mustArr(t, ok(A.MatMul(B)))
eqInts(t, rr.Shape(), []int{3, 3})
eqFloats(t, rr.materialize(),
[]float64{27, 30, 33, 61, 68, 75, 95, 106, 117})
}
// TestMatMulFloat32 runs the float32 product on the float64 GEMM. With
// integer-valued operands every product and sum is exact in both widths, so
// the result is exact. With random operands it agrees with a float32
// triple loop to float32 precision. Big enough (40x50x30) to take the blocked
// GEMM path, and the result keeps the Float32 dtype.
func TestMatMulFloat32(t *testing.T) {
m, k, n := 40, 50, 30
ints := func(seed int) []float32 {
d := make([]float32, 0, m*k)
for i := range cap(d) {
d = append(d, float32((i*seed)%17-8))
}
return d
}
for _, exact := range []bool{true, false} {
x, y := ints(7), ints(11)[:k*n]
if !exact {
for i := range x {
x[i] = x[i]/3 + 0.1
}
for i := range y {
y[i] = y[i]/7 - 0.05
}
}
a := mustArr(t, ok(FromSlice(x, m, k)))
b := mustArr(t, ok(FromSlice(y, k, n)))
r := mustArr(t, ok(a.MatMul(b)))
if r.DType() != Float32 {
t.Fatalf("dtype %v, want float32", r.DType())
}
got := data[float32](t, r)
want := make([]float32, m*n)
matmulNum(want, x, y, m, k, n)
for i := range want {
d := float64(got[i]) - float64(want[i])
if exact && d != 0 || !exact && d*d > 1e-10*(1+float64(want[i])*float64(want[i])) {
t.Fatalf("exact=%v [%d] = %v, float32 loop %v", exact, i, got[i], want[i])
}
}
}
}
// TestMatMulFloat32Operands multiplies float32 operands that the float32 GEMM
// reads in place (a transposed view) or converts first (an Int8 operand, whose
// common dtype with Float32 is Float32), on integer data where every path is
// exact.
func TestMatMulFloat32Operands(t *testing.T) {
m, k, n := 9, 13, 17
x := make([]float32, k*m) // holds aᵀ
y := make([]float32, k*n)
yi := make([]int8, k*n)
for i := range x {
x[i] = float32(i%11 - 5)
}
for i := range y {
yi[i] = int8(i%7 - 3)
y[i] = float32(yi[i])
}
at := mustArr(t, ok(FromSlice(x, k, m))).Transpose()
want := make([]float32, m*n)
matmulNum(want, data[float32](t, at), y, m, k, n)
saved := useGemm32
defer func() { useGemm32 = saved }()
for _, native := range []bool{saved, false} { // the float32 GEMM, then widening
useGemm32 = native
for _, b := range []*Array{mustArr(t, ok(FromSlice(y, k, n))), mustArr(t, ok(FromSlice(yi, k, n)))} {
r := mustArr(t, ok(at.MatMul(b)))
if r.DType() != Float32 {
t.Fatalf("%v operand: dtype %v, want float32", b.DType(), r.DType())
}
for i, g := range data[float32](t, r) {
if g != want[i] {
t.Fatalf("native=%v %v operand [%d] = %v, want %v", native, b.DType(), i, g, want[i])
}
}
}
}
}
func TestMatMulTransposedView(t *testing.T) {
// A.T @ A where A is (3x2): A.T is a (2x3) strided view, exercising
// materialize inside matmul2D. Result (2x2) == [[35,44],[44,56]] (numpy).
A := mustArr(t, ok(FromData([]float64{1, 2, 3, 4, 5, 6}, 3, 2)))
r := mustArr(t, ok(A.Transpose().MatMul(A)))
eqInts(t, r.Shape(), []int{2, 2})
eqFloats(t, r.materialize(), []float64{35, 44, 44, 56})
}
func TestMatMulErrors(t *testing.T) {
a := mustArr(t, ok(FromData([]float64{1, 2, 3, 4}, 2, 2)))
v := mustArr(t, ok(FromData([]float64{1, 2}, 2)))
if _, err := a.MatMul(v); !errors.Is(err, ErrLinalg) {
t.Fatalf("non-2D operand: %v", err)
}
bad := mustArr(t, ok(FromData([]float64{1, 2, 3, 4, 5, 6}, 3, 2)))
if _, err := a.MatMul(bad); !errors.Is(err, ErrLinalg) {
t.Fatalf("inner-dim mismatch: %v", err)
}
}
func TestDot(t *testing.T) {
u := mustArr(t, ok(FromData([]float64{1, 2, 3}, 3)))
v := mustArr(t, ok(FromData([]float64{4, 5, 6}, 3)))
// 1-D · 1-D -> scalar (0-d) 32.
s := mustArr(t, ok(u.Dot(v)))
if s.Ndim() != 0 || s.Size() != 1 {
t.Fatalf("dot1d Ndim=%d Size=%d", s.Ndim(), s.Size())
}
eqFloats(t, s.materialize(), []float64{32})
// 2-D · 2-D -> matmul.
a := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 2, 3)))
b := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 3, 2)))
mm := mustArr(t, ok(a.Dot(b)))
eqFloats(t, mm.materialize(), []float64{10, 13, 28, 40})
// 2-D · 1-D -> matrix-vector: A·[1,1,1] = [3,12].
ones := mustArr(t, ok(FromData([]float64{1, 1, 1}, 3)))
mv := mustArr(t, ok(a.Dot(ones)))
eqInts(t, mv.Shape(), []int{2})
eqFloats(t, mv.materialize(), []float64{3, 12})
// 1-D · 2-D -> vector-matrix: [1,1]·A = [3,5,7].
ones2 := mustArr(t, ok(FromData([]float64{1, 1}, 2)))
vm := mustArr(t, ok(ones2.Dot(a)))
eqInts(t, vm.Shape(), []int{3})
eqFloats(t, vm.materialize(), []float64{3, 5, 7})
}
func TestDotErrors(t *testing.T) {
u := mustArr(t, ok(FromData([]float64{1, 2, 3}, 3)))
w := mustArr(t, ok(FromData([]float64{1, 2}, 2)))
a := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 2, 3)))
if _, err := u.Dot(w); !errors.Is(err, ErrLinalg) {
t.Fatalf("dot 1d length mismatch: %v", err)
}
if _, err := a.Dot(w); !errors.Is(err, ErrLinalg) {
t.Fatalf("dot 2d-1d mismatch: %v", err)
}
// 1-D · 2-D: vector length must equal the matrix's first dim (a has 2 rows).
if _, err := u.Dot(a); !errors.Is(err, ErrLinalg) {
t.Fatalf("dot 1d-2d mismatch: %v", err)
}
// 3-D operand is unsupported.
c := mustArr(t, ok(New(2, 2, 2)))
if _, err := c.Dot(u); !errors.Is(err, ErrLinalg) {
t.Fatalf("dot high-rank: %v", err)
}
}
func TestInner(t *testing.T) {
u := mustArr(t, ok(FromData([]float64{1, 2, 3}, 3)))
v := mustArr(t, ok(FromData([]float64{4, 5, 6}, 3)))
s := mustArr(t, ok(u.Inner(v)))
eqFloats(t, s.materialize(), []float64{32})
// 2-D inner: inner(A, C) sums over the last axis. A (2x3), C (2x3) ->
// (2x2). numpy.inner(arange(6).reshape(2,3), [[0,2,4],[1,3,5]]).
a := mustArr(t, ok(FromData([]float64{0, 1, 2, 3, 4, 5}, 2, 3)))
c := mustArr(t, ok(FromData([]float64{0, 2, 4, 1, 3, 5}, 2, 3)))
r := mustArr(t, ok(a.Inner(c)))
eqInts(t, r.Shape(), []int{2, 2})
eqFloats(t, r.materialize(), []float64{10, 13, 28, 40})
if _, err := a.Inner(mustArr(t, ok(FromData([]float64{1, 2}, 1, 2)))); !errors.Is(err, ErrLinalg) {
t.Fatalf("inner last-dim mismatch: %v", err)
}
if _, err := a.Inner(u); !errors.Is(err, ErrLinalg) {
t.Fatalf("inner rank mismatch: %v", err)
}
}
func TestOuter(t *testing.T) {
u := mustArr(t, ok(FromData([]float64{1, 2, 3}, 3)))
v := mustArr(t, ok(FromData([]float64{4, 5, 6}, 3)))
o := u.Outer(v)
eqInts(t, o.Shape(), []int{3, 3})
eqFloats(t, o.materialize(),
[]float64{4, 5, 6, 8, 10, 12, 12, 15, 18})
// Outer flattens higher-rank inputs first: (2x2) and (2,) -> (4x2).
m := mustArr(t, ok(FromData([]float64{1, 2, 3, 4}, 2, 2)))
o2 := m.Outer(mustArr(t, ok(FromData([]float64{1, 10}, 2))))
eqInts(t, o2.Shape(), []int{4, 2})
eqFloats(t, o2.materialize(),
[]float64{1, 10, 2, 20, 3, 30, 4, 40})
}
// TestMatMulStridedViews multiplies views that are not contiguous — both
// transposes, a step-2 column slice, a reversed (negative-stride) row slice, an
// offset sub-block and a zero-stride broadcast row — and requires the exact
// result of multiplying their contiguous copies. The GEMM packs views through
// their strides instead of materialising them, so the packed values, and hence
// every product and sum, must be the same.
func TestMatMulStridedViews(t *testing.T) {
grid := func(r, c int, seed float64) *Array {
d := make([]float64, r*c)
for i := range d {
d[i] = float64((i*7+int(seed))%23) - 11
}
return mustArr(t, ok(FromData(d, r, c)))
}
big := grid(40, 30, 1)
sl := func(x *Array, ix ...Index) *Array {
v, err := x.Slice(ix...)
if err != nil {
t.Fatal(err)
}
return v
}
row := sl(grid(1, 30, 5), A(0), All())
bcast := &Array{data: row.data, shape: []int{13, 30}, strides: []int{0, 1}}
cases := []struct {
name string
a, b *Array
}{
{"aT", grid(30, 17, 2).Transpose(), grid(30, 21, 3)},
{"bT", grid(17, 30, 2), grid(21, 30, 3).Transpose()},
{"both T", grid(30, 17, 2).Transpose(), grid(21, 30, 3).Transpose()},
{"step cols", sl(big, All(), Step(2)), grid(15, 9, 4)},
{"reversed rows", sl(big, Step(-1), All()), grid(30, 11, 6)},
{"offset block", sl(big, R(3, 29), R(5, 25)), sl(big, R(7, 27), R(2, 19))},
{"broadcast rows", bcast, grid(30, 10, 7)},
}
for _, c := range cases {
got, err := c.a.MatMul(c.b)
if err != nil {
t.Fatalf("%s: %v", c.name, err)
}
want, err := c.a.Copy().MatMul(c.b.Copy())
if err != nil {
t.Fatalf("%s copy: %v", c.name, err)
}
if !sameShape(got.shape, want.shape) {
t.Fatalf("%s: shape %v, want %v", c.name, got.shape, want.shape)
}
for i := range want.data {
if got.data[i] != want.data[i] {
t.Fatalf("%s [%d]: %v, want %v", c.name, i, got.data[i], want.data[i])
}
}
}
}