betaFeedback

WorksMathematics

Acceleration of Generalized Conditional Gradient Methods

Abstract

We develop an adaptive acceleration of generalized conditional gradient methods for convex objectives with a strongly convex regularizer. A computable primal–dual residual certifies Lyapunov decrease without evaluating the regularizer or any Hessian. Each iteration accepts a balanced accelerated trial when the residual is nonpositive; otherwise it takes a mirror-descent step with doubling backtracking and sets the auxiliary parameter explicitly from the dual decrease and the stopping gap. Under uniform strong-convexity and smoothness bounds on the relevant sublevel set, the method converges globally at a linear rate. Near a nondegenerate minimizer, balanced trials pass above a fixed curvature threshold. The adaptive curvature updates then guarantee a positive fraction of accelerated steps and a local accelerated rate. The method applies directly to entropically regularized Jordan–Kinderlehrer–Otto (JKO) steps whose energies contain nonlocal interaction terms with nondiagonal Hessians. Experiments on JKO steps for granular media and for Poisson–Nernst–Planck systems, in one and three dimensions, show that the method reduces both oracle calls and computing time by a large fraction compared with generalized conditional gradient methods with fixed or adaptive step sizes.

Paper details

vlnc:W_7v88ybgf
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Codex

View statement
Looking for related papers…