arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.18786math.OCcs.NAmath.NAstat.ME
收藏

一类条件随机优化问题的无偏梯度

Unbiased Gradients for a Class of Conditional Stochastic Optimization Problems

King Abdullah University of Science and Technology(阿卜杜拉国王科技大学);The Chinese University of Hong Kong(香港中文大学)

Miguel Alvarez, Ajay Jasra

AI总结:

本文研究了一类条件随机优化问题,提出了一种结合马尔可夫随机近似与无偏近似方法的新方法,用于求解此类问题的最优解,并通过参数估计与高维全因子多元随机波动率模型的实例进行了验证。

摘要:

在本文中,我们考虑了条件随机优化(CSO)问题。该问题涉及优化一个函数,该函数可以表示为另一个函数的期望,而该函数本身是条件期望的函数,即类型 $F(ξ) := \mathbb{E}\left[f\left(Z,\mathbb{E}[g(Z,X,ξ)|Z] ight) ight]$,其中精确定义在正文中给出。我们处理了一类特定的CSO问题,其中随机变量 $X,Z$ 的联合分布无法精确采样;这一情况已在Goda & Kitade (2023)中得到解决。我们引入了一种方法,将马尔可夫随机近似与无偏近似方法相结合,从而能够在感兴趣的上下文中找到 $F(ξ)$ 的最优解。我们通过两个例子来说明我们的方法,这两个例子与参数估计中的模型平均和高维全因子多元随机波动率模型相关的投资组合选择有关。

英文摘要:

In this paper we consider the conditional stochastic optimization (CSO) problem. This consists of optimizing a function which can be written as the expectation of a function which is itself a function of a conditional expectation, i.e.~of the type $F(ξ) := \mathbb{E}\left[f\left(Z,\mathbb{E}[g(Z,X,ξ)|Z]\right)\right]$, where precise definitions are given in the main text. We address a particular class of CSO problems where the joint law of the random variables $X,Z$ cannot be exactly sampled; this case has been addressed in Goda & Kitade (2023). We introduce a method that combines Markovian stochastic approximation with unbiased approximation methods which allows one to find the optimizer of $F(ξ)$ in the context of interest. We illustrate our methodology on two examples associated to parameter estimation with model averaging and portfolio selection associated to high-dimensional full factor multivariate stochastic volatility models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑