Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity

zbMath1468.68177arXiv1606.03841MaRDI QIDQ4558504

Quanming Yao, James T. Kwok

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1606.03841

zbMATH Keywords

matrix completionnonconvex optimizationproximal algorithmFrank-Wolfe algorithmnonconvex regularization

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Accelerated inexact composite gradient methods for nonconvex spectral optimization problems ⋮ An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems ⋮ An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems ⋮ Average curvature FISTA for nonconvex smooth composite optimization problems ⋮ An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems ⋮ A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems

Uses Software

• softImpute

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nearly unbiased variable selection under minimax concave penalty
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Gradient methods for minimizing composite functions
• Smoothing methods for nonsmooth, nonconvex minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• A generalized conditional gradient method and its connection to an iterative shrinkage method
• Characterization of the subdifferential of some matrix norms
• A variational approach to remove outliers and impulse noise
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Nonsmooth analysis of singular values. II: Applications
• Exact matrix completion via convex optimization
• Restoration of Images Corrupted by Impulse Noise and Mixed Gaussian Impulse Noise Using Blind Inpainting
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Robust principal component analysis?
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• The Proximal Average: Basic Theory
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Sparsity and Smoothness Via the Fused Lasso
• Angewandte Mathematik: Body and Soul
• A Proximal Stochastic Gradient Method with Progressive Variance Reduction
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Low-Rank Optimization with Trace Norm Penalty
• Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
• Compressed sensing

This page was built for publication: Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity