Login / Signup

Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex setting.

Ariel NeufeldMatthew Ng Cheng EnYing Zhang
Published in: CoRR (2022)
Keyphrases
  • asymptotic convergence
  • learning algorithm
  • k means
  • np hard
  • convex hull
  • lower bound
  • dynamic programming
  • optimal solution
  • ant colony optimization
  • convergence rate