The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Random Gradient-Free Minimization of Convex Functions
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Self-citationIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Self-citationRobust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Introduction to Derivative-Free Optimization
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718768 · Cited by 1,840
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
Self-citation
Cited by
Evolution Strategies as a Scalable Alternative to Reinforcement Learning
Salimans, T., Ho, J., Chen, X., Sidor, S., & Sutskever, I. (2017) · arXiv · doi:10.48550/arxiv.1703.03864 · Cited by 1,027
“Theoretical analysis indeed shows that for general non-smooth optimization problems, the required number of optimization steps scales linearly with the dimension [Nesterov and Spokoiny, 2011].”
FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping
Cao, X., Fang, M., Liu, J., & Gong, N. Z. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24434 · Cited by 999
Black-box Adversarial Attacks with Limited Queries and Information
Ilyas, A., Engstrom, L., Athalye, A., & Lin, J. (2018) · arXiv · doi:10.48550/arxiv.1804.08598 · Cited by 806
Square Attack: A Query-Efficient Black-Box Adversarial Attack via Random Search
Andriushchenko, M., Croce, F., Flammarion, N., & Hein, M. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58592-1_29 · Cited by 800
HopSkipJumpAttack: A Query-Efficient Decision-Based Attack
Chen, J., Jordan, M. I., & Wainwright, M. J. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00045 · Cited by 718
A Tour of Reinforcement Learning: The View from Continuous Control
Recht, B. (2019) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-053018-023825 · Cited by 609
Communication-efficient edge ai: algorithms and systems
Shi, Y., Yang, K., Jiang, T., Zhang, J., & Letaief, K. B. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3007787 · Cited by 488
Efficient Decision-Based Black-Box Adversarial Attacks on Face Recognition
Dong, Y., Su, H., Wu, B., Li, Z., Liu, W., Zhang, T., & Zhu, J. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00790 · Cited by 411
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
AutoZOOM: Autoencoder-Based Zeroth Order Optimization Method for Attacking Black-Box Neural Networks
Tu, C.-C., Ting, P., Chen, P.-Y., Liu, S., Zhang, H., Yi, J., Hsieh, C.-J., & Cheng, S.-M. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301742 · Cited by 361
Learning Optimal Resource Allocations in Wireless Systems
Eisen, M., Zhang, C., Chamon, L. F. O., Lee, D. D., & Ribeiro, A. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2908906 · Cited by 253
Bandit Convex Optimization for Scalable and Dynamic IoT Management
Chen, T., & Giannakis, G. B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2839563 · Cited by 139
On the Convergence of Zeroth-Order Federated Tuning for Large Language Models
Ling, Z., Chen, D., Yao, L., Li, Y., & Shen, Y. (2024) · Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3637528.3671865 · Cited by 21
Harnessing Bandit Online Learning to Low-Latency Fog Computing
Chen, T., & Giannakis, G. B. (2018) · 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2018.8461641 · Cited by 8
“The key idea behind BCO is to construct (possibly stochastic) gradient estimates using the limited function value information [15, 20].”
BackgroundJain, S., Cretu, A.-M., & de Montjoye, Y.-A. (2021) · arXiv · doi:10.48550/arxiv.2106.09820 · Cited by 21
“We estimate the gradient of f using the following equation: ∇δE[ f (δ)]≈ 1 σd d′ ∑ i=1 δi f (δ+σθi) (7) where θi ∼ N(0, In),1 ≤ i ≤ d′ are samples from a standard multivariate normal distribution over Rn. Nesterov and Spokoiny [40] showed through theoretical analysis that the number of samples d′ required to estimate…”
BackgroundInfluentialBeyond the Capability Boundary: Zeroth-Order Optimization for Self-Evolving LLM Agents
Liu, B., Fan, X., Wu, Y., Gao, Z., Gao, M., Li, C., & Jia, Y. (2026) · arXiv
Xian, R. P., Lee, A. J., Lolla, S., Wang, V., Cui, Q., Ro, R., & Abbasi-Asl, R. (2024) · arXiv · doi:10.48550/arxiv.2402.10527
Metadata
- Authors
- Nesterov, Y., & Spokoiny, V.
- Venue
- Foundations of Computational Mathematics
- Published
- 2015-11-30
- Volume
- 17
- Issue
- 2
- Pages
- 527-566
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2149479912
- Cited by
- 822
- References
- 26
- FWCI
- 19.39
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.