New Insight of Variance reduce in Zero-Order Hard-Thresholding: Mitigating Gradient Error and Expansivity Contradictions
Xinzhe Yuan (1), William de Vazelhes (2), Bin Gu (2, 3), Huan Xiong (1, 2) ((1) Harbin Institute of Technology, (2) Mohamed bin Zayed University of Artificial Intelligence, (3) Jilin University)

TL;DR
This paper introduces a variance-reduced zeroth-order hard-thresholding algorithm that overcomes previous limitations, improves convergence, and broadens applicability in sparse optimization tasks.
Contribution
It proposes a generalized variance reduction technique for ZO hard-thresholding, eliminating restrictions on random directions and enhancing convergence analysis.
Findings
The new algorithm removes the restriction on the number of random directions.
It achieves improved convergence rates over existing methods.
Demonstrates effectiveness on ridge regression and black-box adversarial attacks.
Abstract
Hard-thresholding is an important type of algorithm in machine learning that is used to solve constrained optimization problems. However, the true gradient of the objective function can be difficult to access in certain scenarios, which normally can be approximated by zeroth-order (ZO) methods. The SZOHT algorithm is the only algorithm tackling sparsity constraints with ZO gradients so far. Unfortunately, SZOHT has a notable limitation on the number of random directions % in ZO gradients due to the inherent conflict between the deviation of ZO gradients and the expansivity of the hard-thresholding operator. This paper approaches this problem by considering the role of variance and provides a new insight into variance reduction: mitigating the unique conflicts between ZO gradients and hard-thresholding. Under this perspective, we propose a generalized variance reduced…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
