A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection

11/19/2017
by   Ganzhao Yuan, et al.
0

Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data. However, such a problem is difficult to solve since it is NP-hard. Existing solutions are primarily based on convex ℓ_1 approximation and iterative hard thresholding, which only lead to sub-optimal solutions. In this work, we propose a coordinate-wise optimization algorithm to solve this problem which is guaranteed to converge to a coordinate-wise minimum point. The algorithm iteratively and greedily selects one variable or swaps two variables to identify the support set, and then solves a reduced convex optimization problem over the support set to achieve the greatest descent. As a side contribution of this paper, we propose a Newton-like algorithm to solve the reduced convex sub-problem. Finally, we demonstrate the efficacy of our method on synthetic data and real-world data sets. As a result, the proposed method achieves state-of-the-art performance in term of accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2015

ICR: Iterative Convex Refinement for Sparse Signal Recovery Using Spike and Slab Priors

In this letter, we address sparse signal recovery using spike and slab p...
research
02/26/2018

A Decomposition Algorithm for Sparse Generalized Eigenvalue Problem

Sparse generalized eigenvalue problem arises in a number of standard and...
research
01/30/2022

Coordinate Descent Methods for Fractional Minimization

We consider a class of structured fractional minimization problems, in w...
research
05/27/2019

A Block Decomposition Algorithm for Sparse Optimization

Sparse optimization is a central problem in machine learning and compute...
research
11/29/2018

Feature selection with optimal coordinate ascent (OCA)

In machine learning, Feature Selection (FS) is a major part of efficient...
research
03/11/2020

Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization

A framework based on iterative coordinate minimization (CM) is developed...
research
02/09/2023

High-fidelity Interpretable Inverse Rig: An Accurate and Sparse Solution Optimizing the Quartic Blendshape Model

We propose a method to fit arbitrarily accurate blendshape rig models by...

Please sign up or login with your details

Forgot password? Click here to reset