paper-with-me

홈 › Papers

An Empirical Study of ADMM for Nonconvex Problems

2016-12-10 · Zheng Xu, Soham De, Mario Figueiredo, Christoph Studer, Tom Goldstein

The alternating direction method of multipliers (ADMM) is a common optimization tool for solving constrained and non-differentiable problems. We provide an empirical study of the practical performance of ADMM on several nonconvex applications, including l0 regularized linear regression, l0 regularized image denoising, phase retrieval, and eigenvector computation. Our experiments suggest that ADMM performs well on a broad class of non-convex problems. Moreover, recently proposed adaptive ADMM methods, which automatically tune penalty parameters as the method runs, can improve algorithm efficiency and solution quality compared to ADMM with a non-tuned penalty.

📄 PDF Abstract BibTeX arXiv:1612.03349

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingImage DenoisingregressionRetrieval

Methods 이 논문이 사용한 방법론

ADMM The alternating direction method of multipliers (ADMM) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are…

Similar Papers 제목 키워드 기반

Stochastic Alternating Direction Method of Multipliers with Variance Reduction for Nonconvex Optimization

2016-10-10 · Feihu Huang, Songcan Chen, Zhaosong Lu

In the paper, we study the stochastic alternating direction method of multipliers (ADMM) for the nonconvex optimizations, and propose three classes of the nonconvex stochastic ADMM with variance reduction, based on diffe…

Mini-Batch Stochastic ADMMs for Nonconvex Nonsmooth Optimization

2018-02-08 · Feihu Huang, Songcan Chen

With the large rising of complex data, the nonconvex models such as nonconvex loss function and nonconvex regularizer are widely used in machine learning and pattern recognition. In this paper, we propose a class of mini…

Nonconvex Zeroth-Order Stochastic ADMM Methods with Lower Function Query Complexity

2019-07-30 · Feihu Huang, Shangqian Gao, Jian Pei, Heng Huang

Zeroth-order (a.k.a, derivative-free) methods are a class of effective optimization methods for solving complex machine learning problems, where gradients of the objective functions are not available or computationally p…

Adversarial Attack

Continuous Relaxation of MAP Inference: A Nonconvex Perspective

2018-02-21 · CVPR 2018 6 · D. Khuê Lê-Huu, Nikos Paragios

In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this relaxation is tight, and a discrete stationary point of it can be …

Zeroth-Order Stochastic Alternating Direction Method of Multipliers for Nonconvex Nonsmooth Optimization

2019-05-29 · Feihu Huang, Shangqian Gao, Songcan Chen, Heng Huang

Alternating direction method of multipliers (ADMM) is a popular optimization tool for the composite and constrained problems in machine learning. However, in many machine learning problems such as black-box attacks and b…

Adversarial AttackBIG-bench Machine LearningBinary Classification