Cover Image

Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gu, Bin, Wei, Xiyuan, Zhang, Hualin, Chang, Yi, Huang, Heng
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
by: de Vazelhes, William, et al.
Published: (2022)

Riemannian Zeroth-Order Gradient Estimation with Structure-Preserving Metrics for Geodesically Incomplete Manifolds
by: Ma, Shaocong, et al.
Published: (2026)

On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization
by: Ma, Shaocong, et al.
Published: (2025)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
by: Chen, Ziyi, et al.
Published: (2025)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
by: Gu, Zhihao, et al.
Published: (2024)

On the Inherent Privacy of Zeroth Order Projected Gradient Descent
by: Gupta, Devansh, et al.
Published: (2025)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
by: Zhang, Huiling, et al.
Published: (2024)

Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions
by: Ye, Haishan
Published: (2025)

Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
by: He, Chang, et al.
Published: (2024)

Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations
by: Ma, Shaocong, et al.
Published: (2025)

On Adaptivity in Zeroth-Order Optimization
by: Dbouk, Hassan, et al.
Published: (2026)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
by: Kou, Yiwen, et al.
Published: (2024)

Double Momentum Method for Lower-Level Constrained Bilevel Optimization
by: Shi, Wanli, et al.
Published: (2024)

LORENZA: Enhancing Generalization in Low-Rank Gradient LLM Training via Efficient Zeroth-Order Adaptive SAM
by: Refael, Yehonathan, et al.
Published: (2025)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)

Zeroth-Order Optimization at the Edge of Stability
by: Song, Minhak, et al.
Published: (2026)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing
by: Aghasi, Alireza, et al.
Published: (2024)

Private Zeroth-Order Nonsmooth Nonconvex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)

Unlocking TriLevel Learning with Level-Wise Zeroth Order Constraints: Distributed Algorithms and Provable Non-Asymptotic Convergence
by: Jiao, Yang, et al.
Published: (2024)

Zeroth-Order Optimization Finds Flat Minima
by: Zhang, Liang, et al.
Published: (2025)

A Randomized Zeroth-Order Hierarchical Framework for Heterogeneous Federated Learning
by: Qiu, Yuyang, et al.
Published: (2025)

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

VAMO: Efficient Zeroth-Order Variance Reduction for SGD with Faster Convergence
by: Chen, Jiahe, et al.
Published: (2025)

HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization
by: Huang, Feihu, et al.
Published: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Certified Multi-Fidelity Zeroth-Order Optimization
by: de Montbrun, Étienne, et al.
Published: (2023)

A Zeroth-Order Proximal Algorithm for Consensus Optimization
by: Wang, Chengan, et al.
Published: (2024)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
by: Ji, Kaiyi
Published: (2025)

Adaptive Federated Minimax Optimization with Lower Complexities
by: Huang, Feihu, et al.
Published: (2022)

Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm
by: Yao, Wei, et al.
Published: (2024)

Stochastic Gradient Descent with Strategic Querying
by: Jiang, Nanfei, et al.
Published: (2025)

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
by: Mhanna, Elissa, et al.
Published: (2024)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Locally Regularized Sparse Graph by Fast Proximal Gradient Descent
by: Sun, Dongfang, et al.
Published: (2024)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
by: Shen, Weiping, et al.
Published: (2026)

Unbiased Single-Queried Gradient for Combinatorial Objective
by: Sornwanee, Thanawat
Published: (2026)

The Stochastic Proximal Distance Algorithm
by: Jiang, Haoyu, et al.
Published: (2022)

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
by: Li, Junyi, et al.
Published: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
by: Jin, Ruiyang, et al.
Published: (2025)