Table of Contents
Fetching ...

ALiA: Adaptive Linearized ADMM

Uijeong Jang, Kaizhao Sun, Wotao Yin, Ernest K Ryu

TL;DR

ALiA is a variant of function-linearized proximal ADMM, which generalizes the classical ADMM by leveraging the differentiable structure of the objective function, making it highly versatile and establishing point convergence of ALiA for convex and differentiable objectives.

Abstract

We propose ALiA, a novel adaptive variant of the alternating direction method of multipliers (ADMM). Specifically, ALiA is a variant of function-linearized proximal ADMM (FLiP ADMM), which generalizes the classical ADMM by leveraging the differentiable structure of the objective function, making it highly versatile. Notably, ALiA features an adaptive stepsize selection scheme that eliminates the need for backtracking linesearch. Motivated by recent advances in adaptive gradient and proximal methods, we establish point convergence of ALiA for convex and differentiable objectives. Furthermore, by introducing negligible computational overhead, we develop an alternative stepsize selection scheme for ALiA that improves the convergence speed both theoretically and empirically. Extensive numerical experiments on practical datasets confirm the accelerated performance of ALiA compared to standard FLiP ADMM. Additionally, we demonstrate that ALiA either outperforms or matches the practical performance of existing adaptive methods across problem classes where it is applicable.

ALiA: Adaptive Linearized ADMM

TL;DR

ALiA is a variant of function-linearized proximal ADMM, which generalizes the classical ADMM by leveraging the differentiable structure of the objective function, making it highly versatile and establishing point convergence of ALiA for convex and differentiable objectives.

Abstract

We propose ALiA, a novel adaptive variant of the alternating direction method of multipliers (ADMM). Specifically, ALiA is a variant of function-linearized proximal ADMM (FLiP ADMM), which generalizes the classical ADMM by leveraging the differentiable structure of the objective function, making it highly versatile. Notably, ALiA features an adaptive stepsize selection scheme that eliminates the need for backtracking linesearch. Motivated by recent advances in adaptive gradient and proximal methods, we establish point convergence of ALiA for convex and differentiable objectives. Furthermore, by introducing negligible computational overhead, we develop an alternative stepsize selection scheme for ALiA that improves the convergence speed both theoretically and empirically. Extensive numerical experiments on practical datasets confirm the accelerated performance of ALiA compared to standard FLiP ADMM. Additionally, we demonstrate that ALiA either outperforms or matches the practical performance of existing adaptive methods across problem classes where it is applicable.
Paper Structure (46 sections, 14 theorems, 181 equations, 5 figures, 3 algorithms)

This paper contains 46 sections, 14 theorems, 181 equations, 5 figures, 3 algorithms.

Key Result

theorem 1

Assume $f_1$ and $g_1$ are convex, closed, and proper. Assume $f_2$ and $g_2$ are convex and locally smooth. Assume $\mathbf{L}$ has a saddle point (not necessarily unique). Then the sequence $\{(x^k, y^k, u^k)\}_{k=0,1,2,\dots}$ generated by alg:A1 with Subroutine alg:S1 converges to a saddle point

Figures (5)

  • Figure 1: Performance of \ref{['alg:A1']} vs. other baselines on the depth map estimation problem with three different NYU Depth V2 images. \ref{['alg:A1']} (labeled as Subroutine \ref{['alg:S1']} and Subroutine \ref{['alg:S2']}) consistently outperforms the non-adaptive and adaptive baselines. We also observe that \ref{['alg:A1']} with Subroutine \ref{['alg:S2']} performs no worse than \ref{['alg:A1']} with Subroutine \ref{['alg:S1']}.
  • Figure 2: Performance of \ref{['alg:A1']} versus the baseline methods on the hyperspectral image unmixing problem under both convex and nonconvex block formulations. \ref{['alg:A1']} converges competitively across all settings. Moreover, its convergence behavior is stable with respect to the choice of block formulation, whereas the competing methods often exhibit significant slowdowns for certain block formulations. We note that the Malistky--Pock method relies on backtracking line searches, which incur a higher per-iteration cost, whereas ALiA does not. We also observe that \ref{['alg:A1']} with Subroutine \ref{['alg:S2']} performs no worse than \ref{['alg:A1']} with Subroutine \ref{['alg:S1']}. Methods not shown in the plot did not converge within the given number of iterations.
  • Figure 3: Performance of \ref{['alg:A1']} vs. baseline methods on the dual lasso problem with $\lambda=0.1$ and datasets abalone, cpusmall scale, and housing scale. \ref{['alg:A1']} generally outperforms, or is competitive with, the other adaptive baselines. We also observe that \ref{['alg:A1']} with Subroutine \ref{['alg:S2']} performs no worse than \ref{['alg:A1']} with Subroutine \ref{['alg:S1']}.
  • Figure 4: Performance of \ref{['alg:A1']} vs. baseline methods on the least absolute deviation problem with $\lambda=0.1$ and datasets abalone, cpusmall scale, and housing scale. \ref{['alg:A1']} is competitive with other adaptive methods. We note that other adaptive methods rely on backtracking line searches, which incur a higher per-iteration cost, whereas \ref{['alg:A1']} does not. We also observe that \ref{['alg:A1']} with Subroutine \ref{['alg:S2']} performs no worse than \ref{['alg:A1']} with Subroutine \ref{['alg:S1']}.
  • Figure 5: Performance of \ref{['alg:A1']} vs. baseline methods on the dual SVM problem with $C=0.1$ and datasets svmguide3, heart scale, and synthetic data. \ref{['alg:A1']} is competitive with other adaptive methods. We also observe that \ref{['alg:A1']} with Subroutine \ref{['alg:S2']} performs no worse than \ref{['alg:A1']} with Subroutine \ref{['alg:S1']}.

Theorems & Definitions (21)

  • theorem 1
  • lemma thmcounterlemma
  • lemma thmcounterlemma
  • theorem 2
  • lemma thmcounterlemma
  • lemma thmcounterlemma
  • proof
  • lemma thmcounterlemma
  • proof
  • lemma thmcounterlemma
  • ...and 11 more