paper-with-me

홈 › Papers

Improving the Straight-Through Estimator with Zeroth-Order Information

2025-10-27 · Ningfeng Yang, Tor M. Aamodt arxiv

We study the problem of training neural networks with quantized parameters. Learning low-precision quantized parameters by enabling computation of gradients via the Straight-Through Estimator (STE) can be challenging. While the STE enables back-propagation, which is a first-order method, recent works have explored the use of zeroth-order (ZO) gradient descent for fine-tuning. We note that the STE provides high-quality biased gradients, and ZO gradients are unbiased but can be expensive. We thus propose First-Order-Guided Zeroth-Order Gradient Descent (FOGZO) that reduces STE bias while reducing computations relative to ZO methods. Empirically, we show FOGZO improves the tradeoff between quality and training time in Quantization-Aware Pre-Training. Specifically, versus STE at the same number of iterations, we show a 1-8\% accuracy improvement for DeiT Tiny/Small, 1-2\% accuracy improvement on ResNet 18/50, and 1-22 perplexity point improvement for LLaMA models with up to 0.3 billion parameters. For the same loss, FOGZO yields a 796$\times$ reduction in computation versus n-SPSA for a 2-layer MLP on MNIST. Code is available at https://github.com/1733116199/fogzo.

📄 PDF Abstract BibTeX arXiv:2510.23926

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Cooperative Multi-Agent Reinforcement Learning with Partial Observations

2020-06-18 · Yan Zhang, Michael M. Zavlanos

In this paper, we propose a distributed zeroth-order policy optimization method for Multi-Agent Reinforcement Learning (MARL). Existing MARL algorithms often assume that every agent can observe the states and actions of …

Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality and Saddle-Points

2018-09-17 · NeurIPS 2018 · Krishnakumar Balasubramanian, Saeed Ghadimi

In this paper, we propose and analyze zeroth-order stochastic approximation algorithms for nonconvex and convex optimization, with a focus on addressing constrained optimization, high-dimensional setting and saddle-point…

Stochastic OptimizationVocal Bursts Intensity Prediction

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions

2024-12-29 · Yuya Hikima, Akiko Takeda

In this study, we consider an optimization problem with uncertainty dependent on decision variables, which has recently attracted attention due to its importance in machine learning and pricing applications. In this prob…

Zeroth-Order Non-Log-Concave Sampling with Variance Reduction and Applications to Inverse Problems

2026-05-28 · M. Berk Sahin, Behzad Sharif, Abolfazl Hashemi arxiv

Sampling from high-dimensional, non-log-concave distributions with unnormalized densities remains a fundamental challenge in machine learning, particularly in black-box settings where gradient information is inaccessible…

A Note on Zeroth-Order Optimization on the Simplex

2022-08-02 · Tijana Zrnic, Eric Mazumdar

We construct a zeroth-order gradient estimator for a smooth function defined on the probability simplex. The proposed estimator queries the simplex only. We prove that projected gradient descent and the exponential weigh…