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

Documenti analoghi

• Non-asymptotic convergence analysis of the stochastic gradient Hamiltonian Monte Carlo algorithm with discontinuous stochastic gradient with applications to training of ReLU neural networks
  di: Liang, Luxu, et al.
  Pubblicazione: (2024)
• Provably convergent stochastic fixed-point algorithm for free-support Wasserstein barycenter of continuous non-parametric measures
  di: Chen, Zeyi, et al.
  Pubblicazione: (2025)
• Langevin dynamics based algorithm e-TH$\varepsilon$O POULA for stochastic optimization problems with discontinuous stochastic gradient
  di: Lim, Dong-Young, et al.
  Pubblicazione: (2022)
• Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2024)
• Numerical method for approximately optimal solutions of two-stage distributionally robust optimization with marginal constraints
  di: Neufeld, Ariel, et al.
  Pubblicazione: (2022)