atlas

Research map / Optimization / Nonconvex and smooth optimization

Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient Descent

NeurIPS 2025 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Proposes Local Curvature Descent, a gradient method with adaptive stepsizes that use local curvature information (without Hessian computation) for convex optimization, applied to standard and Polyak gradient descent.

Problem

Convex optimization with stepsizes that are more powerful and adaptive than standard fixed or classical choices, without paying the cost of full second-order methods that need Hessians.

Approach

Observes that for some problems (e.g., minimizing sums of squares of absolutely convex functions) local curvature can be exploited cheaply to set stepsizes, giving a Hessian-free curvature-aware variant of gradient descent and of Polyak stepsize gradient descent.

Experimental setup

Baselines: standard gradient descent Polyak gradient descent

Builds on: Polyak stepsize gradient descent

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