Scaling Up Stochastic Dual Coordinate Ascent

By Kenneth Tran, Saghar Hosseini, Lin Xiao, Tom Finley, Mikhail Bilenko. 2015

31 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Li Fei-Fei
2. Zhengyuan Zhou
3. Li-Jia Li
4. Yoshua Bengio
5. Sergey Levine
6. Trevor Darrell
7. Kristen Grauman
8. Dacheng Tao

Citations in the corpus

• Asynchronous Decentralized Parallel Stochastic Gradient Descent (2017, methodology): “…et al. [2015], Feyzmahdavian et al. [2016], Liu et al. [2014], Mania et al. [2015], Paine et al. [2013], Recht et al. [2011], Sridhar et al. [2013], Tran et al. [2015], Zhang et al. [2014], this paper proposes an asynchronous decentralized parallel stochastic gradient decent algorithm (AD-PSGD),…”
• Asynchronous Parallel Stochastic Gradient for Nonconvex Optimization (2015, methodology): “, 2013], dual stochastic coordinate ascent [Tran et al., 2015], and randomized Kaczmarz algorithm [Liu et al.”
• Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go? (2018, background): “…coordinate descent (Liu et al., 2014; Avron et al., 2015; Liu & Wright, 2015; Tappenden et al., 2017; Fercoq & Richtárik, 2015), dual coordinate descent (Tran et al., 2015), block coordinate descent (Wang et al., 2016; Marecek et al., 2015; Wright, 2015), ADMM (Zhang & Kwok, 2014; Hong, 2017), etc.”