Fetching the paper…
Reading the bibliography…
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 gradient-free operation and employing the ADMM to accommodate complex structured regularizers.
Online convex optimization in dynamic environments
E. C. Hall and R. M. Willett · 1932
Earlier work this paper cites.
Regression models and life-tables
D. R. Cox · 1972
Earlier work this paper cites.
Linear statistical inference and its applications , volume 2
C. R. Rao · 1973
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
D. Blatt, A. O. Hero, and H. Gauchman · 2007
Earlier work this paper cites.
L1-regularization path algorithm for generalized linear models
M. Y. Park and T. Hastie · 2007
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
Sensor selection via convex optimization
S. Joshi and S. Boyd · 2009
Earlier work this paper cites.
Gradient lasso for cox proportional hazards model
I. Sohn, J. Kim, S.-H. Jung, and C. Park · 2009
Earlier work this paper cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
A. Agarwal, O. Dekel, and L. Xiao · 2010
Earlier work this paper cites.
Composite objective mirror descent
J. Duchi, S. Shalev-Shwartz, Y. Singer, and A. Tewari · 2010
Earlier work this paper cites.
Survival analysis with high-dimensional covariates
D. M. Witten and R. Tibshirani · 2010
Earlier work this paper cites.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Earlier work this paper cites.
A linear ensemble of individual and blended models for music rating prediction
P.-L. Chen, C.-T. Tsai, Y.-N. Chen, K.-C. Chou, C.-L. Li, C.-H. Tsai, K.-W. Wu, Y.-C. Chou, C.-Y. Li, W.-S. Lin, et al · 2011
Cited alongside, same era.
Better mini-batch algorithms via accelerated gradient methods
A. Cotter, O. Shamir, N. Srebro, and K. Sridharan · 2011
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Cited alongside, same era.
Sensor management: Past, present, and future
A. O. Hero and D. Cochran · 2011
Cited alongside, same era.
A unified primal-dual algorithm framework based on bregman iteration
X. Zhang, M. Burger, and S. Osher · 2011
Cited alongside, same era.
Optimization with sparsity-inducing penalties
Algorithms for leader selection in stochastically forced consensus networks
F. Lin, M. Fardad, and M. R. Jovanovic · 2014
Later among the works it cites.
Proximal algorithms
N. Parikh and S. Boyd · 2014
Later among the works it cites.
Convex optimization: Algorithms and complexity
S. Bubeck et al · 2015
Later among the works it cites.
Optimal rates for zero-order convex optimization: The power of two function evaluations
J. C. Duchi, M. I. Jordan, M. J. Wainwright, and A. Wibisono · 2015
Later among the works it cites.
Random gradient-free minimization of convex functions
Y. Nesterov and V. Spokoiny · 2015
Later among the works it cites.
Introduction to online convex optimization
E. Hazan · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2012
Cited alongside, same era.
The yahoo! music dataset and kdd-cup’11
G. Dror, N. Koenigstein, Y. Koren, and M. Weimer · 2012
Cited alongside, same era.
A stochastic gradient method with an exponential convergence _rate for finite training sets
N. L. Roux, M. Schmidt, and F. R. Bach · 2012
Cited alongside, same era.
Online learning and online convex optimization
S. Shalev-Shwartz · 2012
Cited alongside, same era.
Stochastic first-and zeroth-order methods for nonconvex stochastic programming
S. Ghadimi and G. Lan · 2013
Cited alongside, same era.
Stochastic alternating direction method of multipliers
H. Ouyang, N. He, L. Tran, and A. Gray · 2013
Cited alongside, same era.
Dual averaging and proximal gradient descent for online alternating direction multiplier method
T. Suzuki · 2013
Cited alongside, same era.
Online distributed convex optimization on dynamic networks
S. Hosseini, A. Chapman, and M. Mesbahi · 2016
Later among the works it cites.
A comprehensive linear speedup analysis for asynchronous stochastic parallel optimization from zeroth-order to first-order
X. Lian, H. Zhang, C.-J. Hsieh, Y. Huang, and J. Liu · 2016
Later among the works it cites.
Sensor selection for estimation with correlated measurement noise
S. Liu, S. P. Chepuri, M. Fardad, E. Maşazade, G. Leus, and P. K. Varshney · 2016
Later among the works it cites.
Bias-variance tradeoff of graph laplacian regularizer
P.-Y. Chen and S. Liu · 2017
Closest in time.
P.-Y. Chen, H. Zhang, Y. Sharma, J. Yi, and C.-J. Hsieh · 2017
Closest in time.
On the information-adaptive variants of the admm: An iteration complexity perspective
X. Gao, B. Jiang, and S. Zhang · 2017
Closest in time.
Zenith: A zeroth-order distributed algorithm for multi-agent nonconvex optimization
D. Hajinezhad, M. Hong, and A. Garcia · 2017
Closest in time.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
O. Shamir · 2017
Closest in time.