Categorical Cross-Entropy Loss

A multi-class classifier outputs one probability per class (for example from softmax). Categorical cross-entropy punishes it for giving the correct class a low probability:

loss = -(ln(p₁) + ln(p₂) + … + ln(pₙ)) / n

where pᵢ is the probability the model gave to the correct class of sample i. To avoid ln(0), first raise any probability below 0.0000001 to 0.0000001.

Implement categorical_cross_entropy(probabilities, labels).

Input

probabilities: One row per sample, with one probability per class.

labels: The index of the correct class for each sample (0-based).

Output

Return the average loss as a decimal number.

เงื่อนไข

1 ≤ samples ≤ 1,000, 2 ≤ classes ≤ 100

0 ≤ each probability ≤ 1

0 ≤ labels[i] < number of classes

ตัวอย่าง

อินพุต:
labels = [0, 1]
probabilities = [
    [0.7, 0.2, 0.1],
    [0.1, 0.8, 0.1]
]

ผลลัพธ์ที่คาดหวัง:
expected = 0.289909

อินพุต:
std::vector<long long> labels = {0, 1};
std::vector<std::vector<double>> probabilities = {
    {0.7, 0.2, 0.1},
    {0.1, 0.8, 0.1}
};

ผลลัพธ์ที่คาดหวัง:
double expected = 0.289909;

อินพุต:
long[] labels = new long[] {0, 1};
double[][] probabilities = new double[][] {
    new double[] {0.7, 0.2, 0.1},
    new double[] {0.1, 0.8, 0.1}
};

ผลลัพธ์ที่คาดหวัง:
double expected = 0.289909;

อินพุต:
labels = [1]
probabilities = [
    [1.0, 0.0]
]

ผลลัพธ์ที่คาดหวัง:
expected = 16.118096

อินพุต:
std::vector<long long> labels = {1};
std::vector<std::vector<double>> probabilities = {
    {1.0, 0.0}
};

ผลลัพธ์ที่คาดหวัง:
double expected = 16.118096;

อินพุต:
long[] labels = new long[] {1};
double[][] probabilities = new double[][] {
    new double[] {1.0, 0.0}
};

ผลลัพธ์ที่คาดหวัง:
double expected = 16.118096;

แหล่งอ้างอิง

โจทย์นี้ปรับให้เหมาะกับ CodeUtility กรุณาทำตามคำชี้แจงและข้อจำกัดด้านบน

• scikit-learn, log_loss
• Goodfellow, Bengio and Courville, Deep Learning