Online Optimization in Dynamic Environments

07/23/2013
by   Eric C. Hall, et al.
0

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.

READ FULL TEXT

page 20

page 21

research
01/31/2020

Centralized and distributed online learning for sparse time-varying optimization

The development of online algorithms to track time-varying systems has d...
research
01/07/2013

Dynamical Models and Tracking Regret in Online Convex Programming

This paper describes a new online convex optimization method which incor...
research
10/14/2016

Improved Strongly Adaptive Online Learning using Coin Betting

This paper describes a new parameter-free online learning algorithm for ...
research
01/02/2023

Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control

Projection operations are a typical computation bottleneck in online lea...
research
11/06/2017

Online Learning for Changing Environments using Coin Betting

A key challenge in online learning is that classical algorithms can be s...
research
01/24/2022

Online AutoML: An adaptive AutoML framework for online learning

Automated Machine Learning (AutoML) has been used successfully in settin...
research
09/12/2016

Online Data Thinning via Multi-Subspace Tracking

In an era of ubiquitous large-scale streaming data, the availability of ...

Please sign up or login with your details

Forgot password? Click here to reset