atlas

Research map / Optimization / Nonconvex and smooth optimization

Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization

ICML 2024 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Gradient Compressed Sensing, a query-efficient zeroth-order gradient estimator for approximately sparse high-dimensional nonconvex optimization, using compressed sensing to reduce per-step queries.

Problem

Zeroth-order optimization in high dimensions needs many function queries per step; existing sparse-gradient methods need O(s log(d/s)) queries per step for approximately s-sparse gradients, and the paper targets reducing this query cost.

Approach

Uses compressed sensing ideas to build a gradient estimator for approximately sparse gradients that needs fewer queries per step than prior sparse-gradient ZOO estimators, while keeping the same convergence rate.

Key results

Limitations

Experimental setup

Builds on: compressed sensing zeroth-order gradient estimation

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy