Ye, H. (2025). Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithms on Smooth Functions.
Chicago Style (17th ed.) CitationYe, Haishan. Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithms on Smooth Functions. 2025.
MLA (9th ed.) CitationYe, Haishan. Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithms on Smooth Functions. 2025.
Warning: These citations may not always be 100% accurate.