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
ArXiv (abs)PDFHTML

Papers citing "Efficient Greedy Coordinate Descent for Composite Problems"

6 / 6 papers shown
Title
FIRE: An Optimization Approach for Fast Interpretable Rule Extraction
FIRE: An Optimization Approach for Fast Interpretable Rule Extraction
Brian Liu
Rahul Mazumder
39
6
0
12 Jun 2023
Differentially Private Coordinate Descent for Composite Empirical Risk
  Minimization
Differentially Private Coordinate Descent for Composite Empirical Risk Minimization
Paul Mangold
A. Bellet
Joseph Salmon
Marc Tommasi
109
14
0
22 Oct 2021
Optimization for Supervised Machine Learning: Randomized Algorithms for
  Data and Parameters
Optimization for Supervised Machine Learning: Randomized Algorithms for Data and Parameters
Filip Hanzely
77
0
0
26 Aug 2020
Stochastic Subspace Cubic Newton Method
Stochastic Subspace Cubic Newton Method
Filip Hanzely
N. Doikov
Peter Richtárik
Y. Nesterov
53
52
0
21 Feb 2020
Dual Extrapolation for Sparse Generalized Linear Models
Dual Extrapolation for Sparse Generalized Linear Models
Mathurin Massias
Samuel Vaiter
Alexandre Gramfort
Joseph Salmon
395
18
0
12 Jul 2019
On Matching Pursuit and Coordinate Descent
On Matching Pursuit and Coordinate Descent
Francesco Locatello
Anant Raj
Sai Praneeth Karimireddy
Gunnar Rätsch
Bernhard Schölkopf
Sebastian U. Stich
Martin Jaggi
78
23
0
26 Mar 2018
1