Derivative-Free Optimization
Overview
Derivative-free optimization studies how to improve an objective when gradients are unavailable, unreliable, or too costly, as in simulations, robotics, and models that cannot be differentiated. Common approaches include evolutionary strategies such as CMA-ES, population and pattern search, zeroth-order updates from finite differences or random probes, and surrogate or generative methods that guide candidate selection. These methods are tested on constrained and multimodal benchmarks, neural-network adaptation, trajectory planning, and physical robot tasks. A central tension is that they can handle black-box and non-smooth settings, but evaluation costs and poor scaling with dimension can make them slower than gradient-based methods when accurate gradients are available.
Latest papers
22 papers3 papers in the last four weeks, down 40% on the four weeks before. 0.0% of all new papers.