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

不完全信息下随机最优化和变分问题的解

On the solution of stochastic optimization and variational problems in imperfect information regimes

Hao Jiang, Uday V. Shanbhag

摘要:

我们考虑了随机凸优化问题$\mathbb{E}[f(x;θ^*,ξ)]$在闭凸集$X$上的解,其中$θ^*$不可用,而$ξ$是一个适当定义的随机变量.相反,$θ^*$可以通过学习问题的解来获得,该学习问题需要在闭凸集$Θ$上最小化$θ$中的度量$\mathbb{E}[g(θ;η)]$。传统的方法是顺序或直接变分方法。在前者的情况下,这需要以下步骤:(i)获得学习问题的解,即$θ^*$;以及(ii)获得由$θ^*$参数化的相关计算问题的解。这些途径证明难以采用,特别是因为学习过程必须立即终止,因此,在大规模的情况下,顺序方法往往会因错误而被破坏。另一方面,变分的方法要求的问题可能是一个可能的非单调随机变分不等式问题在$(x,θ)$空间,但有没有已知的一阶随机逼近计划目前可用于解决这个问题。为了解决缺乏收敛有效的计划,我们提出了一个耦合的随机逼近计划,同时解决了计算和学习问题。所得到的计划被证明是配备了几乎必然的收敛性能的政权时,功能$f$是强凸的,以及仅仅是凸的。

英文摘要:

We consider the solution of a stochastic convex optimization problem $\mathbb{E}[f(x;θ^*,ξ)]$ over a closed and convex set $X$ in a regime where $θ^*$ is unavailable and $ξ$ is a suitably defined random variable. Instead, $θ^*$ may be obtained through the solution of a learning problem that requires minimizing a metric $\mathbb{E}[g(θ;η)]$ in $θ$ over a closed and convex set $Θ$. Traditional approaches have been either sequential or direct variational approaches. In the case of the former, this entails the following steps: (i) a solution to the learning problem, namely $θ^*$, is obtained; and (ii) a solution is obtained to the associated computational problem which is parametrized by $θ^*$. Such avenues prove difficult to adopt particularly since the learning process has to be terminated finitely and consequently, in large-scale instances, sequential approaches may often be corrupted by error. On the other hand, a variational approach requires that the problem may be recast as a possibly non-monotone stochastic variational inequality problem in the $(x,θ)$ space; but there are no known first-order stochastic approximation schemes are currently available for the solution of this problem. To resolve the absence of convergent efficient schemes, we present a coupled stochastic approximation scheme which simultaneously solves both the computational and the learning problems. The obtained schemes are shown to be equipped with almost sure convergence properties in regimes when the function $f$ is either strongly convex as well as merely convex.

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

↑