Stochastic optimization with arbitrary recurrent data sampling

Documenti analoghi

• Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
  di: Lyu, Hanbaek, et al.
  Pubblicazione: (2020)
• On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
  di: Kwon, Jeongyeol, et al.
  Pubblicazione: (2024)
• Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
  di: Li, Yuchen, et al.
  Pubblicazione: (2023)
• Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
  di: Li, Yuchen, et al.
  Pubblicazione: (2024)
• Regularized Overestimated Newton
  di: Duan, Danny, et al.
  Pubblicazione: (2025)