The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
The Cross-Entropy Method for Combinatorial and Continuous Optimization
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Non-Uniform Random Variate Generation
Devroye, L. (1986) · Springer eBooks · doi:10.1007/978-1-4613-8643-8 · Cited by 4,041
Cited by
A Tutorial on the Cross-Entropy Method
de Boer, P.-T., Kroese, D. P., Mannor, S., & Rubinstein, R. Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-5724-z · Cited by 3,024
Self-citationBenchmarking Deep Reinforcement Learning for Continuous Control
Duan, Y., Chen, X., Houthooft, R., Schulman, J., & Abbeel, P. (2016) · arXiv · doi:10.48550/arxiv.1604.06778 · Cited by 1,114
code2vec: Learning distributed representations of code
Alon, U., Zilberstein, M., Levy, O., & Yahav, E. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290353 · Cited by 962
On the use of deep learning for computational imaging
Barbastathis, G., Ozcan, A., & Situ, G. (2019) · Optica · doi:10.1364/optica.6.000921 · Cited by 869
Simulation optimization: a review of algorithms and applications
Amaran, S., Sahinidis, N. V., Sharda, B., & Bury, S. J. (2016) · Annals of Operations Research · doi:10.1007/s10479-015-2019-x · Cited by 467
Proceedings of the 2002 Winter Simulation Conference
(2002) · Proceedings of the Winter Simulation Conference · doi:10.1109/wsc.2002.1166355 · Cited by 456
Zhao, D., Lam, H., Peng, H., Bao, S., LeBlanc, D. J., Nobukawa, K., & Pan, C. S. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2582208 · Cited by 445
Enhanced Sampling Methods for Molecular Dynamics Simulations [Article v1.0]
Hénin, J., Lelièvre, T., Shirts, M. R., Valsson, O., & Delemotte, L. (2022) · Living Journal of Computational Molecular Science · doi:10.33011/livecoms.4.1.1583 · Cited by 372
Up or Down? Adaptive Rounding for Post-Training Quantization
Nagel, M., Amjad, R. A., van Baalen, M., Louizos, C., & Blankevoort, T. (2020) · arXiv · doi:10.48550/arxiv.2004.10568 · Cited by 252
SoftGym: Benchmarking Deep Reinforcement Learning for Deformable Object Manipulation
Lin, X., Wang, Y., Olkin, J., & Held, D. (2020) · arXiv · doi:10.48550/arxiv.2011.07215 · Cited by 140
Reinforcement learning for HVAC control in intelligent buildings: A technical and conceptual review
Al Sayed, K., Boodi, A., Sadeghian Broujeny, R., & Beddiar, K. (2024) · Journal of Building Engineering · doi:10.1016/j.jobe.2024.110085 · Cited by 140
Interpretable deep learning for guided microstructure-property explorations in photovoltaics
Pokuri, B. S. S., Ghosal, S., Kokate, A., Sarkar, S., & Ganapathysubramanian, B. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0231-y · Cited by 73
Visuospatial foresight for physical sequential fabric manipulation
Hoque, R., Seita, D., Balakrishna, A., Ganapathi, A., Tanwani, A. K., Jamali, N., Yamane, K., Iba, S., & Goldberg, K. (2022) · Autonomous Robots · doi:10.1007/s10514-021-10001-0 · Cited by 45
Gao, C., Feng, Y., Tong, X., Jin, Y., Liu, S., Wu, P., Ye, Z., & Gu, C. (2020) · Science of The Total Environment · doi:10.1016/j.scitotenv.2020.140996 · Cited by 35
Paillassa, M., Bertin, E., & Bouy, H. (2020) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201936345 · Cited by 35
“The loss function L is the sigmoid cross-entropy (Rubinstein 1999) summed over all classes and pixels, and averaged across batch images: L = − 1 card(B) ∑ b∈B ∑ p∈P w′p,b ∑ ωc∈C ( yb,p,c log ŷb,p,c + (1 − yb,p,c) log(1 − ŷb,p,c) ) , (12) where B is the set of batch images, P is the set of all…”
BackgroundMethodAction Image Representation: Learning Scalable Deep Grasping Policies with Zero Real World Data
Khansari, M., Kappler, D., Luo, J., Bingham, J., & Kalakrishnan, M. (2020) · 2020 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra40945.2020.9197415 · Cited by 23
Plan execution monitoring through detection of unmet expectations about action outcomes
Mendoza, J. P., Veloso, M., & Simmons, R. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139646 · Cited by 18
“As an optimization algorithm, FARO uses the cross-entropy method [13], although other optimization methods could be used instead.”
MethodEnhancing Code Generation via Bidirectional Comment-Level Mutual Grounding
Di, Y., & Zhang, T. (2025) · arXiv · doi:10.48550/arxiv.2505.07768 · Cited by 3
(2008) · doi:10.1061/(asce)0733-9496(2008)134:6(556
Sequence Modeling of Temporal Credit Assignment for Episodic Reinforcement Learning
Liu, Y., Luo, Y., Zhong, Y., Chen, X., Liu, Q., & Peng, J. (2019) · arXiv · doi:10.48550/arxiv.1905.13420
Metadata
- Authors
- Rubinstein, R.
- Venue
- Methodology And Computing In Applied Probability
- Published
- 1999-09
- Volume
- 1
- Issue
- 2
- Pages
- 127-190
- ISSN
- 1387-5841 (ISSN-L)
- 1573-7713
- OpenAlex
- W1577352482
- Cited by
- 903
- References
- 35
- FWCI
- 5.70
- 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.