arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.05207cs.LGmath.OCstat.ML
收藏

在线凸优化导论

Introduction to Online Convex Optimization

Technion(以色列理工学院);Princeton University(普林斯顿大学)

Elad Hazan

AI总结:

本文提出将优化视为一个动态学习过程,强调在复杂环境中通过在线学习和经验积累进行稳健优化,并展示了该方法在现实系统中的成功应用。

摘要:

本文稿将优化描述为一个过程。在许多实际应用中,环境如此复杂,以至于无法建立一个全面的理论模型并使用经典的算法理论和数学优化方法。有必要也有益的是采取一种稳健的方法,即应用一种随着进程推进而学习的优化方法,随着问题的更多方面被观察到而从经验中学习。这种将优化视为过程的观点已在多个领域变得突出,并在建模和系统中取得了一些显著成功,这些系统如今已成为我们日常生活的一部分。

英文摘要:

This manuscript portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model and use classical algorithmic theory and mathematical optimization. It is necessary as well as beneficial to take a robust approach, by applying an optimization method that learns as one goes along, learning from experience as more aspects of the problem are observed. This view of optimization as a process has become prominent in varied fields and has led to some spectacular success in modeling and systems that are now part of our daily lives.

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

↑