multinomial_with_replacement_apply Class — pytorch Architecture
Architecture documentation for the multinomial_with_replacement_apply class in MultinomialKernel.cpp from the pytorch codebase.
Entity Profile
Source Code
aten/src/ATen/native/cpu/MultinomialKernel.cpp lines 117–211
template <typename scalar_t>
typename std::enable_if_t<is_reduced_floating_point_v<scalar_t>, void>
multinomial_with_replacement_apply(
Tensor& result,
const Tensor& self,
const int64_t n_sample,
std::optional<Generator> generator) {
auto gen = get_generator_or_default<CPUGeneratorImpl>(
generator, detail::getDefaultCPUGenerator());
// See Note [Acquire lock when using random generators]
std::lock_guard<std::mutex> lock(gen->mutex_);
int64_t n_categories = self.size(-1);
int64_t n_dist = self.dim() > 1 ? self.size(-2) : 1;
/* cumulative probability distribution vector */
Tensor cum_dist = at::empty({n_categories}, self.options().dtype(kFloat));
const scalar_t* const self_ptr = self.const_data_ptr<scalar_t>();
float* const cum_dist_ptr = cum_dist.data_ptr<float>();
int64_t* const result_ptr = result.data_ptr<int64_t>();
auto self_stride_0 = self.dim() > 1 ? self.stride(-2) : 0;
auto self_stride_1 = self.stride(-1);
auto cum_dist_stride_0 = cum_dist.stride(0);
auto result_dist_stride_0 = result.dim() > 1 ? result.stride(-2) : 0;
auto result_dist_stride_1 = result.stride(-1);
for (const auto i : c10::irange(n_dist)) {
/* Get normalized cumulative distribution from prob distribution */
float sum = 0;
for (const auto j : c10::irange(n_categories)) {
float val = self_ptr[i * self_stride_0 + j * self_stride_1];
TORCH_CHECK(
val >= 0,
"invalid multinomial distribution (encountering probability entry < 0)");
// NB: std::isfinite doesn't bode well with libc++ for half datatypes,
// so we manually cast it to a double and perform the check.
#if defined(_LIBCPP_VERSION)
TORCH_CHECK(
std::isfinite(static_cast<double>(val)),
"invalid multinomial distribution (encountering probability entry = infinity or NaN)");
#else
TORCH_CHECK(
std::isfinite(val),
"invalid multinomial distribution (encountering probability entry = infinity or NaN)");
#endif
sum += val;
cum_dist_ptr[j * cum_dist_stride_0] = sum;
}
TORCH_CHECK(
sum > 0,
"invalid multinomial distribution (sum of probabilities <= 0)");
/* normalize cumulative probability distribution so that last val is 1
i.e. doesn't assume original self row sums to one */
if ((sum > 0) || ((sum < 1.00001) && (sum > 0.99999))) {
for (const auto j : c10::irange(n_categories)) {
cum_dist_ptr[j * cum_dist_stride_0] /= sum;
}
}
for (const auto j : c10::irange(n_sample)) {
/* sample a probability mass from a uniform distribution */
at::uniform_real_distribution<double> uniform(0, 1);
double uniform_sample = uniform(gen);
/* Do a binary search for the slot in which the prob falls
ie cum_dist[row][slot-1] < uniform_prob < cum_distr[row][slot] */
int64_t left_pointer = 0;
int64_t right_pointer = n_categories;
/* Make sure the last cumulative distribution bucket sums to 1 */
cum_dist_ptr[(n_categories - 1) * cum_dist_stride_0] = 1;
while (right_pointer - left_pointer > 0) {
int64_t mid_pointer = left_pointer + (right_pointer - left_pointer) / 2;
float cum_prob = cum_dist_ptr[mid_pointer * cum_dist_stride_0];
if (cum_prob < uniform_sample) {
left_pointer = mid_pointer + 1;
} else {
right_pointer = mid_pointer;
}
}
auto sample_idx = left_pointer;
/* store in result tensor (will be incremented for lua compat by wrapper)
*/
result_ptr[i * result_dist_stride_0 + j * result_dist_stride_1] =
sample_idx;
}
}
}
Source
Analyze Your Own Codebase
Get architecture documentation, dependency graphs, and domain analysis for your codebase in minutes.
Try Supermodel Free