A Survey of Online Learning Algorithm

Authors

  • Bharti Patel Department of Computer Science, Shri Shankaracharya Technical Campus, India
  • Rajesh Tiwari Department of Computer Science, Shri Shankaracharya Technical Campus, India

DOI:

https://doi.org/10.37591/rtpc.v2i1.289

Abstract

Online learning is an active research area, which emerges in the last decade and has been considered as a subset of machine learning. Although, there is limited advancements has been made due to its high processing environment ultimately delaying its real-time applicability. In this study, we studied the various techniques with which the online learning algorithms have been able to successfully embark the results over the World Wide Web. It is considered to be a challenging research topic because of the problem of bandwidth and latency where the non-linear classifiers are required to be used in combination of weights that are to be learned simultaneously for the processing of an online job.

Keywords: Online learning, relative loss bounds, bandwidth, latency, multi-processing

 

Cite this Article
Bharti Patel, Rajesh Tiwari, A Survey of Online Learning Algorithm, Recent Trends in Parallel Computing. 2015; 2(1): 6–9p.

References

Y. Freund and R. E. Schapire. Large margin classification using the Perceptron algorithm. Machine Learning. 1999; 277–296p.

K. Crammer and Y. Singer. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research. 2003; 3: 951–991p.

K. Crammer, J. Kandola, and Y. Singer. Online classification on a budget. In Advances in NeuralInformation Processing Systems. 2003;16.

K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive-aggressivealgorithms. Journal of Machine Learning Research. 2006; 7: 551–585p.

J. Kivinen, A. Smola, and R. Williamson. Online learning with kernels. IEEE Trans. on Signal Processing. 2004; 52(8): 2165–2176p.

J. Weston, A. Bordes, and L. Bottou. Online (and offline) on an even tighter budget. In Robert G.Cowell and ZoubinGhahramani, editors. Proc. of AISTATS. 2005; 413–420p.

L. Cheng, S. V. N. Vishwanathan, D. Schuurmans, S. Wang, and T. Caelli. Implicit online learning with kernels. In Advances in Neural Information Processing Systems. 2007; 249–256p.

O. Dekel, S. Shalev-Shwartz, and Y. Singer. The Forgetron: A kernel-based perceptron on a budget. SIAM Journal on Computing. 2007; 37(5): 1342–1372p.

N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learningalgorithms. IEEE Trans. on Information Theory. 2004; 50(9): 2050–2057p.

N. Cesa-Bianchi, A. Conconi, and C. Gentile. A second-order perceptron algorithm. SIAM Journal on Computing. 2005; 34(3):640–668p.

N. Cesa-Bianchi, A. Conconi, and C. Gentile. Tracking the best hyperplane with a simple budget Perceptron. In Proc. of the 19th Conference on Learning Theory. 2006; 483–498p.

L. Csat´o and M. Opper. Sparse on-line gaussian processes. Neural Computation. 2002; 14: 641–668p.

J. Langford, L. Li, and T. Zhang. Sparse online learning via truncated gradient. In Advances in Neural Information Processing Systems 21. 2008; 905–912p.

Downloads

Published

2015-02-26

Issue

Vol. 2 No. 1 (2015)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.