Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization
Sam Reifenstein, Timothée G. Leleu, Yoshihisa Yamamoto
Abstract
We propose a novel algorithm that extends the methods of ball smoothing and Gaussian smoothing for noisy derivative-free optimization by accounting for the heterogeneous curvature of the objective function. The algorithm dynamically adapts the shape of the smoothing kernel to approximate the Hessian of the objective function around a local optimum. This approach significantly reduces the error in estimating the gradient from noisy evaluations through sampling. We demonstrate the efficacy of our method through numerical experiments on artificial problems. Additionally, we show improved performance when tuning NP-hard combinatorial optimization solvers compared to existing state-of-the-art heuristic derivative-free and Bayesian optimization methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 19798bd3-0c62-4c6f-a7a5-d04423246c1cCited by top-tier papers1
Ask how each one uses itBuilds on5
- Symbolic Discovery of Optimization AlgorithmsXiangning Chen, Chen Liang, Da Huang, Esteban Real et al.NeurIPS 2023 · 734 citations
- ADAHESSIAN: An Adaptive Second Order Optimizer for Machine LearningZhewei Yao, Amir Gholami, Sheng Shen, Mustafa Mustafa et al.AAAI 2021 · 358 citations
- Understanding the Difficulty of Training TransformersLiyuan Liu, Xiaodong Liu, Jianfeng Gao, Weizhu Chen et al.EMNLP 2020 · 158 citations
- The power of first-order smooth optimization for black-box non-smooth problemsAlexander V. Gasnikov, Anton Novitskii, Vasilii Novitskii, Farshed Abdukhakimov et al.ICML 2022 · 43 citations
- Noise Is Not the Main Factor Behind the Gap Between Sgd and Adam on Transformers, But Sign Descent Might BeFrederik Kunstner, Jacques Chen, Jonathan Wilder Lavington, Mark SchmidtICLR 2023 · 5 citations
Related papers
- Generalizing Gaussian Smoothing for Random SearchKatelyn Gao, Ozan SenerICML 2022 · 22 citations
- BayeSQP: Bayesian Optimization through Sequential Quadratic ProgrammingPaul Brunzema, Sebastian TrimpeNeurIPS 2025 · 7 citations
- Global Optimization with a Power-Transformed Objective and Gaussian SmoothingChen XuICML 2025
- Revisiting Zeroth-Order Hessian Approximation: A Single-Step Policy Optimization LensJunbin Qiu, Zhaowei Hong, Renzhe Xu, Yao ShuICML 2026
- Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous BanditsArya Akhavan, Massimiliano Pontil, Alexandre B. TsybakovNeurIPS 2020 · 58 citations
