Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions

Documenti analoghi

• Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithms on Smooth Functions
  di: Ye, Haishan
  Pubblicazione: (2025)
• High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
  di: Ye, Haishan
  Pubblicazione: (2026)
• An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
  di: Chen, Lesi, et al.
  Pubblicazione: (2022)
• On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
  di: Luo, Luo, et al.
  Pubblicazione: (2022)
• Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?
  di: Ye, Haishan, et al.
  Pubblicazione: (2025)