ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1409.1458
  4. Cited By
Communication-Efficient Distributed Dual Coordinate Ascent

Communication-Efficient Distributed Dual Coordinate Ascent

4 September 2014
Martin Jaggi
Virginia Smith
Martin Takáč
Jonathan Terhorst
S. Krishnan
Thomas Hofmann
Michael I. Jordan
ArXivPDFHTML

Papers citing "Communication-Efficient Distributed Dual Coordinate Ascent"

12 / 12 papers shown
Title
Fast Distributed Coordinate Descent for Non-Strongly Convex Losses
Fast Distributed Coordinate Descent for Non-Strongly Convex Losses
Olivier Fercoq
Zheng Qu
Peter Richtárik
Martin Takáč
49
59
0
21 May 2014
Communication Efficient Distributed Optimization using an Approximate
  Newton-type Method
Communication Efficient Distributed Optimization using an Approximate Newton-type Method
Ohad Shamir
Nathan Srebro
Tong Zhang
65
554
0
30 Dec 2013
Analysis of Distributed Stochastic Dual Coordinate Ascent
Analysis of Distributed Stochastic Dual Coordinate Ascent
Tianbao Yang
Shenghuo Zhu
Rong Jin
Yuanqing Lin
49
19
0
04 Dec 2013
Distributed Coordinate Descent Method for Learning with Big Data
Distributed Coordinate Descent Method for Learning with Big Data
Peter Richtárik
Martin Takáč
151
254
0
08 Oct 2013
Mini-Batch Primal and Dual Methods for SVMs
Mini-Batch Primal and Dual Methods for SVMs
Martin Takáč
A. Bijral
Peter Richtárik
Nathan Srebro
57
195
0
10 Mar 2013
Parallel Coordinate Descent Methods for Big Data Optimization
Parallel Coordinate Descent Methods for Big Data Optimization
Peter Richtárik
Martin Takáč
88
487
0
04 Dec 2012
Stochastic Dual Coordinate Ascent Methods for Regularized Loss
  Minimization
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Shai Shalev-Shwartz
Tong Zhang
115
1,031
0
10 Sep 2012
Iteration Complexity of Randomized Block-Coordinate Descent Methods for
  Minimizing a Composite Function
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
Peter Richtárik
Martin Takáč
81
769
0
14 Jul 2011
HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient
  Descent
HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Feng Niu
Benjamin Recht
Christopher Ré
Stephen J. Wright
142
2,272
0
28 Jun 2011
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Joseph K. Bradley
Aapo Kyrola
Danny Bickson
Carlos Guestrin
69
309
0
26 May 2011
Distributed Delayed Stochastic Optimization
Distributed Delayed Stochastic Optimization
Alekh Agarwal
John C. Duchi
110
626
0
28 Apr 2011
Optimal Distributed Online Prediction using Mini-Batches
Optimal Distributed Online Prediction using Mini-Batches
O. Dekel
Ran Gilad-Bachrach
Ohad Shamir
Lin Xiao
241
683
0
07 Dec 2010
1