arXiv research

Zeroth-order optimization methods lack inherent privacy guarantees.

New method for zeroth-order stochastic gradient algorithms provides confidence intervals.

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 avoiding. To handle constrained optimization, we first propose generalizations of the conditional g…

A new method for MARL with partial observations reduces communication overhead.

Zeroth-order optimization is an important research topic in machine learning. In recent years, it has become a key tool in black-box adversarial attack to neural network based image classifiers. However, existing zeroth-order optimization algorithms rarely extract second-order information of the model function. In this…

New Hessian estimators for Riemannian manifolds with reduced bias.

Zeroth-order methods favor flat minima in machine learning.

New method uses zeroth-order queries to approximate proximal sampling efficiently.

We propose a method for zeroth order stochastic convex optimization that attains the suboptimality rate of $\tilde{\mathcal{O}}(n^{7}T^{-1/2})$ after $T$ queries for a convex bounded function $f:{\mathbb R}^n\to{\mathbb R}$. The method is based on a random walk (the \emph{Ball Walk}) on the epigraph of the function. Th…

We consider the problem of optimizing a high-dimensional convex function using stochastic zeroth-order queries. Under sparsity assumptions on the gradients or function values, we present two algorithms: a successive component/feature selection algorithm and a noisy mirror descent algorithm using Lasso gradient estimate…

Discretizations of Langevin diffusions provide a powerful method for sampling and Bayesian inference. However, such discretizations require evaluation of the gradient of the potential function. In several real-world scenarios, obtaining gradient evaluations might either be computationally expensive, or simply impossibl…

ConMeZO speeds up zeroth-order optimization for large language models.

New algorithms solve complex minimax problems without needing derivatives.

This paper reviews zeroth-order optimization in signal processing and machine learning.

ZOSPI improves RL policies with global value function exploitation.

This paper analyzes and guarantees convergence of prior-guided ZO algorithms.

New method improves zeroth-order stochastic optimization with adaptive sampling.

LAZO reduces query complexity and variance in ZO methods.

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-box learning problem, proximal gradient method could fail because the explicit gradients of these pro…

Optimal algorithms for Riemannian optimization with reduced complexity.

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 bandit feedback, ADMM could fail because the explicit gradients of these problems are difficult or in…

As application demands for zeroth-order (gradient-free) optimization accelerate, the need for variance reduced and faster converging approaches is also intensifying. This paper addresses these challenges by presenting: a) a comprehensive theoretical analysis of variance reduced zeroth-order (ZO) optimization, b) a nove…

New method estimates Riemannian derivatives from noisy function evaluations.

Improves zeroth-order optimization for private machine learning with public data.

We consider the problem of global optimization of an unknown non-convex smooth function with zeroth-order feedback. In this setup, an algorithm is allowed to adaptively query the underlying function at different locations and receives noisy evaluations of function values at the queried points (i.e. the algorithm has ac…

Paper proposes ZO-NGD for more efficient black-box attacks.

A new method for optimizing functions without gradients, improving efficiency and convergence.

New optimization method improves generalization across various tasks.

MAZE attacks a model without data, using synthetic inputs.

ZDPG learns model-free policies without critics, improving on PG.

Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.

Improved zeroth-order algorithms tackle nonconvex minimax problems with reduced complexity.

Paper proposes ZO-SMD for MERO, achieving optimal convergence rates.

LORENZA improves LLM fine-tuning efficiency and generalization.

Book covers tools for zeroth-order convex optimisation.

Zeroth-order (a.k.a, derivative-free) methods are a class of effective optimization methods for solving complex machine learning problems, where gradients of the objective functions are not available or computationally prohibitive. Recently, although many zeroth-order methods have been developed, these approaches still…

New algorithm tackles risk-aware learning problems efficiently.

Two new algorithms solve high-dimensional optimization problems without gradients.

In the learning to learn (L2L) framework, we cast the design of optimization algorithms as a machine learning problem and use deep neural networks to learn the update rules. In this paper, we extend the L2L framework to zeroth-order (ZO) optimization setting, where no explicit gradient information is available. Our lea…

Paper proposes algorithms for solving nonconvex-nonconcave problems with complexity guarantees.

Two types of zeroth-order stochastic algorithms have recently been designed for nonconvex optimization respectively based on the first-order techniques SVRG and SARAH/SPIDER. This paper addresses several important issues that are still open in these methods. First, all existing SVRG-type zeroth-order algorithms suffer …

Deep neural networks (DNNs) are one of the most prominent technologies of our time, as they achieve state-of-the-art performance in many machine learning tasks, including but not limited to image classification, text mining, and speech processing. However, recent research on DNNs has indicated ever-increasing concern o…

New stability conditions for ZO methods reveal unique regularization effects.

New method optimizes complex models with minimal data, proving global optimality.

We provide evidence for the conjecture that the Wodzicki-Chern classes vanish for all bundles with the group Z of invertible zeroth order pseudodifferential operators as structure group. In particular, we prove this vanishing if the structure group reduces to pseudodifferential operators with leading order symbol the i…

Simplifies noisy convex optimization with a new algorithm.

In this paper, we focus on solving an important class of nonconvex optimization problems which includes many problems for example signal processing over a networked multi-agent system and distributed learning over networks. Motivated by many applications in which the local objective function is the sum of smooth but po…

New algorithm reduces regret in stochastic bandit convex optimization.