The Alternating Direction Method of Multipliers (ADMM) is a powerhouse algorithm for optimization, widely used in machine learning, statistics, and signal processing to solve problems with structured, non-smooth regularizers (such as LASSO or low-rank constraints). However, ADMM is notoriously sensitive to its "penalty parameter."
This paper introduces a novel adaptive penalization scheme that adjusts this parameter based on the objective function's "local sharpness." This approach leads to provably faster convergence rates in both deterministic and stochastic settings, without requiring traditional smoothness or strong convexity assumptions.
The Penalty Parameter Problem
ADMM's efficiency depends heavily on the penalty parameter ($\beta$) applied to its equality constraints. If $\beta$ is poorly chosen, convergence can be painfully slow. While "self-adaptive" methods—like residual balancing—exist to tune $\beta$ on the fly, they generally lack theoretical proof that they actually improve the convergence rate. Furthermore, most existing adaptive schemes do not translate well to the stochastic setting, where algorithms only have access to noisy gradients.
The authors bridge this gap by creating an adaptive ADMM that is both practically robust and theoretically superior.
Locally Adaptive ADMM (LA-ADMM)
The authors introduce Locally Adaptive ADMM (LA-ADMM) and its stochastic counterpart, LA-SADMM. The core innovation is tying the penalty parameter to a property called the Local Error Bound (LEB), or "local sharpness."
- Local Sharpness ($\theta$): This parameter characterizes how fast the objective function grows as you move away from the optimal solution set. For example, polyhedral functions (like those in linear programming) have $\theta = 1$, while piecewise quadratic functions have $\theta = 1/2$.
- Multi-Stage Strategy: Instead of tweaking $\beta$ every iteration, the algorithms operate in stages. At the end of each stage, the penalty parameter $\beta$ is doubled.
- Linearization: To handle complex constraints where the standard update step is difficult, the authors incorporate a linearized version of ADMM, making the subproblems easier to solve.
- Domain Shrinking (Stochastic): In the stochastic version (LA-SADMM), the algorithm also "shrinks" the feasible domain at each stage. This helps control the variance of the stochastic noise as the algorithm homes in on the true solution.
Theoretical and Empirical Speedups
The most significant insight of this work is that the local geometry of the objective function can be exploited to accelerate ADMM. By increasing the penalty parameter at a rate dictated by this sharpness, the algorithm achieves better complexity than standard ADMM.
In the deterministic setting, standard ADMM has a complexity of $O(1/\epsilon)$. LA-ADMM improves this to $O(1/\epsilon^{1-\theta})$. If the problem is "sharp" enough ($\theta=1$), the algorithm achieves linear convergence—a major theoretical win for a non-smooth, non-strongly convex solver. For stochastic optimization, standard methods usually suffer from $O(1/\epsilon^2)$ complexity. LA-SADMM reduces this to $\tilde{O}(1/\epsilon^{2(1-\theta)})$, making it vastly more efficient for large-scale problems.
The authors evaluated their algorithms on several standard benchmarks, including real-world datasets from the LIBSVM library (w8a and gisette) for SVM classification, and synthetic data for robust regression and low-rank representation. In experiments, LA-ADMM and LA-SADMM consistently converged faster than standard ADMM, even when the standard version's penalty parameter was manually fine-tuned. They also outperformed popular adaptive schemes like Residual Balancing (ADMM-RB) and Adaptive Penalty (ADMM-AP).
Practical Implementation: The Restarting Heuristic
One limitation of the foundational LA-ADMM framework is parameter dependency. The theoretical optimal stage length ($t$) and initial penalty ($\beta_1$) depend on the sharpness exponent $\theta$ and a constant $c$, which are often unknown in practice.
To address these unknown parameters, the authors propose "Restarting" variants of the algorithms. While these restarting mechanisms add a layer of heuristic complexity to the implementation, they allow the algorithms to dynamically adjust without requiring prior knowledge of the function's exact sharpness, making them highly effective in practice.
Overall, this paper provides a rigorous foundation for why and how we should adapt ADMM's penalty parameter, turning a common "dark art" of optimization into a principled, high-performance technique.
Summary updated