Explicit update vs implicit update

In this paper, the problem of implicit online learning is considered. A tighter convergence bound is derived, which demonstrates theoretically the feasibility of implicit update for online learning. Then we combine SMD with implicit update technique and the resulting algorithm possesses the inherent stability. Theoretical result is well corroborated by the experiments we performed which also indicate that combining SMD with implicit update technique is another promising way for online learning.