Stochastic approximation vis-à-vis online learning for big data analytics

IEEE Signal Processing Magazine

Volumn 31, Issue 6, 2014, Pages 124-129

  Slavakis, Konstantinos ^a   Kim, Seung Jun ^b   Mateos, Gonzalo ^c   Giannakis, Georgios B ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Baltimore County   (United States)

^c University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA VISUALIZATION; E-LEARNING; ELECTRIC POWER TRANSMISSION NETWORKS; MEDICAL IMAGING; ONLINE SYSTEMS; REAL TIME SYSTEMS; SIGNAL PROCESSING; SMART CITY; SOCIAL NETWORKING (ONLINE); STOCHASTIC SYSTEMS; STRUCTURAL HEALTH MONITORING;

ANOMALY DETECTION; BIG DATA APPLICATIONS; FRAUD DETECTION; HEALTH INFORMATICS; ONLINE LEARNING; ONLINE SOCIAL MEDIAS; SENTIMENT ANALYSIS; STOCHASTIC APPROXIMATIONS;

BIG DATA;

EID: 85032752034     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2345536     Document Type: Article

References (14)

1. K. Slavakis, G. B. Giannakis, and G. Mateos, "Modeling and optimization for big data analytics," IEEE Signal Processing Mag., vol. 31, no. 5, pp. 18-31, Sept. 2014.
2. A. Nemirovski, A. Juditski, G. Lan, and A. Shapiro, "Robust stochastic approximation approach to stochastic programming," SIAM J. Optim., vol. 19, no. 4, pp. 1574-1609, 2009.
3. H. J. Kushner and G. G. Yin, Stochastic Approximation Algorithms and Applications. New York: Springer, 1997.
4. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, 2nd ed. Belmond, MA: Athena Scientific, 1997.
5. I. D. Schizas, G. Mateos, and G. B. Giannakis, "Distributed LMS for consensus-based in-network adaptive processing," IEEE Trans. Signal Processing, vol. 57, no. 6, pp. 2365-2381, 2009.
6. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Review, vol. 38, no. 3, pp. 367-426, Sept. 1996.
7. T. Strohmer and R. Vershynin, "A randomized Kaczmarz algorithm with exponential convergence," J. Fourier Anal. Appl., vol. 15, no. 2, pp. 262-278, 2009.
8. D. Needell, N. Srebro, and R. Ward. (2013, Feb.). Stochastic gradient descent and the randomized Kaczmarz algorithm. ArXiv e-prints. [Online]. Available: arXiv:1310.5715v2
9. A. Nedić and D. P. Bertsekas, "Incremental subgradient methods for nondifferentiable optimization," SIAM J. Optim., vol. 12, no. 1, pp. 109-138, 2001.
10. S. Shalev-Shwartz, "Online learning and online convex optimization," Found. Trends Mach. Learn., vol. 4, no. 2, pp. 107-194, Mar. 2012.
11. A. Beck and M. Teboulle, "Mirror descent and nonlinear projected subgradient methods for convex optimization," Oper. Res. Lett., vol. 31, no. 3, pp. 167-175, 2003.
12. J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and A. Tewari, "Composite objective mirror descent," in Proc. Conf. Learning Theory, Haifa, Israel, June 2010, pp. 14-26.
13. L. Xiao, "Dual averaging methods for regularized stochastic learning and online optimization," J. Mach. Learn. Res., vol. 11, pp. 2543-2596, Oct. 2010.
14. A. D. Flaxman, A. T. Kalai, and H. B. McMahan, "Online convex optimization in the bandit setting: Gradient descent without a gradient," in Proc. ACMSIAM Symp. Discrete Algorithms, Vancouver, Jan. 2005, pp. 385-394.