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
|
import ot
import numpy as np
def test_parmap():
n = 100
def f(i):
return 1.0 * i * i
a = np.arange(n)
l1 = list(map(f, a))
l2 = list(ot.utils.parmap(f, a))
assert np.allclose(l1, l2)
def test_tic_toc():
import time
ot.tic()
time.sleep(0.5)
t = ot.toc()
t2 = ot.toq()
# test timing
assert np.allclose(0.5, t, rtol=1e-2, atol=1e-2)
# test toc vs toq
assert np.allclose(t, t2, rtol=1e-2, atol=1e-2)
def test_kernel():
n = 100
x = np.random.randn(n, 2)
K = ot.utils.kernel(x, x)
# gaussian kernel has ones on the diagonal
assert np.allclose(np.diag(K), np.ones(n))
def test_unif():
n = 100
u = ot.unif(n)
assert np.allclose(1, np.sum(u))
def test_dist():
n = 100
x = np.random.randn(n, 2)
D = np.zeros((n, n))
for i in range(n):
for j in range(n):
D[i, j] = np.sum(np.square(x[i, :] - x[j, :]))
D2 = ot.dist(x, x)
D3 = ot.dist(x)
# dist shoul return squared euclidean
assert np.allclose(D, D2)
assert np.allclose(D, D3)
def test_dist0():
n = 100
M = ot.utils.dist0(n, method='lin_square')
# dist0 default to linear sampling with quadratic loss
assert np.allclose(M[0, -1], (n - 1) * (n - 1))
def test_dots():
n1, n2, n3, n4 = 100, 50, 200, 100
A = np.random.randn(n1, n2)
B = np.random.randn(n2, n3)
C = np.random.randn(n3, n4)
X1 = ot.utils.dots(A, B, C)
X2 = A.dot(B.dot(C))
assert np.allclose(X1, X2)
def test_clean_zeros():
n = 100
nz = 50
nz2 = 20
u1 = ot.unif(n)
u1[:nz] = 0
u1 = u1 / u1.sum()
u2 = ot.unif(n)
u2[:nz2] = 0
u2 = u2 / u2.sum()
M = ot.utils.dist0(n)
a, b, M2 = ot.utils.clean_zeros(u1, u2, M)
assert len(a) == n - nz
assert len(b) == n - nz2
|
