NeurIPS 2019
Sun Dec 8th through Sat the 14th, 2019 at Vancouver Convention Center
Paper ID:1204
Title:Blended Matching Pursuit

This paper proposes a new algorithm for minimizing convex objective functions. The reviewers found the article clearly written and the material presented could be useful to the broader ML community. The authors provided satisfying explanations and improvements in their response. There were some questions remaining about the simplicity of the simulation scenarios, but the authors have promised to make more realistic simulation experiments available. This paper seems to be above the bar of acceptance because of the theoretical and empirical evidence connected to this new algorithm.