Sha256: 68e1d4d5e75e50afa18a8ee735c1c1ba29b9e41fc60f66362c48073b779fb0da
Contents?: true
Size: 1.01 KB
Versions: 19
Compression:
Stored size: 1.01 KB
Contents
// First naive implementation
% c_dtype = dtype_to_c_type(dtype)
__kernel void softmax_cross_<%= dtype %>(const int N,
const __global <%= c_dtype %>* A,
const __global <%= c_dtype %>* L,
__global <%= c_dtype %>* C, __global <%= c_dtype %>* P) {
// Get the index of the current element to be processed
const int globalRow = get_global_id(0); // Row ID of C (0..M)
// Compute a single element (loop over K)
<%= c_dtype %> acc = 0.0f;
<%= c_dtype %> max = <%= min_value_for(dtype) %>;
for (int k=0; k<N; k++) {
max = A[globalRow*N + k] > max ? A[globalRow*N + k] : max;
}
for (int k=0; k<N; k++) {
acc += exp(A[globalRow*N + k] - max);
}
// Store the result
for (int k=0; k < N; k++) {
C[globalRow*N + k] = (log(acc) - (A[globalRow*N + k] - max)) * L[globalRow*N + k];
}
for (int k=0; k < N; k++) {
P[globalRow*N + k] = (exp(A[globalRow*N + k] - max) / acc) - L[globalRow*N + k];
}
}
Version data entries
19 entries across 19 versions & 2 rubygems