Open Access Open Access  Restricted Access Subscription or Fee Access

Online Learning Algorithm for Multi-Kernel Balancing of Computational Work Load

Ankush Rai

Abstract


The online learning is an advancement made toward the extended machine learning approach where the application is web-based. Thus, the common problem to build a kernel based online perceptron algorithm is the amount of memory required to dynamically access for the so formed hypothesis derivable from the algorithm. As it tends to increase without a lower bound; also the computational load of such an algorithm increases linearly with the memory chunk used to build the hypothesis. Though, the previous works are focused towards discarding the instances of online hypothesis from the perceptron algorithm in order to reserve the computational work load within the bounded memory. Therefore, in this study we presented a work which dynamically creates an Online Chain Reaction Algorithm (OCRA) for keeping the checkpoint trees of hypothesis with the varying memory instances; which makes the online learning more dynamics and invariant of the pre-requisite amount of memory required.

Keywords: online learning, kernel methods, distributed computation workload


Full Text:

PDF

References


Freund Y., Schapire R. E. Large Margin Classification using the Perceptron Algorithm. Mach Learn 1999; 277–296p.

Crammer K., Singer Y. Ultraconservative Online Algorithms for Multiclass Problems. J Mach Learn Res 2003; 3: 951–991p.

Crammer K., Kandola J., Singer Y. Online Classification on a Budget. In Adv Neural Info Process Syst 2003; 16: 225–232p.

Crammer K., Dekel O., Keshet J., et al. Online Passive-aggressive Algorithms. J Mach Learn Res 2006; 7: 551–585p.

Kivinen J., Smola A., Williamson R. Online Learning with Kernels. IEEE T Signal Process 2004; 52(8): 2165–2176p.

Weston J., Bordes A., Bottou L. Online (and offline) on an Even Tighter Budget. In Robert G. Cowell and Zoubin Ghahramani, editors, Proc. of AISTATS 2005, 2005, 413–420p.

Cheng L., Vishwanathan S. V. N., Schuurmans D., et al. Implicit Online Learning with Kernels. In Adv Neural Info Process Syst 2007; 19: 249–256p.

Dekel O., Shalev-Shwartz S., Singer Y. The Forgetron: A Kernel-based Perceptron on a Budget. SIAM J Comput 2007; 37(5): 1342–1372p.

Cesa-Bianchi N., Conconi A., Gentile C. On the Generalization Ability of On-line Learning Algorithms. IEEE T Inform Theory 2004; 50(9): 2050–2057p.

Cesa-Bianchi N., Conconi A., Gentile C. A Second-order Perceptron Algorithm. SIAM J Comput 2005; 34(3): 640–668p.

Cesa-Bianchi N., Conconi A., Gentile C. Tracking the Best Hyperplane with a Simple Budget Perceptron. In Proc. of the 19th Conference on Learning Theory, 483–498p, 2006.

Csat´o L., Opper M. Sparse on-line Gaussian Processes. Neural Comput 2002; 14: 641–668p.

Langford J., Li L., Zhang T. Sparse Online Learning via Truncated Gradient. In Adv Neural Info Process Syst 2008; 21: 905–912p.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/