EvoGrad: Evolutionary-Weighted Gradient and Hessian Learning for Black-Box Optimization
Yedidya Kfir, Elad Sarafian, Yoram Louzoun, Sarit Kraus
摘要
Black-box algorithms aim to optimize functions without access to their analytical structure or gradient information, making them essential when gradients are unavailable or computationally expensive to obtain. Traditional methods for black-box optimization (BBO) primarily utilize non-parametric models, but these approaches often struggle to scale effectively in large input spaces. Conversely, parametric approaches, which rely on neural estimators and gradient signals via backpropagation, frequently encounter substantial gradient estimation errors, limiting their reliability. Explicit Gradient Learning (EGL), a recent advancement, directly learns gradients using a first-order Taylor approximation and has demonstrated superior performance compared to both parametric and non-parametric methods. However, EGL inherently remains local and myopic, often faltering on highly non-convex optimization landscapes. In this work, we address this limitation by integrating global statistical insights from the evolutionary algorithm CMA-ES into the gradient learning framework, effectively biasing gradient estimates towards regions with higher optimization potential. Moreover, we enhance the gradient learning process by estimating the Hessian matrix, allowing us to correct the second-order residual of the Taylor series approximation. Our proposed algorithm, EvoGrad2 (Evolutionary Gradient Learning with second-order approximation), achieves state-of-the-art results on the synthetic COCO test suite, exhibiting significant advantages in high-dimensional optimization problems. We further demonstrate EvoGrad2's effectiveness on challenging real-world machine learning tasks, including adversarial training and code generation, highlighting its ability to produce more robust, high-quality solutions. Our results underscore EvoGrad2's potential as a powerful tool for researchers and practitioners facing complex, high-dimensional, and non-linear optimization problems.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Explicit Gradient Learning for Black-Box OptimizationElad Sarafian, Mor Sinay, Yoram Louzoun, Noa Agmon 等ICML 2020
- Neural Evolution Strategy for Black-box Pareto Set LearningChengyu Lu, Zhenhua Li, Xi Lin, Ji Cheng 等NeurIPS 2025
- Variance-Reduced Gradient Estimation via Noise-Reuse in Online Evolution StrategiesOscar Li, James Harrison, Jascha Sohl-Dickstein, Virginia Smith 等NeurIPS 2023 · 被引用 11 次
- Learning Discrete Structured Variational Auto-Encoder using Natural Evolution StrategiesAlon Berliner, Guy Rotman, Yossi Adi, Roi Reichart 等ICLR 2022 · 被引用 5 次
- Discovering Evolution Strategies via Meta-Black-Box OptimizationRobert Tjarko Lange, Tom Schaul, Yutian Chen, Tom Zahavy 等ICLR 2023 · 被引用 21 次
