arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.5944stat.MLcs.LGmath.OC
收藏

动态环境中的在线优化

Online Optimization in Dynamic Environments

Duke University(杜克大学);University of Wisconsin-Madison(威斯康星大学麦迪逊分校)

Eric C. Hall, Rebecca M. Willett

摘要:

高维数据的高速流在一系列应用和设置中提出了重大的“大数据”分析挑战。在线学习和在线凸规划在从这些大型数据流中快速恢复重要或异常信息方面发挥着重要作用。虽然在线学习的最新进展已经导致了新颖且快速收敛的算法,但这些方法无法适应现实世界问题中出现的非平稳环境。本文介绍了一个动态镜像下降框架,解决了这一挑战,产生低理论遗憾的界限和准确的,自适应的,计算效率高的算法,适用于广泛的问题。该方法能够学习和适应一个潜在的和可能随时间变化的动态模型。实证结果的背景下,动态纹理分析,太阳耀斑检测,连续压缩感知的动态场景,交通监控,跟踪自激点过程和网络行为的安然电子邮件语料库支持的核心理论研究结果。

英文摘要:

High-velocity streams of high-dimensional data pose significant "big data" analysis challenges across a range of applications and settings. Online learning and online convex programming play a significant role in the rapid recovery of important or anomalous information from these large datastreams. While recent advances in online learning have led to novel and rapidly converging algorithms, these methods are unable to adapt to nonstationary environments arising in real-world problems. This paper describes a dynamic mirror descent framework which addresses this challenge, yielding low theoretical regret bounds and accurate, adaptive, and computationally efficient algorithms which are applicable to broad classes of problems. The methods are capable of learning and adapting to an underlying and possibly time-varying dynamical model. Empirical results in the context of dynamic texture analysis, solar flare detection, sequential compressed sensing of a dynamic scene, traffic surveillance,tracking self-exciting point processes and network behavior in the Enron email corpus support the core theoretical findings.

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

↑