Utility-Probability Duality of Neural Networks
Not on the map. Why?
Abstract (arXiv)
It is typically understood that the training of modern neural networks is a process of fitting the probability distribution of desired output. However, recent paradoxical observations in a number of language generation tasks let one wonder if this canonical probability-based explanation can really account for the empirical success of deep learning. To resolve this issue, we propose an alternative utility-based explanation to the standard supervised learning procedure in deep learning. The basic idea is to interpret the learned neural network not as a probability model but as an ordinal utility function that encodes the preference revealed in training data. In this perspective, training of the neural network corresponds to a utility learning process. Specifically, we show that for all neural networks with softmax outputs, the SGD learning dynamic of maximum likelihood estimation (MLE) can be seen as an iteration process that optimizes the neural network toward an optimal utility function. This utility-based interpretation can explain several otherwise-paradoxical observations about the neural networks thus trained. Moreover, our utility-based theory also entails an equation that can transform the learned utility values back to a new kind of probability estimation with which probability-compatible decision rules enjoy dramatic (double-digits) performance improvements. These evidences collectively reveal a phenomenon of utility-probability duality in terms of what modern neural networks are (truly) modeling: We thought they are one thing (probabilities), until the unexplainable showed up; changing mindset and treating them as another thing (utility values) largely reconcile the theory, despite remaining subtleties regarding its original (probabilistic) identity.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 24 May 2023.
Builds on
28 of 49 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2018A Call for Clarity in Reporting BLEU Scorescited by 1,790
- 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
- 2020COMET: A Neural Framework for MT Evaluationcited by 1,024
- 2017Masked Autoregressive Flow for Density Estimationcited by 680
- 2015Sequence Level Training with Recurrent Neural Networkscited by 568
16 more
- 2018An Algorithmic Perspective on Imitation Learningcited by 455
- 2021Revisiting the Calibration of Modern Neural Networkscited by 387
- 2017Six Challenges for Neural Machine Translationcited by 334
- 2021IQ-Learn: Inverse soft-Q Learning for Imitationcited by 191
- 2020Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translationcited by 137
- 2020On Exposure Bias, Hallucination and Domain Shift in Neural Machine Translationcited by 127
- 2018Analyzing Uncertainty in Neural Machine Translationcited by 126
- 2019Bridging the Gap between Training and Inference for Neural Machine Translationcited by 123
- 2018Achieving Human Parity on Automatic Chinese to English News Translationcited by 119
- 2018Correcting Length Bias in Neural Machine Translationcited by 119
- 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
- 2019On NMT Search Errors and Model Errors: Cat Got Your Tongue?cited by 114
- 2020If beam search is the answer, what was the question?cited by 114
- 2021Revisiting the Uniform Information Density Hypothesiscited by 63
- 2018Breaking the Beam Search Curse: A Study of (Re-)Scoring Methods and Stopping Criteria for Neural Machine Translationcited by 29
- 2022Lagrangian Method for Q-Function Learning (with Applications to Machine Translation)cited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.