forked from pytorch/pytorch
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Distributions.cpp
227 lines (201 loc) · 7.39 KB
/
Distributions.cpp
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
#include "ATen/ATen.h"
#include "ATen/CPUApplyUtils.h"
#include "ATen/Config.h"
#include "ATen/Dispatch.h"
#include "ATen/ExpandUtils.h"
#include "ATen/NativeFunctions.h"
#include "c10/util/Exception.h"
#include "ATen/CPUGenerator.h"
#include "ATen/CheckGenerator.h"
#include "ATen/core/Generator.h"
#include "ATen/native/Distributions.h"
#include "ATen/native/DispatchStub.h"
#include "ATen/native/cpu/UnaryOpsKernel.h"
#include <type_traits>
#include <functional>
#include <assert.h>
#include <cpuinfo.h>
#include "TH/THRandom.h"
#include "TH/THGenerator.hpp"
#include "TH/THMath.h"
namespace {
/*
* This section is a counterpart to Distributions.cu
*
*/
// The function `sample_poisson`
// is adapted from Numpy's distributions.c implementation.
// It is MIT licensed, so here is the copyright:
/* Copyright 2005 Robert Kern ([email protected])
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
int64_t sample_poisson(double lambda, THGenerator* generator) {
if (lambda >= 10) {
// transformed rejection method, (Hoermann, 1993)
int64_t k;
double U, V, a, b, invalpha, vr, us;
double slam = std::sqrt(lambda);
double loglam = std::log(lambda);
b = 0.931 + 2.53 * slam;
a = -0.059 + 0.02483 * b;
invalpha = 1.1239 + 1.1328 / (b - 3.4);
vr = 0.9277 - 3.6224 / (b - 2);
while (1) {
U = THRandom_standard_uniform(generator) - 0.5;
V = THRandom_standard_uniform(generator);
us = 0.5 - std::fabs(U);
k = (int64_t)std::floor((2 * a / us + b) * U + lambda + 0.43);
if ((us >= 0.07) && (V <= vr)) {
return k;
}
if ((k < 0) || ((us < 0.013) && (V > us))) {
continue;
}
if ((std::log(V) + std::log(invalpha) - std::log(a / (us * us) + b)) <=
(-lambda + k * loglam - std::lgamma((double)k + 1))) {
return k;
}
}
} else if (lambda == 0) {
return 0;
} else {
int64_t X;
double prod, U, enlam;
enlam = std::exp(-lambda);
X = 0;
prod = 1.0;
while (1) {
U = THRandom_standard_uniform(generator);
prod *= U;
if (prod > enlam) {
X += 1;
} else {
return X;
}
}
}
}
} // namespace
namespace at {
namespace native {
Tensor bernoulli(const Tensor& self, Generator* gen) {
return at::empty_like(self).bernoulli_(self, gen);
}
Tensor bernoulli(const Tensor& self, double p, Generator* gen) {
return at::empty_like(self).bernoulli_(p, gen);
}
Tensor& bernoulli_out(Tensor& result, const Tensor& self, Generator* gen) {
// result.resize_as_(self) requires self to have same dtype as result, so we
// use resize_ instead.
// TODO: Fix resize_as_. See pytorch/pytorch#11665.
return result.resize_(self.sizes()).bernoulli_(self, gen);
}
Tensor& bernoulli_tensor_cpu_(Tensor& self, const Tensor& p_, Generator* gen) {
AT_DISPATCH_ALL_TYPES(self.type(), "bernoulli_tensor_cpu_self_", [&] {
THGenerator* generator = get_generator(gen);
std::lock_guard<std::mutex> lock(generator->mutex);
using self_t = scalar_t;
if (p_.type().scalarType() == kDouble) {
auto p = std::get<0>(expand_inplace(self, p_.to(kCPU)));
CPU_tensor_apply2<self_t, double>(
self, p, [generator](self_t& ret_val, double& p_val) {
ret_val = static_cast<self_t>(THRandom_bernoulli(generator, p_val));
});
} else {
AT_DISPATCH_FLOATING_TYPES(p_.type(), "bernoulli_tensor_cpu_p_", [&] {
auto p = std::get<0>(expand_inplace(self, p_.to(kCPU)));
using p_t = scalar_t;
CPU_tensor_apply2<self_t, p_t>(
self, p, [generator](self_t& ret_val, p_t& p_val) {
ret_val = static_cast<self_t>(THRandom_bernoulliFloat(generator, static_cast<p_t>(p_val)));
});
});
}
});
return self;
}
DEFINE_DISPATCH(bernoulli_mkl_stub);
Tensor& bernoulli_scalar_cpu_(Tensor& self, double p, Generator* gen) {
AT_CHECK(0 <= p && p <= 1, "bernoulli_ expects p to be in [0, 1], but got p=", p);
#if AT_MKL_ENABLED()
if (cpuinfo_initialize() && cpuinfo_vendor_intel == cpuinfo_get_processor(0)->core->vendor) {
bernoulli_mkl_stub(kCPU, self, p, gen);
return self;
}
#endif
AT_DISPATCH_ALL_TYPES(self.type(), "bernoulli_scalar_cpu_", [&] {
THGenerator* generator = get_generator(gen);
std::lock_guard<std::mutex> lock(generator->mutex);
CPU_tensor_apply1<scalar_t>(
self, [generator, p](scalar_t& ret_val) {
ret_val = static_cast<scalar_t>(THRandom_bernoulli(generator, p));
});
});
return self;
}
Tensor _standard_gamma_grad_cpu(const Tensor& self, const Tensor& output) {
Tensor ret = at::empty(self.sizes(), self.options());
AT_DISPATCH_FLOATING_TYPES(self.type(), "_standard_gamma_grad", [&] {
CPU_tensor_apply3<scalar_t, scalar_t, scalar_t>(ret, self, output,
[](scalar_t& ret_val, const scalar_t& self_val, const scalar_t &output_val) {
ret_val = standard_gamma_grad_one<scalar_t, double>(self_val, output_val);
}
);
});
return ret;
}
/*
* This section is a counterpart to Distributions.cu
*/
Tensor _s_poisson_cpu(const Tensor& lambda, Generator *gen) {
Tensor ret = at::zeros(lambda.sizes(), lambda.type());
AT_DISPATCH_FLOATING_TYPES(ret.type(), "poisson", [&] {
THGenerator* generator = get_generator(gen);
std::lock_guard<std::mutex> lock(generator->mutex);
CPU_tensor_apply2<scalar_t, scalar_t>(ret, lambda,
[generator](scalar_t& ret_val, const scalar_t& lambda){
ret_val = static_cast<scalar_t>(sample_poisson(static_cast<double>(lambda), generator));
}
);
});
return ret;
}
Tensor _s_gamma_cpu(const Tensor& alpha, Generator *gen) {
Tensor ret = at::zeros(alpha.sizes(), alpha.type());
AT_DISPATCH_FLOATING_TYPES(ret.type(), "gamma", [&] {
THGenerator* generator = get_generator(gen);
std::lock_guard<std::mutex> lock(generator->mutex);
CPU_tensor_apply2<scalar_t, scalar_t>(ret, alpha,
[generator](scalar_t& ret_val, const scalar_t& alpha){
BaseSampler<double> standard_uniform([generator] () {
return THRandom_standard_uniform(generator);
});
BaseSampler<double> standard_normal([generator] () {
return THRandom_normal(generator, 0.0, 1.0);
});
auto sample = sample_gamma<scalar_t, double>(alpha, standard_uniform, standard_normal);
ret_val = std::max(std::numeric_limits<scalar_t>::min(), (scalar_t) sample);
}
);
});
return ret;
}
}} // namespace at::native