This paper gives a new analysis for 0th order optimization and show that they can avoid saddle points efficiently. The new algorithm is much faster than previous algorithms based on Gaussian smoothing. Comparing number of iterations instead of oracle calls is still slightly misleading.