paper-with-me

홈 › Papers

LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization

2026-06-08 · Binh Nguyen, Trinh Tran, Truong X. Nghiem arxiv

We propose LEAF, a learning-enabled ADMM framework for accelerated convex optimization. The key idea is to approximate the Moreau envelope of the objective function using an Input Convex Neural Network (ICNN), resulting in a learned model that preserves convexity and smoothness. This leads to the proposed Moreau Envelope Learning ADMM (MEL-ADMM) and its splitting variant sMEL-ADMM. Unlike existing approaches that learn high-dimensional operators directly, LEAF learns a scalar-valued Moreau envelope, significantly reducing model complexity and improving data efficiency. The framework accommodates a broad class of convex problems with smooth and non-smooth objectives. By embedding convexity explicitly through the ICNN architecture, the proposed approach maintains high approximation accuracy while preserving key structural properties of the optimization problem. Both MEL-ADMM and sMEL-ADMM are developed with theoretical guarantees of convergence and feasibility under the learned model. Rigorous analysis shows that the proposed methods achieve convergence rates comparable to classical ADMM while reducing per-iteration computational cost. Numerical experiments demonstrate up to an order-of-magnitude speedup over state-of-the-art solvers while maintaining low optimality gaps

📄 PDF Abstract BibTeX arXiv:2606.08993

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Accelerated Variance Reduced Stochastic ADMM

2017-07-11 · Yuanyuan Liu, Fanhua Shang, James Cheng

Recently, many variance reduced stochastic alternating direction method of multipliers (ADMM) methods (e.g.\ SAG-ADMM, SDCA-ADMM and SVRG-ADMM) have made exciting progress such as linear convergence rates for strongly co…

Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming

2016-06-29 · Yangyang Xu

Motivated by big data applications, first-order methods have been extremely popular in recent years. However, naive gradient methods generally converge slowly. Hence, much efforts have been made to accelerate various fir…

DenoisingImage Denoising

ADMM-SOFTMAX : An ADMM Approach for Multinomial Logistic Regression

2019-01-27 · Samy Wu Fung, Sanna Tyrväinen, Lars Ruthotto, Eldad Haber

We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples an…

General Classificationimage-classificationImage Classificationregression+1

Differentially Private ADMM Algorithms for Machine Learning

2020-10-31 · Tao Xu, Fanhua Shang, Yuanyuan Liu, Hongying Liu 외

In this paper, we study efficient differentially private alternating direction methods of multipliers (ADMM) via gradient perturbation for many machine learning problems. For smooth convex loss functions with (non)-smoot…

BIG-bench Machine Learning

How is Distributed ADMM Affected by Network Topology?

2017-10-02 · Guilherme França, José Bento

When solving consensus optimization problems over a graph, there is often an explicit characterization of the convergence rate of Gradient Descent (GD) using the spectrum of the graph Laplacian. The same type of problems…

valid