arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.10398math.OCcs.LGcs.SYeess.SY

A Kernel Mean Embedding Approach to Reducing Conservativeness in Stochastic Programming and Control

Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);University of Freiburg(弗莱堡大学)

Jia-Jie Zhu, Moritz Diehl, Bernhard Schölkopf

英文摘要:

We apply kernel mean embedding methods to sample-based stochastic optimization and control. Specifically, we use the reduced-set expansion method as a way to discard sampled scenarios. The effect of such constraint removal is improved optimality and decreased conservativeness. This is achieved by solving a distributional-distance-regularized optimization problem. We demonstrated this optimization formulation is well-motivated in theory, computationally tractable and effective in numerical algorithms.

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

↑