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

The article likely presents a theoretical analysis of a specific optimization algorithm. The focus is on the computational cost (query complexity) of the algorithm when applied to a class of functions with certain properties (stochastic smoothness). The terms "explicit" and "non-asymptotic" suggest a rigorous mathematical treatment, providing concrete bounds on performance rather than just asymptotic behavior.