Tight Bounds for Approximate Carathéodory and Beyond

Tight Bounds for Approximate Carathéodory and Beyond

29 December 2015

Vahab Mirrokni

Sam Chiu-wai Wong

ArXiv (abs)PDF HTML

Papers citing "Tight Bounds for Approximate Carathéodory and Beyond"

10 / 10 papers shown

Title
Second-order Conditional Gradient Sliding Alejandro Carderera Sebastian Pokutta 80 13 0 20 Feb 2020
Sparse Approximation via Generating Point Sets Avrim Blum Sariel Har-Peled Benjamin Raichel 28 35 0 09 Jul 2015
Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets Dan Garber Elad Hazan 126 196 0 05 Jun 2014
Convex Optimization: Algorithms and Complexity Sébastien Bubeck 95 112 0 20 May 2014
Toward a unified theory of sparse dimensionality reduction in Euclidean space J. Bourgain S. Dirksen Jelani Nelson 88 126 0 11 Nov 2013
Duality between subgradient and conditional gradient methods Francis R. Bach 130 99 0 27 Nov 2012
Convex Optimization without Projection Steps Martin Jaggi 125 39 0 04 Aug 2011
Sparse Choice Models Vivek F. Farias Srikanth Jagabathula Devavrat Shah 71 16 0 19 Nov 2010
Convex Analysis and Optimization with Submodular Functions: a Tutorial Francis R. Bach 115 37 0 20 Oct 2010
Regularization Techniques for Learning with Matrices Sham Kakade Shai Shalev-Shwartz Ambuj Tewari 157 210 0 04 Oct 2009

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.