paper-with-me

홈 › Papers

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 weights algorithm, when run with this estimator instead of exact gradients, converge at a $\mathcal O(T^{-1/4})$ rate.

📄 PDF Abstract BibTeX arXiv:2208.01185

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization

2020-08-18 · Feihu Huang, Shangqian Gao, Jian Pei, Heng Huang

In the paper, we propose a class of accelerated zeroth-order and first-order momentum methods for both nonconvex mini-optimization and minimax-optimization. Specifically, we propose a new accelerated zeroth-order momentu…

Adversarial Attack

Gradient Free Minimax Optimization: Variance Reduction and Faster Convergence

2020-06-16 · Tengyu Xu, Zhe Wang, Yingbin Liang, H. Vincent Poor

Many important machine learning applications amount to solving minimax optimization problems, and in many cases there is no access to the gradient information, but only the function values. In this paper, we focus on suc…

Stochastic Optimization

Zeroth-Order Stochastic Alternating Direction Method of Multipliers for Nonconvex Nonsmooth Optimization

2019-05-29 · Feihu Huang, Shangqian Gao, Songcan Chen, Heng Huang

Alternating direction method of multipliers (ADMM) is a popular optimization tool for the composite and constrained problems in machine learning. However, in many machine learning problems such as black-box attacks and b…

Adversarial AttackBIG-bench Machine LearningBinary Classification

Zeroth-Order Nonconvex Nonsmooth Optimization with Heavy-Tailed Noise

2026-05-23 · Zhuanghua Liu, Luo Luo arxiv

This paper considers the nonconvex nonsmooth problem in which the objective function is Lipschitz continuous. We focus on the stochastic setting where the algorithm can access stochastic function value evaluations with h…

Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization

2019-02-16 · Feihu Huang, Bin Gu, Zhouyuan Huo, Songcan Chen 외

Proximal gradient method has been playing an important role to solve many machine learning tasks, especially for the nonsmooth problems. However, in some machine learning problems such as the bandit model and the black-b…

BIG-bench Machine Learning