AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

DR-Submodular Maximization with Stochastic Biased Gradients: Classical and Quantum Gradient Algorithms

Shengminjie Chen, Xiaoming Sun, Wenguo Yang, Jialin Zhang, Zihan Zhao

ICLR 2026 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use quantum zero-order gradient estimation instead of classical zero-order (ablation)DR-submodular maximization, general convex constraints · DR-submodular quadratic programming (d=3)convergence speedImproved
use quantum zero-order instead of classical first-order (ablation)DR-submodular maximization, down-closed constraints · DR-submodular quadratic programming (d=3)solution qualityHurt
use quantum zero-order instead of classical zero-order (ablation)DR-submodular maximization, largest-element constraint · Regular coverage maximization (d=3)solution qualityMixed

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