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

鲁棒凸优化的在线一阶框架

Online First-Order Framework for Robust Convex Optimization

Nam Ho-Nguyen, Fatma Kilinc-Karzan

摘要:

鲁棒优化(RO)已经成为有效地建模参数不确定性的主要范例之一。RO与统计和机器学习领域中的问题之间的联系要求在更大的范围内解决RO问题。然而,传统的方法来解决RO配方的基础上建立和解决强大的同行或迭代的方法,利用名义可行性预言可能是昂贵的,从而显着阻碍了RO范式的可扩展性。在本文中,我们提出了一个通用的和灵活的迭代框架,近似解决鲁棒凸优化问题,是建立在一个完全在线的一阶范式。与现有文献相比,我们的方法的一个关键区别特征是,它只需要访问一阶预言机,比pessimization或名义可行性预言机便宜得多,同时保持相同的收敛速度。特别是,这使得我们的方法更具可扩展性,因此在大规模应用中更可取,特别是那些来自机器学习和统计领域的应用。我们还提供了新的解释现有的迭代方法在我们的框架,并说明我们的框架上的强大的二次规划。

英文摘要:

Robust optimization (RO) has emerged as one of the leading paradigms to efficiently model parameter uncertainty. The recent connections between RO and problems in statistics and machine learning domains demand for solving RO problems in ever more larger scale. However, the traditional approaches for solving RO formulations based on building and solving robust counterparts or the iterative approaches utilizing nominal feasibility oracles can be prohibitively expensive and thus significantly hinder the scalability of RO paradigm. In this paper, we present a general and flexible iterative framework to approximately solve robust convex optimization problems that is built on a fully online first-order paradigm. In comparison to the existing literature, a key distinguishing feature of our approach is that it only requires access to first-order oracles that are remarkably cheaper than pessimization or nominal feasibility oracles, while maintaining the same convergence rates. This, in particular, makes our approach much more scalable and hence preferable in large-scale applications, specifically those from machine learning and statistics domains. We also provide new interpretations of existing iterative approaches in our framework and illustrate our framework on robust quadratic programming.

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

↑