REVIEW 1 cited by
Robust Bi-Tempered Logistic Loss Based on Bregman Divergences
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce a temperature into the exponential function and replace the softmax output layer of neural nets by a high temperature generalization. Similarly, the logarithm in the log loss we use for training is replaced by a low temperature logarithm. By tuning the two temperatures we create loss functions that are non-convex already in the single layer case. When replacing the last layer of the neural nets by our bi-temperature generalization of logistic loss, the training becomes more robust to noise. We visualize the effect of tuning the two temperatures in a simple setting and show the efficacy of our method on large data sets. Our methodology is based on Bregman divergences and is superior to a related two-temperature method using the Tsallis divergence.
Forward citations
Cited by 1 Pith paper
-
Perspectives on Tsallis Statistics for Artificial Intelligence
Independent AI methods, including sparsemax attention, Tsallis-entropy reinforcement learning, Student-t generative models, and robust losses, are instances of a single 'q-dial' deformation of Boltzmann-Gibbs statisti...
Discussion (0). Sign in to comment.