Optimal payoff under Bregman-Wasserstein divergence constraints
We study optimal payoff choice for an expected utility maximizer under the constraint that their payoff is not allowed to deviate ``too much'' from a given benchmark. We solve this problem when the deviation is assessed via a Bregman-Wasserstein (BW) divergence, generated by a convex function $\phi$. Unlike the Wasserstein distance (i.e., when $\phi(x)=x^2$). The inherent asymmetry of the BW divergence makes it possible to penalize positive deviations different than negative ones. As a main contribution, we provide the optimal payoff in this setting. Numerical examples illustrate that the choice of $\phi$ allow to better align the payoff choice with the objectives of investors.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Optimal Transport Divergences induced by Scoring Functions
We employ scoring functions, used in statistics for eliciting risk functionals, as cost functions in the Monge-Kantorovich (MK) optimal transport problem. This gives raise to a rich variety of novel asymmetric MK diverge…
Transport information Bregman divergences
We study Bregman divergences in probability density space embedded with the $L^2$-Wasserstein metric. Several properties and dualities of transport Bregman divergences are provided. In particular, we derive the transport…
Ambiguity set and learning via Bregman and Wasserstein
Construction of ambiguity set in robust optimization relies on the choice of divergences between probability distributions. In distribution learning, choosing appropriate probability distributions based on observed data …
BIG-bench Machine LearningA Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimization
We study a stochastic first order primal-dual method for solving convex-concave saddle point problems over real reflexive Banach spaces using Bregman divergences and relative smoothness assumptions, in which we allow for…
On the connection between Bregman divergence and value in regularized Markov decision processes
In this short note we derive a relationship between the Bregman divergence from the current policy to the optimal policy and the suboptimality of the current value function in a regularized Markov decision process. This …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)