摘要
In this paper, we design and analyze a new zeroth-order online algorithm, namely, the zeroth-order online alternating direction method of multipliers (ZOO-ADMM), which enjoys dual advantages of being gradientfree operation and employing the ADMM to accommodate complex structured regularizers. Compared to the first-order gradientbased online algorithm, we show that ZOOADMM requires √ m times more iterations, leading to a convergence rate of O(√ m/√ T), where m is the number of optimization variables, and T is the number of iterations. To accelerate ZOO-ADMM, we propose two minibatch strategies: gradient sample averaging and observation averaging, resulting in an improved convergence rate of O(p 1 + q−1m/√ T), where q is the minibatch size. In addition to convergence analysis, we also demonstrate ZOO-ADMM to applications in signal processing, statistics, and machine learning.
| 源语言 | 英语 |
|---|---|
| 期刊 | Proceedings of Machine Learning Research |
| 卷 | 84 |
| 出版状态 | 已出版 - 2018 |
| 活动 | 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018 - Playa Blanca, Lanzarote, Canary Islands, 西班牙 期限: 9 4月 2018 → 11 4月 2018 |
学术指纹
探究 'Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver