atlas

Research map / Optimization / Nonconvex and smooth optimization

Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 projected SGD with Markovian (dependent) data instead of i.i.d. sampling in constrained smooth nonconvex optimizationprojected SGD · constrained smooth nonconvex with dependent datacomplexity for eps-stationarity: from O~(eps^-8) (prior SMM) to O~(eps^-4)Helped
Replace stationary-interior assumption with none (iterates may lie on constraint boundary) for dependent-data analysisprojected SGD with dependent data · constrained smooth nonconvexcomplexityNo clear effect
Use AdaGrad-norm step sizes instead of decaying schedule under dependent dataAdaGrad-norm · Online NMF on Caltech Facebook subgraph streamreconstruction error vs timeHelped
Dataset change from Caltech to UCLA/Wisconsin for online NMF comparison of AdaGrad/PSGD/SMMAdaGrad vs other methods · Online NMF on UCLA26 and Wisconsin87reconstruction error vs timeNo clear effect

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