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
|
#define LOG_AUCTION
#include "catch/catch.hpp"
#include <sstream>
#include <iostream>
#undef LOG_AUCTION
#include "wasserstein.h"
using PairVector = std::vector<std::pair<double, double>>;
std::vector<std::string> split_on_delim(const std::string& s, char delim)
{
std::stringstream ss(s);
std::string token;
std::vector<std::string> tokens;
while(std::getline(ss, token, delim)) {
tokens.push_back(token);
}
return tokens;
}
// single row in a file with test cases
struct TestFromFileCase {
std::string file_1;
std::string file_2;
double q;
double internal_p;
double answer;
TestFromFileCase(std::string s)
{
auto tokens = split_on_delim(s, ' ');
assert(tokens.size() == 5);
file_1 = tokens.at(0);
file_2 = tokens.at(1);
q = std::stod(tokens.at(2));
internal_p = std::stod(tokens.at(3));
answer = std::stod(tokens.at(4));
if ( q < 1.0 or std::isinf(q) or
(internal_p != hera::get_infinity<double>() and internal_p < 1.0)) {
throw std::runtime_error("Bad line in test_list.txt");
}
}
};
std::ostream& operator<<(std::ostream& out, const TestFromFileCase& s)
{
out << "[" << s.file_1 << ", " << s.file_2 << ", q = " << s.q << ", norm = ";
if (s.internal_p != hera::get_infinity()) {
out << s.internal_p;
} else {
out << "infinity";
}
out << ", answer = " << s.answer << "]";
return out;
}
TEST_CASE("simple cases", "wasserstein_dist")
{
PairVector diagram_A, diagram_B;
hera::AuctionParams<double> params;
params.wasserstein_power = 1.0;
params.delta = 0.01;
params.internal_p = hera::get_infinity<double>();
params.initial_epsilon = 0.0;
params.epsilon_common_ratio = 0.0;
params.max_num_phases = 30;
params.gamma_threshold = 0.0;
params.max_bids_per_round = 0; // use Jacobi
SECTION("trivial: two empty diagrams") {
REQUIRE( 0.0 == hera::wasserstein_dist<>(diagram_A, diagram_B, params));
}
SECTION("trivial: one empty diagram, one single-point diagram") {
diagram_A.emplace_back(1.0, 2.0);
double d1 = hera::wasserstein_dist<>(diagram_A, diagram_B, params);
REQUIRE( fabs(d1 - 0.5) <= 0.00000000001 );
double d2 = hera::wasserstein_dist<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d2 - 0.5) <= 0.00000000001 );
params.internal_p = 2.0;
double corr_answer = 1.0 / std::sqrt(2.0);
double d3 = hera::wasserstein_dist<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d3 - corr_answer) <= 0.00000000001 );
}
SECTION("trivial: two single-point diagrams-1") {
diagram_A.emplace_back(10.0, 20.0); // (5, 5)
diagram_B.emplace_back(13.0, 19.0); // (3, 3)
double d1 = hera::wasserstein_dist<>(diagram_A, diagram_B, params);
double d2 = hera::wasserstein_dist<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d1 - d2) <= 0.00000000001 );
REQUIRE( fabs(d1 - 3.0) <= 0.00000000001 );
params.wasserstein_power = 2.0;
double d3 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d4 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d3 - d4) <= 0.00000000001 );
REQUIRE( fabs(d4 - 9.0) <= 0.00000000001 );
params.wasserstein_power = 1.0;
params.internal_p = 1.0;
double d5 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d6 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d5 - d6) <= 0.00000000001 );
REQUIRE( fabs(d5 - 4.0) <= 0.00000000001 );
params.internal_p = 2.0;
double d7 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d8 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d7 - d8) <= 0.00000000001 );
REQUIRE( fabs(d7 - std::sqrt(10.0)) <= 0.00000000001 );
}
SECTION("trivial: two single-point diagrams-2") {
diagram_A.emplace_back(10.0, 20.0); // (5, 5)
diagram_B.emplace_back(130.0, 138.0); // (4, 4)
double d1 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d2 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d1 - d2) <= 0.00000000001 );
REQUIRE( fabs(d1 - 9.0) <= 0.00000000001 );
params.wasserstein_power = 2.0;
double d3 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d4 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d3 - d4) <= 0.00000000001 );
REQUIRE( fabs(d4 - 41.0) <= 0.00000000001 ); // 5^2 + 4^2
params.wasserstein_power = 1.0;
params.internal_p = 1.0;
double d5 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d6 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d5 - d6) <= 0.00000000001 );
REQUIRE( fabs(d5 - 18.0) <= 0.00000000001 ); // 5 + 5 + 4 + 4
params.internal_p = 2.0;
double d7 = hera::wasserstein_cost<>(diagram_A, diagram_B, params);
double d8 = hera::wasserstein_cost<>(diagram_B, diagram_A, params);
REQUIRE( fabs(d7 - d8) <= 0.00000000001 );
REQUIRE( fabs(d7 - 9 * std::sqrt(2.0)) <= 0.00000000001 ); // sqrt(5^2 + 5^2) + sqrt(4^2 + 4^2) = 9 sqrt(2)
}
}
TEST_CASE("file cases", "wasserstein_dist")
{
PairVector diagram_A, diagram_B;
hera::AuctionParams<double> params;
params.wasserstein_power = 1.0;
params.delta = 0.01;
params.internal_p = hera::get_infinity<double>();
params.initial_epsilon = 0.0;
params.epsilon_common_ratio = 0.0;
params.max_num_phases = 30;
params.gamma_threshold = 0.0;
params.max_bids_per_round = 1; // use Jacobi
SECTION("from file:") {
const char* file_name = "../tests/data/test_list.txt";
std::ifstream f;
f.open(file_name);
std::vector<TestFromFileCase> test_params;
std::string s;
while (std::getline(f, s)) {
test_params.emplace_back(s);
}
for(const auto& ts : test_params) {
params.wasserstein_power = ts.q;
params.internal_p = ts.internal_p;
bool read_file_A = hera::read_diagram_point_set<double, PairVector>(ts.file_1, diagram_A);
bool read_file_B = hera::read_diagram_point_set<double, PairVector>(ts.file_2, diagram_B);
REQUIRE( read_file_A );
REQUIRE( read_file_B );
double hera_answer = hera::wasserstein_dist(diagram_A, diagram_B, params);
REQUIRE( fabs(hera_answer - ts.answer) <= 0.01 * hera_answer );
std::cout << ts << " PASSED " << std::endl;
}
}
}
|
