Skip to main content

Softmax + NLL + Cross-Entropy Classification


Softmax + NLL and Cross-Entropy Theory

1. Key Purpose of Using Softmax + NLL

Main idea:

To convert raw model outputs into a valid probability distribution and then measure how well the model matches the true class — in a numerically stable way.

1.1 Softmax Turns Logits into Probabilities

A neural network outputs raw scores (logits), for example:

[2.3, -1.2, 0.7]

These are not probabilities. Softmax converts them into a probability distribution:

\( p_i = \frac{e^{z_i}}{\sum_{j} e^{z_j}} \)

This is required because NLL operates on probabilities.

1.2 NLL Measures the Likelihood of the Correct Class

NLL looks only at the predicted probability of the true class:

\( \text{NLL} = -\log(p_y) \)
  • High probability → small loss
  • Low probability → large loss

Thus, it encourages the model to increase the probability of the correct class.

1.3 Combined Effect: Probabilistic Learning

Softmax + NLL together lead to:

  • Sharper probability distributions
  • Higher confidence in correct predictions
  • Better class separation

1.4 Numerical Stability

Frameworks compute:

log_softmax → NLL

instead of:

softmax → log → NLL

to avoid overflow/underflow issues with exponentials and logarithms.

1.5 One-Sentence Summary

Softmax produces probabilities, and NLL evaluates how well they match the true class — giving a strong and stable learning signal.

2. Theory of Cross-Entropy

2.1 Origin from Information Theory

Cross-entropy measures how different two probability distributions are: a true distribution \( p \) and predicted distribution \( q \).

\( H(p, q) = -\sum_{i} p(i)\,\log q(i) \)

Interpretation: How many bits are needed to encode data from \( p \) when using a code optimized for \( q \)?

2.2 Cross-Entropy in Machine Learning

For classification, the true distribution is usually one-hot. Example:

p = [0, 0, 1, 0]

Cross-entropy simplifies to:

\( H(p,q) = -\log q(\text{true class}) \)

This is exactly the negative log-likelihood (NLL). Thus:

Cross-entropy = Softmax + NLL.

2.3 Why Use Cross-Entropy?

  • Rewards high probability for the correct class
  • Penalizes confident wrong predictions

2.4 Relationship with Entropy and KL Divergence

Entropy:

\( H(p) = -\sum_i p(i)\log p(i) \)

Cross-entropy:

\( H(p,q) = -\sum_i p(i)\log q(i) \)

KL divergence:

\( D_{\mathrm{KL}}(p\parallel q) = H(p,q) - H(p) \)

In classification, \( H(p) \) is constant, so minimizing \( H(p,q) \) also minimizes KL divergence.

2.5 Why Cross-Entropy Is the Best Loss for Classification

  • Correct probabilistic interpretation
  • Convex for logistic regression
  • Provides strong, informative gradients
  • Derived directly from maximum likelihood estimation

2.6 Cross-Entropy as Maximum Likelihood

Softmax model:

\( q(i) = \frac{e^{z_i}}{\sum_j e^{z_j}} \)

Likelihood of true class \( y \):

\( L = q(y) \)

Maximizing likelihood is equivalent to minimizing:

\( -\log L = -\log q(y) \)

This is exactly cross-entropy.

2.7 Summary Table

Concept Meaning
Softmax Converts logits into probabilities
NLL Penalizes low probability for correct class
Cross-entropy Measures mismatch between true and predicted distributions
Theory From information theory + maximum likelihood

Further Reading

  1.  

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

Constellation Diagrams of ASK, PSK, and FSK

📘 Overview of Energy per Bit (Eb / N0) 🧮 Online Simulator for constellation diagrams of ASK, FSK, and PSK 🧮 Theory behind Constellation Diagrams of ASK, FSK, and PSK 🧮 MATLAB Codes for Constellation Diagrams of ASK, FSK, and PSK 📚 Further Reading 📂 Other Topics on Constellation Diagrams of ASK, PSK, and FSK ... 🧮 Simulator for constellation diagrams of m-ary PSK 🧮 Simulator for constellation diagrams of m-ary QAM BASK (Binary ASK) Modulation: Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1.    BFSK (Binary FSK) Modulation: Transmits one of two signals: +√Eb​ ( On the y-axis, the phase shift of 90 degrees with respect to the x-axis, which is also termed phase offset ) or √Eb (on x-axis), where Eb​ is the energy per bit. These signals represent binary 0 and 1.  BPSK (Binary PSK) Modulation: Transmits one of two signals...

Fading : Slow & Fast and Large & Small Scale Fading

📘 Overview 📘 LARGE SCALE FADING 📘 SMALL SCALE FADING 📘 SLOW FADING 📘 FAST FADING 🧮 MATLAB Codes 📚 Further Reading LARGE SCALE FADING The term 'Large scale fading' is used to describe variations in received signal power over a long distance, usually just considering shadowing.  Assume that a transmitter (say, a cell tower) and a receiver  (say, your smartphone) are in constant communication. Take into account the fact that you are in a moving vehicle. An obstacle, such as a tall building, comes between your cell tower and your vehicle's line of sight (LOS) path. Then you'll notice a decline in the power of your received signal on the spectrogram. Large-scale fading is the term for this type of phenomenon. SMALL SCALE FADING  Small scale fading is a term that describes rapid fluctuations in the received signal power on a small time scale. This includes multipath propagation effects as well as movement-induced Doppler fr...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   Start Simulator for binary ASK Modulation Message Bits (e.g. 1,0,1,0) Carrier Frequency (Hz) Sampling Frequency (Hz) Run Simulation Simulator for binary FSK Modulation Input Bits (e.g. 1,0,1,0) Freq for '1' (Hz) Freq for '0' (Hz) Sampling Rate (Hz) Visualize FSK Signal Simulator for BPSK Modulation ...

DFTs-OFDM vs OFDM: Why DFT-Spread OFDM Reduces PAPR Effectively (with MATLAB Code)

DFT-spread OFDM (DFTs-OFDM) has lower Peak-to-Average Power Ratio (PAPR) because it "spreads" the data in the frequency domain before applying IFFT, making the time-domain signal behave more like a single-carrier signal rather than a multi-carrier one like OFDM. Deeper Explanation: Aspect OFDM DFTs-OFDM Signal Type Multi-carrier Single-carrier-like Process IFFT of QAM directly QAM → DFT → IFFT PAPR Level High (due to many carriers adding up constructively) Low (less fluctuation in amplitude) Why PAPR is High Subcarriers can add in phase, causing spikes DFT "pre-spreads" data, smoothing it Used in Wi-Fi, LTE downlink LTE uplink (as SC-FDMA) In OFDM, all subcarriers can...

Theoretical BER vs SNR for binary ASK, FSK, and PSK

📘 Overview & Theory 🧮 MATLAB Codes 📚 Further Reading Theoretical BER vs SNR for Amplitude Shift Keying (ASK) The theoretical Bit Error Rate (BER) for binary ASK depends on how binary bits are mapped to signal amplitudes. For typical cases: If bits are mapped to 1 and -1, the BER is: BER = Q(√(2 × SNR)) If bits are mapped to 0 and 1, the BER becomes: BER = Q(√(SNR / 2)) Where: Q(x) is the Q-function: Q(x) = 0.5 × erfc(x / √2) SNR : Signal-to-Noise Ratio N₀ : Noise Power Spectral Density Understanding the Q-Function and BER for ASK Bit '0' transmits noise only Bit '1' transmits signal (1 + noise) Receiver decision threshold is 0.5 BER is given by: P b = Q(0.5 / σ) , where σ = √(N₀ / 2) Using SNR = (0.5)² / N₀, we get: BER = Q(√(SNR / 2)) Theoretical BER vs ...

MATLAB Code for ASK, FSK, and PSK

📘 Overview & Theory 🧮 MATLAB Code for ASK 🧮 MATLAB Code for FSK 🧮 MATLAB Code for PSK 🧮 Simulator for binary ASK, FSK, and PSK Modulations 📚 Further Reading ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation % The code is written by SalimWireless.Com % Clear previous data and plots clc; clear all; close all; % Parameters Tb = 1; % Bit duration (s) fc = 10; % Carrier frequency (Hz) N_bits = 10; % Number of bits Fs = 100 * fc; % Sampling frequency (ensure at least 2*fc, more for better representation) Ts = 1/Fs; % Sampling interval samples_per_bit = Fs * Tb; % Number of samples per bit duration % Generate random binary data rng(10); % Set random seed for reproducibility binary_data = randi([0, 1], 1, N_bits); % Generate random binary data (0 or 1) % Initialize arrays for continuous signals t_overall = 0:Ts:(N_bits...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...

📘 Overview of BER and SNR 🧮 Online Simulator for BER calculation of m-ary QAM and m-ary PSK 🧮 MATLAB Code for BER calculation of M-ary QAM, M-ary PSK, QPSK, BPSK, ... 📚 Further Reading 📂 View Other Topics on M-ary QAM, M-ary PSK, QPSK ... 🧮 Online Simulator for Constellation Diagram of m-ary QAM 🧮 Online Simulator for Constellation Diagram of m-ary PSK 🧮 MATLAB Code for BER calculation of ASK, FSK, and PSK 🧮 MATLAB Code for BER calculation of Alamouti Scheme 🧮 Different approaches to calculate BER vs SNR What is Bit Error Rate (BER)? The abbreviation BER stands for Bit Error Rate, which indicates how many corrupted bits are received (after the demodulation process) compared to the total number of bits sent in a communication process. BER = (number of bits received in error) / (total number of tran...

Theoretical BER vs SNR for m-ary PSK and QAM

Relationship Between Bit Error Rate (BER) and Signal-to-Noise Ratio (SNR) The relationship between Bit Error Rate (BER) and Signal-to-Noise Ratio (SNR) is a fundamental concept in digital communication systems. Here’s a detailed explanation: BER (Bit Error Rate): The ratio of the number of bits incorrectly received to the total number of bits transmitted. It measures the quality of the communication link. SNR (Signal-to-Noise Ratio): The ratio of the signal power to the noise power, indicating how much the signal is corrupted by noise. Relationship The BER typically decreases as the SNR increases. This relationship helps evaluate the performance of various modulation schemes. BPSK (Binary Phase Shift Keying) Simple and robust. BER in AWGN channel: BER = 0.5 × erfc(√SNR) Performs well at low SNR. QPSK (Quadrature...