Sep 2026· Mathematics of Operations Research· 1 citation· 49 references
Risk and Portfolio Optimization
Abstract
The objective of this paper is to investigate the connection between penalty functions from stochastic optimal control, convex semigroups from analysis, and convex expectations from probability theory. Our main result provides a one-to-one relation between these objects. As an application, we use the representation via penalty functions and duality arguments to show that convex expectations are determined by their finite-dimensional distributions. To illustrate this structural result, we show that the axiomatic description of G-Lévy processes in terms of finite-dimensional distributions by Hu and Peng extends uniquely to the control approach introduced by Neufeld and Nutz. Finally, we show that convex expectations with a Markovian structure are fully determined by their one-dimensional distributions, which give rise to a classical semigroup on the state space. As an application of this result, we establish a Laplace principle for entropic risk measures associated with controlled diffusions.
Funding: D. Criens gratefully acknowledges travel support from the Freiburg Center for Data Analysis, Modeling and AI.
We prove two deterministic results for families of distances arising in the study of canonical processes. The first derives an admissible partition scheme from a growth condition. The second gives a representation in terms of parameterized separation trees and compares it with the corresponding majorizing-measure quant...
This article studies mean convergence of Banach space-valued random elements indexed in a family of finite measure spaces. We derive $L^p$-convergence theorems under (compact) uniform integrability in two regimes: a decaying-index-mass regime and a bounded-index-mass regime, the latter requiring a new dependence struct...
Sang Thị Kim Nguyễn, Thuan Tran Nguyen· 0 citations
We study gradient-type dynamics for weak stochastic control through the laws of controlled diffusions on path space. Although the objective is generally nonconvex in the drift, a uniformly convex running cost induces a strictly convex functional of the corresponding path law and hence a natural Bregman geometry. We con...
Yu-Peng Bai, Louis-Pierre Chaintron, Zhen-Jie Ren et al.· 0 citations
We study a penalisation problem for two-dimensional Brownian motion. Starting from the Wiener measure, we consider a family of probability measures obtained by weighting paths by a nonnegative functional $F_t$ depending on $t \geq 0$, $F_t$ being measurable with respect to the $\sigma$-algebra generated by the path up...
Joseph Najnudel, Thammadol Tansrivorarat· 0 citations
This work introduces the class $\mathcal{P}_\psi(\mu)$ of measures that differ from a reference measure only through a finite-dimensional map $\psi$ while preserving the reference conditionals on its fibers, and develops approximation theory for fitting within it.
R. Baptista, Bamdad Hosseini, Alexander Hsu· 0 citations
Learning mappings between probability distributions arises naturally when inputs and outputs are represented by populations of samples rather than individual observations. We develop an approximation-theoretic framework for distribution-to-distribution learning and extend it to mappings between stochastic processes. Fo...
Yi-Chen Wang, Zi-Yi Wang, Wen-Lian Lu et al.· 0 citations
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.