ResearchTrend.AI
Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes

Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes

Moise Blanchard
Junhui Zhang
Patrick Jaillet
ArXiv (abs)PDFHTML

Papers citing "Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes"

5 / 5 papers shown
Title
An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications
An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications
Haotian Jiang
Y. Lee
Zhao Song
Sam Chiu-wai Wong
57
106
0
08 Apr 2020
Gradient Sparsification for Communication-Efficient Distributed Optimization
Gradient Sparsification for Communication-Efficient Distributed Optimization
Jianqiao Wangni
Jialei Wang
Ji Liu
Tong Zhang
100
528
0
26 Oct 2017
CoCoA: A General Framework for Communication-Efficient Distributed Optimization
CoCoA: A General Framework for Communication-Efficient Distributed Optimization
Virginia Smith
Simone Forte
Chenxin Ma
Martin Takáč
Michael I. Jordan
Martin Jaggi
100
273
0
07 Nov 2016
AIDE: Fast and Communication Efficient Distributed Optimization
AIDE: Fast and Communication Efficient Distributed Optimization
Sashank J. Reddi
Jakub Konecný
Peter Richtárik
Barnabás Póczós
Alex Smola
73
150
0
24 Aug 2016
Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality
Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality
M. Braverman
A. Garg
Tengyu Ma
Huy Le Nguyen
David P. Woodruff
FedML
102
175
0
24 Jun 2015

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.