{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4DB4CNBWIUOHN6BPZ2TKKDRZNZ","short_pith_number":"pith:4DB4CNBW","schema_version":"1.0","canonical_sha256":"e0c3c13436451c76f82fcea6a50e396e65a5347a11d9502be333933e9a8919b9","source":{"kind":"arxiv","id":"1604.00772","version":2},"attestation_state":"computed","paper":{"title":"The CMA Evolution Strategy: A Tutorial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space.","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolaus Hansen (TAO)","submitted_at":"2016-04-04T08:16:12Z","abstract_excerpt":"This tutorial introduces the CMA Evolution Strategy (ES), where CMA stands for Covariance Matrix Adaptation. The CMA-ES is a stochastic, or randomized, method for real-parameter (continuous domain) optimization of non-linear, non-convex functions. We try to motivate and derive the algorithm from intuitive concepts and from requirements of non-linear, non-convex search in continuous domain."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"1604.00772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-04T08:16:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"42e7bb62c1016578583756e6c386b030a1c99428f346813bf9dae2d385dabd61","abstract_canon_sha256":"8fd74fa2d437d2abc834913f233d5816d118bba2eba6be08ceb71eb2d826c705"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:50.158563Z","signature_b64":"N4bkfa+xpfou1nstFk3FFf2xVjUF9nBwReg34YcCBXhDiDuUgCtETOyOCgsbmq+f09MAU3FAzYZ0ZPwtCnBeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c3c13436451c76f82fcea6a50e396e65a5347a11d9502be333933e9a8919b9","last_reissued_at":"2026-05-17T23:38:50.157997Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:50.157997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The CMA Evolution Strategy: A Tutorial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space.","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolaus Hansen (TAO)","submitted_at":"2016-04-04T08:16:12Z","abstract_excerpt":"This tutorial introduces the CMA Evolution Strategy (ES), where CMA stands for Covariance Matrix Adaptation. The CMA-ES is a stochastic, or randomized, method for real-parameter (continuous domain) optimization of non-linear, non-convex functions. We try to motivate and derive the algorithm from intuitive concepts and from requirements of non-linear, non-convex search in continuous domain."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The CMA-ES is a stochastic method for real-parameter optimization of non-linear, non-convex functions, motivated and derived from intuitive concepts and requirements of non-linear non-convex search in continuous domain.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reader possesses sufficient background in basic probability, linear algebra, and optimization to follow the intuitive derivation of the covariance adaptation rules.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The CMA-ES is a stochastic optimizer for continuous non-linear non-convex problems that adapts a multivariate normal search distribution using covariance matrix updates derived from intuitive requirements.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"10dde5b5d707cc142ac3734513459c8b4cc4d1a8153e4a58cb3ec42fc4cc270f"},"source":{"id":"1604.00772","kind":"arxiv","version":2},"verdict":{"id":"e468d608-345b-44aa-98b0-7d7a1d6be5df","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T21:06:33.599420Z","strongest_claim":"The CMA-ES is a stochastic method for real-parameter optimization of non-linear, non-convex functions, motivated and derived from intuitive concepts and requirements of non-linear non-convex search in continuous domain.","one_line_summary":"The CMA-ES is a stochastic optimizer for continuous non-linear non-convex problems that adapts a multivariate normal search distribution using covariance matrix updates derived from intuitive requirements.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reader possesses sufficient background in basic probability, linear algebra, and optimization to follow the intuitive derivation of the covariance adaptation rules.","pith_extraction_headline":"The CMA-ES derives its search distribution from intuitive requirements for non-linear non-convex optimization in continuous space."},"references":{"count":37,"sample":[{"doi":"","year":2017,"title":"Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions","work_id":"5504e6eb-107f-4dce-b8d4-d7de66e41a05","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Diagonal acceleration for covariance matrix adaptation evolution strategies","work_id":"01b4c5ef-72d2-43b7-ae97-226946381ae4","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"A restart CMA evolution strategy with increasing population size","work_id":"bd06d30d-492a-4b76-acb9-6121cfaffe3c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Weighted multirecombination evolution strategies","work_id":"d389d83a-1029-45ab-b0d4-7f09748f0ec2","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Performance analysis of evolutionary optimization with cumu- lative step length adaptation","work_id":"812a94cd-a8b9-4f58-a375-34e27afc2874","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"82f86b7d9949e5301b1de07b013555cded0741126b9e97c9cc29b627b031aa01","internal_anchors":1},"formal_canon":{"evidence_count":3,"snapshot_sha256":"ef629d0c198d8421d6496899e84fc961d8d4d6d9c51f5885483ecce24d3354c4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.00772","created_at":"2026-05-17T23:38:50.158082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00772v2","created_at":"2026-05-17T23:38:50.158082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00772","created_at":"2026-05-17T23:38:50.158082+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DB4CNBWIUOH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DB4CNBWIUOHN6BP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DB4CNBW","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":47,"internal_anchor_count":47,"sample":[{"citing_arxiv_id":"1906.09072","citing_title":"Evolution Attack On Neural Networks","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"1906.09013","citing_title":"Local Online Motor Babbling: Learning Motor Abundance of A Musculoskeletal Robot Arm","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"1907.04882","citing_title":"Acoustic Model Optimization Based On Evolutionary Stochastic Gradient Descent with Anchors for Automatic Speech Recognition","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08040","citing_title":"Convolutional Reservoir Computing for World Models","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2310.15463","citing_title":"Nested Control Co-design of a Spar Buoy Horizontal-axis Floating Offshore Wind Turbine","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2402.01370","citing_title":"CC-VPSTO: Chance-Constrained Via-Point-Based Stochastic Trajectory Optimisation for Online Robot Motion Planning under Uncertainty","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2410.02543","citing_title":"Diffusion Models are Evolutionary Algorithms","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2501.02200","citing_title":"Learning Evolution via Optimization Knowledge Adaptation","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2502.08208","citing_title":"Exploring Exploration in Bayesian Optimization","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2602.17517","citing_title":"Depth Augmented and FE Free 3D/2D Liver Registration for Laparoscopic Liver AR","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09095","citing_title":"GeoPAS: Geometric Probing for Algorithm Selection in Continuous Black-Box Optimization","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2507.17572","citing_title":"Sampling-Based Global Optimal Control and Estimation via Semidefinite Programming","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2512.24497","citing_title":"What Drives Success in Physical Planning with Joint-Embedding Predictive World Models?","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21179","citing_title":"KSOS-BO: Improving Sampling in Bayesian Optimization via Kernel Sum of Squares","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18867","citing_title":"EVA-0: Test-Time Model Evolution with Only Two Forward Passes per Sample","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":88,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17137","citing_title":"Latent Heuristic Search: Continuous Optimization for Automated Algorithm Design","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16844","citing_title":"Artificial Adaptive Intelligence: The Missing Stage Between Narrow and General Intelligence","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16995","citing_title":"Low Stage High Order Explicit Runge--Kutta Methods via Q- and D-Conditions: General Theory and Efficient Recursive Construction","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15899","citing_title":"Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States","ref_index":145,"is_internal_anchor":true},{"citing_arxiv_id":"2509.01677","citing_title":"Machine Learning in the 2HDM2S model for Dark Matter","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2509.08555","citing_title":"Benchmarking Optimization Algorithms for Automated Calibration of Quantum Devices","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2509.23800","citing_title":"Sample-Efficient Optimisation over the Outputs of Generative Models","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2510.18886","citing_title":"Emergence of Internal State-Modulated Swarming in Multi-Agent Patch Foraging System","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07706","citing_title":"Bootstrapping non-unitary CFTs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":3,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ","json":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ.json","graph_json":"https://pith.science/api/pith-number/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/graph.json","events_json":"https://pith.science/api/pith-number/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/events.json","paper":"https://pith.science/paper/4DB4CNBW"},"agent_actions":{"view_html":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ","download_json":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ.json","view_paper":"https://pith.science/paper/4DB4CNBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00772&json=true","fetch_graph":"https://pith.science/api/pith-number/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/action/storage_attestation","attest_author":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/action/author_attestation","sign_citation":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/action/citation_signature","submit_replication":"https://pith.science/pith/4DB4CNBWIUOHN6BPZ2TKKDRZNZ/action/replication_record"}},"created_at":"2026-05-17T23:38:50.158082+00:00","updated_at":"2026-05-17T23:38:50.158082+00:00"}