\begin{thebibliography}{25}
\providecommand{\natexlab}[1]{#1}
\providecommand{\url}[1]{\texttt{#1}}
\expandafter\ifx\csname urlstyle\endcsname\relax
  \providecommand{\doi}[1]{doi: #1}\else
  \providecommand{\doi}{doi: \begingroup \urlstyle{rm}\Url}\fi

\bibitem[Bauschke \& Combettes(2011)Bauschke and Combettes]{bauschke2011convex}
Bauschke, Heinz and Combettes, Patrick~L.
\newblock \emph{\href{http://dx.doi.org/10.1007/978-1-4419-9467-7}{Convex
  analysis and monotone operator theory in Hilbert spaces}}.
\newblock Springer, 2011.

\bibitem[Beck \& Teboulle(2009)Beck and Teboulle]{beck2009gradient}
Beck, Amir and Teboulle, Marc.
\newblock \href{https://doi.org/10.1017/CBO9780511804458.003}{Gradient-based
  algorithms with applications to signal recovery}.
\newblock \emph{Convex Optimization in Signal Processing and Communications},
  2009.

\bibitem[Davis et~al.(2016)Davis, Edmunds, and Udell]{apalm_davis}
Davis, Damek, Edmunds, Brent, and Udell, Madeleine.
\newblock
  \href{http://papers.nips.cc/paper/6428-the-sound-of-apalm-clapping-faster-nonsmooth-nonconvex-optimization-with-stochastic-asynchronous-palm.pdf}{The
  sound of APALM clapping: faster nonsmooth nonconvex optimization with
  stochastic asynchronous PALM}.
\newblock In \emph{Advances in Neural Information Processing Systems 29}, 2016.

\bibitem[Defazio et~al.(2014)Defazio, Bach, and
  Lacoste-Julien]{defazio2014saga}
Defazio, Aaron, Bach, Francis, and Lacoste-Julien, Simon.
\newblock \href{https://arxiv.org/abs/1407.0202}{{SAGA}: A fast incremental
  gradient method with support for non-strongly convex composite objectives}.
\newblock In \emph{Advances in Neural Information Processing Systems}, 2014.

\bibitem[Gu et~al.(2016)Gu, Huo, and Huang]{gu2016asynchronous}
Gu, Bin, Huo, Zhouyuan, and Huang, Heng.
\newblock \href{https://arxiv.org/abs/1610.09447v3}{Asynchronous stochastic
  block coordinate descent with variance reduction}.
\newblock \emph{arXiv preprint arXiv:1610.09447v3}, 2016.

\bibitem[Hsieh et~al.(2015)Hsieh, Yu, and Dhillon]{hsieh2015passcode}
Hsieh, Cho-Jui, Yu, Hsiang-Fu, and Dhillon, Inderjit~S.
\newblock
  \href{http://www.jmlr.org/proceedings/papers/v37/hsieha15-supp.pdf}{PASSCoDe:
  parallel asynchronous stochastic dual coordinate descent.}
\newblock In \emph{ICML}, 2015.

\bibitem[Johnson \& Zhang(2013)Johnson and Zhang]{johnson2013accelerating}
Johnson, Rie and Zhang, Tong.
\newblock
  \href{http://papers.nips.cc/paper/4937-accelerating-stochastic-gradient-descent-using-predictive-variance-reduction.pdf}{Accelerating
  stochastic gradient descent using predictive variance reduction}.
\newblock In \emph{Advances in Neural Information Processing Systems}, 2013.

\bibitem[Juan et~al.(2016)Juan, Zhuang, Chin, and Lin]{juan2016field}
Juan, Yuchin, Zhuang, Yong, Chin, Wei-Sheng, and Lin, Chih-Jen.
\newblock
  \href{http://ntucsu.csie.ntu.edu.tw/~cjlin/papers/ffm.pdf}{Field-aware
  factorization machines for {CTR} prediction}.
\newblock In \emph{Proceedings of the 10th {ACM} Conference on Recommender
  Systems}. ACM, 2016.

\bibitem[Le~Roux et~al.(2012)Le~Roux, Schmidt, and Bach]{roux2012stochastic}
Le~Roux, Nicolas, Schmidt, Mark, and Bach, Francis~R.
\newblock
  \href{http://papers.nips.cc/paper/4633-a-stochastic-gradient-method-with-an-exponential-convergence-_rate-for-finite-training-sets.pdf}{A
  stochastic gradient method with an exponential convergence rate for finite
  training sets}.
\newblock In \emph{Advances in Neural Information Processing Systems}, 2012.

\bibitem[Leblond et~al.(2017)Leblond, Pedregosa, and
  Lacoste-Julien]{leblond2016Asaga}
Leblond, R\'emi, Pedregosa, Fabian, and Lacoste-Julien, Simon.
\newblock \href{https://arxiv.org/abs/1606.04809v2}{{ASAGA}: asynchronous
  parallel {SAGA}}.
\newblock \emph{Proceedings of the 20th International Conference on Artificial
  Intelligence and Statistics (AISTATS 2017)}, 2017.

\bibitem[Liu \& Wright(2015)Liu and Wright]{liu2015asynchronous2}
Liu, Ji and Wright, Stephen~J.
\newblock \href{http://dx.doi.org/10.1137/140961134}{Asynchronous stochastic
  coordinate descent: Parallelism and convergence properties}.
\newblock \emph{SIAM Journal on Optimization}, 2015.

\bibitem[Mania et~al.(2017)Mania, Pan, Papailiopoulos, Recht, Ramchandran, and
  Jordan]{mania2015perturbed}
Mania, Horia, Pan, Xinghao, Papailiopoulos, Dimitris, Recht, Benjamin,
  Ramchandran, Kannan, and Jordan, Michael~I.
\newblock \href{https://doi.org/10.1137/16M1057000}{Perturbed iterate analysis
  for asynchronous stochastic optimization}.
\newblock \emph{SIAM Journal on Optimization}, 2017.

\bibitem[Meng et~al.(2017)Meng, Chen, Yu, Wang, Ma, and Liu]{meng2017aaai}
Meng, Qi, Chen, Wei, Yu, Jingcheng, Wang, Taifeng, Ma, Zhi-Ming, and Liu,
  Tie-Yan.
\newblock \href{https://arxiv.org/abs/1609.08435}{Asynchronous stochastic
  proximal optimization algorithms with variance reduction}.
\newblock In \emph{AAAI}, 2017.

\bibitem[Nesterov(2004)]{nesterov2004introductory}
Nesterov, Yurii.
\newblock \emph{Introductory lectures on convex optimization}.
\newblock Springer Science \& Business Media, 2004.

\bibitem[Nesterov(2013)]{nesterov20013gradient}
Nesterov, Yurii.
\newblock \href{http://dx.doi.org/10.1007/s10107-012-0629-5}{Gradient methods
  for minimizing composite functions}.
\newblock \emph{Mathematical Programming}, 2013.

\bibitem[Niu et~al.(2011)Niu, Recht, Re, and Wright]{hogwild2011}
Niu, Feng, Recht, Benjamin, Re, Christopher, and Wright, Stephen.
\newblock
  \href{http://papers.nips.cc/paper/4390-hogwild-a-lock-free-approach-to-parallelizing-stochastic-gradient-descent.pdf}{Hogwild:
  A lock-free approach to parallelizing stochastic gradient descent}.
\newblock In \emph{Advances in Neural Information Processing Systems}, 2011.

\bibitem[Peng et~al.(2016)Peng, Xu, Yan, and Yin]{peng2016arock}
Peng, Zhimin, Xu, Yangyang, Yan, Ming, and Yin, Wotao.
\newblock \href{http://dx.doi.org/10.1137/15M1024950}{ARock: an algorithmic
  framework for asynchronous parallel coordinate updates}.
\newblock \emph{SIAM Journal on Scientific Computing}, 2016.

\bibitem[Reddi et~al.(2015)Reddi, Hefny, Sra, Poczos, and
  Smola]{reddi2015variance}
Reddi, Sashank~J, Hefny, Ahmed, Sra, Suvrit, Poczos, Barnabas, and Smola,
  Alexander~J.
\newblock
  \href{http://papers.nips.cc/paper/5821-on-variance-reduction-in-stochastic-gradient-descent-and-its-asynchronous-variants.pdf}{On
  variance reduction in stochastic gradient descent and its asynchronous
  variants}.
\newblock In \emph{Advances in Neural Information Processing Systems}, 2015.

\bibitem[Schmidt et~al.(2016)Schmidt, Le~Roux, and Bach]{schmidt2016minimizing}
Schmidt, Mark, Le~Roux, Nicolas, and Bach, Francis.
\newblock \href{http://dx.doi.org/10.1007/s10107-016-1030-6}{Minimizing finite
  sums with the stochastic average gradient}.
\newblock \emph{Mathematical Programming}, 2016.

\bibitem[Shalev-Shwartz \& Zhang(2013)Shalev-Shwartz and
  Zhang]{shalev2013stochastic}
Shalev-Shwartz, Shai and Zhang, Tong.
\newblock
  \href{http://www.jmlr.org/papers/volume14/shalev-shwartz13a/shalev-shwartz13a.pdf}{Stochastic
  dual coordinate ascent methods for regularized loss minimization}.
\newblock \emph{Journal of Machine Learning Research}, 2013.

\bibitem[Shalev-Shwartz et~al.(2012)]{shalev2012proximal}
Shalev-Shwartz, Shai et~al.
\newblock \href{https://arxiv.org/abs/1211.2717}{Proximal stochastic dual
  coordinate ascent}.
\newblock \emph{arXiv preprint arXiv:1211.2717}, 2012.

\bibitem[Xiao \& Zhang(2014)Xiao and Zhang]{xiao2014proximal}
Xiao, Lin and Zhang, Tong.
\newblock \href{http://dx.doi.org/10.1137/140961791}{A proximal stochastic
  gradient method with progressive variance reduction}.
\newblock \emph{SIAM Journal on Optimization}, 2014.

\bibitem[You et~al.(2016)You, Lian, Liu, Yu, Dhillon, Demmel, and
  Hsieh]{you2016asynchronous}
You, Yang, Lian, Xiangru, Liu, Ji, Yu, Hsiang-Fu, Dhillon, Inderjit~S, Demmel,
  James, and Hsieh, Cho-Jui.
\newblock
  \href{http://papers.nips.cc/paper/6070-asynchronous-parallel-greedy-coordinate-descent.pdf}{Asynchronous
  parallel greedy coordinate descent}.
\newblock In \emph{Advances In Neural Information Processing Systems}, 2016.

\bibitem[Yu et~al.(2010)Yu, Lo, Hsieh, Lou, McKenzie, Chou, Chung, Ho, Chang,
  Wei, et~al.]{yu2010feature}
Yu, Hsiang-Fu, Lo, Hung-Yi, Hsieh, Hsun-Ping, Lou, Jing-Kai, McKenzie, Todd~G,
  Chou, Jung-Wei, Chung, Po-Han, Ho, Chia-Hua, Chang, Chun-Fu, Wei, Yin-Hsuan,
  et~al.
\newblock \href{http://ntur.lib.ntu.edu.tw/retrieve/188513/17.pdf}{Feature
  engineering and classifier ensemble for KDD cup 2010}.
\newblock In \emph{KDD Cup}, 2010.

\bibitem[Zhao et~al.(2014)Zhao, Yu, Wang, Arora, and Liu]{zhao2014accelerated}
Zhao, Tuo, Yu, Mo, Wang, Yiming, Arora, Raman, and Liu, Han.
\newblock
  \href{https://papers.nips.cc/paper/5614-accelerated-mini-batch-randomized-block-coordinate-descent-method.pdf}{Accelerated
  mini-batch randomized block coordinate descent method}.
\newblock In \emph{Advances in neural information processing systems}, 2014.

\end{thebibliography}
