arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.01797math.OCmath.FA
收藏

凸多目标optimization的随机逼近

Stochastic Approximation in convex multiobjective optimization

Carlo Alberto De Bernardi, Enrico Miglierina, Elena Molho, Jacopo Somaglia

摘要:

给定一个以$f_1,\dots,f_N$为目标函数的严格凸多目标最优化问题,用$x_0$表示其解,该解是线性标量化问题的极小点,其中目标函数是$f_1,\dots,f_N$与权$t_1,\ldots,t_N$的凸组合.本文的主要结果给出了一个估计的平均误差,如果我们近似$x_0$的最小点的凸组合的$n$功能,选择$f_1,\dots,f_N$,概率$t_1,\ldots,t_N$,分别与相同的系数$1/n$加权。特别是,我们证明了上述考虑的平均误差收敛到0的$n$去$\infty$,均匀w.r.t.权重$t_1,\ldots,t_N$。在我们的随机逼近定理的证明中的关键工具是一个几何性质,我们称之为小直径属性,确保函数$f_1,\dots,f_N$的凸组合的最小点连续依赖于凸组合的系数。

英文摘要:

Given a strictly convex multiobjective optimization problem with objective functions $f_1,\dots,f_N$, let us denote by $x_0$ its solution, obtained as minimum point of the linear scalarized problem, where the objective function is the convex combination of $f_1,\dots,f_N$ with weights $t_1,\ldots,t_N$. The main result of this paper gives an estimation of the averaged error that we make if we approximate $x_0$ with the minimum point of the convex combinations of $n$ functions, chosen among $f_1,\dots,f_N$, with probabilities $t_1,\ldots,t_N$, respectively, and weighted with the same coefficient $1/n$. In particular, we prove that the averaged error considered above converges to 0 as $n$ goes to $\infty$, uniformly w.r.t. the weights $t_1,\ldots,t_N$. The key tool in the proof of our stochastic approximation theorem is a geometrical property, called by us small diameter property, ensuring that the minimum point of a convex combination of the function $f_1,\dots,f_N$ continuously depends on the coefficients of the convex combination.

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

↑