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. 1810.06999
  4. Cited By
Efficient Greedy Coordinate Descent for Composite Problems

Efficient Greedy Coordinate Descent for Composite Problems

16 October 2018
Sai Praneeth Karimireddy
Anastasia Koloskova
Sebastian U. Stich
Martin Jaggi
ArXivPDFHTML

Papers citing "Efficient Greedy Coordinate Descent for Composite Problems"

6 / 6 papers shown
Title
Celer: a Fast Solver for the Lasso with Dual Extrapolation
Celer: a Fast Solver for the Lasso with Dual Extrapolation
Mathurin Massias
Alexandre Gramfort
Joseph Salmon
71
72
0
21 Feb 2018
GAP Safe screening rules for sparse multi-task and multi-class models
GAP Safe screening rules for sparse multi-task and multi-class models
Eugène Ndiaye
Olivier Fercoq
Alexandre Gramfort
Joseph Salmon
58
80
0
11 Jun 2015
On Symmetric and Asymmetric LSHs for Inner Product Search
On Symmetric and Asymmetric LSHs for Inner Product Search
Behnam Neyshabur
Nathan Srebro
82
168
0
21 Oct 2014
Accelerated Mini-Batch Stochastic Dual Coordinate Ascent
Accelerated Mini-Batch Stochastic Dual Coordinate Ascent
Shai Shalev-Shwartz
Tong Zhang
ODL
106
150
0
12 May 2013
Parallel Coordinate Descent Methods for Big Data Optimization
Parallel Coordinate Descent Methods for Big Data Optimization
Peter Richtárik
Martin Takáč
127
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
181
1,033
0
10 Sep 2012
1