AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning

Dohyun Kwon, Hanbaek Lyu

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 2 citations (OpenAlex)

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
Add proximal regularization with a suitable coefficientWCPDL · Wasserstein CP-dictionary learningrelative reconstruction error vs. timeImproved
Set the proximal regularization coefficient to zero instead of using a suitable positive coefficient (ablation)WCPDL · Wasserstein CP-dictionary learningrelative reconstruction error vs. timeHurt
Use an entropic Wasserstein objective for distribution-valued dictionary learningWasserstein dictionary learning · Wasserstein barycenter problemgeometric representation of distributionsImproved
Vary the entropic regularization parameter \gamma (ablation)Wasserstein barycenter · Two \sqcup-shaped distributionsshape of the barycenter distribution: \gamma = 0.002; \gamma = 0.005Mixed

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