arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.12352math.PRcond-mat.stat-mechmath.OCmath.STstat.TH
收藏

紧期望不等式的一个凸分析方法

A convex analysis approach to tight expectation inequalities

André M. Timpanaro

摘要:

在这项工作中,我们调查的问题,如何知识的期望$\mathbb{E}(f_i(X))$的随机向量$X$转化为不等式$\mathbb{E}(g(X))$为给定的功能$f_i$,$g$和随机向量$X$的支持包含在一些设置$S\subseteq \mathbb{R}^n$。我们表明,在这种情况下,获得紧期望不等式的问题和凸包的性质之间存在联系,使我们能够将其改写为一个最优化问题。这些优化问题的结果不仅达到了$\mathbb{E}(g(X))$的精确边界,而且在某些情况下还产生了离散的概率测度,其中等式成立。我们开发了一种分析方法,特别适合于研究詹森间隙问题时,已知的信息是平均值和方差,以及一般情况下的数值方法,减少了问题的凸优化,这在某种意义上扩展了已知的结果矩问题。

英文摘要:

In this work, we investigate the question of how knowledge about expectations $\mathbb{E}(f_i(X))$ of a random vector $X$ translate into inequalities for $\mathbb{E}(g(X))$ for given functions $f_i$, $g$ and a random vector $X$ whose support is contained in some set $S\subseteq \mathbb{R}^n$. We show that there is a connection between the problem of obtaining tight expectation inequalities in this context and properties of convex hulls, allowing us to rewrite it as an optimization problem. The results of these optimization problems not only arrive at sharp bounds for $\mathbb{E}(g(X))$ but in some cases also yield discrete probability measures where equality holds. We develop an analytical approach that is particularly suited for studying the Jensen gap problem when the known information are the average and variance, as well as a numerical approach for the general case, that reduces the problem to a convex optimization; which in a sense extends known results about the moment problem.

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

↑