Analysing Iterative Machine Learning Algorithims with Information Geometric Methods

Online machine learning problems arise from situations where data is provided a point at a time. There are many classical algorithms for solving such problems based on the principle of stochastic gradient descent. Recent research by the CIs and others have thrown up interesting but diverse geometric connections that offer new insights. The proposed research aims to integrate the understanding of these algorithms with the aim of designing algorithms better able to exploit prior knowledge, and to extend existing algorithms to new problem domains thus offering well principled and well understood algorithms for solving a variety of novel online problems.