AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Hamiltonian descent for composite objectives

Brendan O'Donoghue, Chris J. Maddison

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 1 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
worsen data conditioning from j=0 to j=20 (condition number 4.0 x 10^3 to 2.2 x 10^14)Gradient descent and other first-order baselines · Regularized least-squaresconvergence speed of primal objective error: 4.0 × 103 -> 2.2 × 1014Hurt
worsen data conditioning from j=0 to j=20Hamiltonian descent · Regularized least-squaresconvergence of primal objective error and duality gapNo clear effect
use Hamiltonian descent instead of proximal gradient descentHamiltonian descent · Logistic regression with elastic net, condition number 1.0 × 108primal objective errorImproved

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