About using smoothness of the Hessian for getting to approximate criticality of a non-convex objective Is there any algorithm which shows that under the assumption of Lipschitz smoothness of the Hessian of a non-convex function one can get to its critical point faster?
Yes, there are some papers. The most relevant one to your question might be: https://arxiv.org/pdf/1611.00756.pdf