Online Learning with Inexact Proximal Online Gradient Descent Algorithms
Rishabh Dixit, Amrit Singh Bedi, Ruchi Tripathi, and Ketan Rajawat

TL;DR
This paper introduces an inexact proximal online gradient descent algorithm for non-differentiable dynamic optimization, capable of handling gradient errors and large-scale problems, with applications in robotics and video processing.
Contribution
It proposes a novel inexact proximal OGD algorithm that accounts for gradient errors and is suitable for large-scale, time-varying optimization problems.
Findings
Algorithm effectively tracks dynamic targets with adversarial errors.
Variance reduction improves scalability for large problems.
Successful applications in robotics formation control and video separation.
Abstract
We consider non-differentiable dynamic optimization problems such as those arising in robotics and subspace tracking. Given the computational constraints and the time-varying nature of the problem, a low-complexity algorithm is desirable, while the accuracy of the solution may only increase slowly over time. We put forth the proximal online gradient descent (OGD) algorithm for tracking the optimum of a composite objective function comprising of a differentiable loss function and a non-differentiable regularizer. An online learning framework is considered and the gradient of the loss function is allowed to be erroneous. Both, the gradient error as well as the dynamics of the function optimum or target are adversarial and the performance of the inexact proximal OGD is characterized in terms of its dynamic regret, expressed in terms of the cumulative error and path length of the target.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
