To convexify or not? Regression with clustering penalties on graphs
Lists
Only you see this
Abstract
We consider minimization problems that are compositions of convex functions of a vector x ∈ ℝ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> with submodular set functions of its support (i.e., indices of the non-zero coefficients of x). Such problems are in general difficult for large N due to their combinatorial nature. In this setting, existing approaches rely on “convexifications” of the submodular set function based on the Lovász extension for tractable approximations. In this paper, we first demonstrate that such convexifications can fundamentally change the nature of the underlying submodular regularization. We then provide a majorization-minimization framework for the minimization of such composite objectives. For concreteness, we use the Ising model to motivate a submodular regularizer, establish the total variation semi-norm as its Lovász extension, and numerically illustrate our new optimization framework.
BibTeX
@inproceedings{halabi2013convexify,
author = {Marwa El Halabi and Luca Baldassarre and Volkan Cevher},
title = {{To convexify or not? Regression with clustering penalties on graphs}},
booktitle = {CAMSAP},
year = {2013},
doi = {10.1109/camsap.2013.6713997},
}| Sample-Efficient L0-L2 Constrained Structure Learning of Sparse Ising Models | AAAI · 2021 |
| Structured Sparsity: Discrete and Convex approaches | arXiv · 2015 |
| Convex Relaxation for Combinatorial Penalties | arXiv · 2012 |
| Learning with Submodular Functions: A Convex Optimization Perspective | Found. Trends Mach. Learn · 2013 |
| Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model | NeurIPS · 2020 |
| Regularizers for structured sparsity | arXiv · 2010 |