23/08/2020

A block decomposition algorithm for sparse optimization

Ganzhao Yuan, Li Shen, Wei-Shi Zheng

Keywords: NP-hard, nonconvex optimization, block coordinate descent, sparse optimization, convex optimization

Abstract Paper Similar Papers

Abstract: Sparse optimization is a central problem in machine learning and computer vision. However, this problem is inherently NP-hard and thus difficult to solve in general. Combinatorial search methods find the global optimal solution but are confined to small-sized problems, while coordinate descent methods are efficient but often suffer from poor local minima. This paper considers a new block decomposition algorithm that combines the effectiveness of combinatorial search methods and the efficiency of coordinate descent methods. Specifically, we consider a random strategy or/and a greedy strategy to select a subset of coordinates as the working set, and then perform a global combinatorial search over the working set based on the original objective function. We show that our method finds stronger stationary points than Amir Beck et al.’s coordinate-wise optimization method. In addition, we establish the convergence rate of our algorithm. Our experiments on solving sparse regularized and sparsity constrained least squares optimization problems demonstrate that our method achieves state-of-the-art performance in terms of accuracy. For example, our method generally outperforms the well-known greedy pursuit method.

The video of this talk cannot be embedded. You can watch it here:
https://dl.acm.org/doi/10.1145/3394486.3403070#sec-supp
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at KDD 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 14:17 
 0
 0
 0
 0
 16:18 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 19:34 
 0
 0
 0
 0
 2:58 
 0
 0
 0
 0
 13:59 
 0
 0
 0
 0
 15:01 
 0
 0
 0
 0
 5:47 
 0
 0
 0
 0
 3:01 
 0
 0
 0
 0
 3:01 
 0
 0
 0
 0
 18:06 
 0
 0
 0
 0
 20:11 
 0
 0
 0
 0
 15:10 
 0
 0
 0
 0
 13:10 
 1
 1
 0
 0
 3:29 
 0
 0
 0
 0
 4:56 
 0
 0
 0
 0
 6:05 
 0
 0
 0
 0
 3:02 
 0
 0
 0
 0
 8:23 
 0
 0
 0
 0
 14:56 
 0
 0
 0
 0
 13:46 
 0
 0
 0
 0
 16:07 
 0
 0
 1
 1
 16:17 
 0
 0
 0
 0
 14:41 
 0
 0
 0
 0
 15:31 
 0
 0
 0
 0
 7:27 
 0
 0
 0
 0
 4:48 
 0
 0
 0
 1
 3:01 
 0
 0
 0
 0
 2:54 
 0
 0
 0
 0
 10:14 
 0
 0
 0
 0
 3:13 
 0
 0
 0
 0
 13:14 
 0
 0
 0
 0
 3:12 
 0
 0
 0
 0
 3:07 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 1:01 
 0
 0
 0
 0
 13:18 
 0
 0
 0
 0
 10:44 
 0
 0
 0
 0
 7:40 
 0
 0
 0
 0
 3:23