To refer to this page use:
|Abstract:||Stochastic optimization finds wide application in signal processing, online learning, and network problems, especially problems processing large-scale data. We propose an Incremental Constraint Averaging Projection Method (ICAPM) that is tailored to optimization problems involving a large number of constraints. The ICAPM makes fast updates by taking sample gradients and averaging over random constraint projections. We provide a theoretical convergence and rate of convergence analysis for ICAPM. Our results suggests that averaging random projections significantly improves the stability of the solutions. For numerical tests, we apply the ICAPM to an online classification problem and a network consensus problem.|
|Citation:||Liu, Jialin, Yuantao Gu, and Mengdi Wang. "Averaging random projection: A fast online solution for large-scale constrained stochastic optimization." In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), (2015): 3586-3590. doi:10.1109/ICASSP.2015.7178639|
|Pages:||3586 - 3590|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.