A near-optimal algorithm for approximating the John Ellipsoid

Abstract

We develop a simple and efficient algorithm for approximating the John Ellipsoid of a symmetric polytope. Our algorithm is near optimal in the sense that our time complexity matches the current best verification algorithm. We also provide the MATLAB code for further research.

arXiv commentCOLT 2019

References in corpus (9)

• Fast and Guaranteed Tensor Decomposition via Sketching
• Optimal CUR Matrix Decompositions
• On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
• Solving Empirical Risk Minimization in the Current Matrix Multiplication Time
• Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach
• Subspace Embedding and Linear Regression with Orlicz Norm
• ${\ell }_p$ Row Sampling by Lewis Weights
• Total Least Squares Regression in Input Sparsity Time
• Near Optimal Sketching of Low-Rank Tensor Regression

Cited by in corpus (1)

• Sketching Transformed Matrices with Applications to Natural Language Processing