paper-with-me

홈 › Papers

Utility-Probability Duality of Neural Networks

2023-05-24 · Huang Bojun, Fei Yuan

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.

📄 PDF Abstract BibTeX arXiv:2305.14859

Code (0)

등록된 구현이 없습니다.

Tasks

Text Generation

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

A duality between utility transforms and probability distortions

2023-08-25 · Christopher P. Chambers, Peng Liu, Ruodu Wang

In this paper, we establish a mathematical duality between utility transforms and probability distortions. These transforms play a central role in decision under risk by forming the foundation for the classic theories of…

Duality Theory for Exponential Utility--Based Hedging in the Almgren--Chriss Model

2022-10-08 · Yan Dolinsky

In this paper, we obtain a duality result for the exponential utility maximization problem where trading is subject to quadratic transaction costs and the investor is required to liquidate her position at the maturity da…

Position

Duality Theory for Robust Utility Maximisation

2020-07-16 · Daniel Bartl, Michael Kupper, Ariel Neufeld

In this paper we present a duality theory for the robust utility maximisation problem in continuous time for utility functions defined on the positive real axis. Our results are inspired by -- and can be seen as the robu…

Convex duality for stochastic differential utility

2016-01-14

This paper introduces a dual problem to study a continuous-time consumption and investment problem with incomplete markets and stochastic differential utility. For Epstein-Zin utility, duality between the primal and dual…

Dynamic Convex Duality in Constrained Utility Maximization

2016-12-13

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the …