paper-with-me

Papers

Deep Submodular Functions

2017-01-31 · Jeffrey Bilmes, Wenruo Bai

We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call {\em deep submodular functions} or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share many of the properties and advantages of deep neural networks (DNNs). DSFs can be motivated by considering a hierarchy of descriptive concepts over ground elements and where one wishes to allow submodular interaction throughout this hierarchy. Results in this paper show that DSFs constitute a strictly larger class of submodular functions than SCMMs. We show that, for any integer $k>0$, there are $k$-layer DSFs that cannot be represented by a $k'$-layer DSF for any $k'<k$. This implies that, like DNNs, there is a utility to depth, but unlike DNNs, the family of DSFs strictly increase with depth. Despite this, we show (using a "backpropagation" like method) that DSFs, even with arbitrarily large $k$, do not comprise all submodular functions. In offering the above results, we also define the notion of an antitone superdifferential of a concave function and show how this relates to submodular functions (in general), DSFs (in particular), negative second-order partial derivatives, continuous submodularity, and concave extensions. To further motivate our analysis, we provide various special case results from matroid theory, comparing DSFs with forms of matroid rank, in particular the laminar matroid. Lastly, we discuss strategies to learn DSFs, and define the classes of deep supermodular functions, deep difference of submodular functions, and deep multivariate submodular functions, and discuss where these can be useful in applications.

📄 PDF Abstract BibTeX arXiv:1701.08939

Code (0)

등록된 구현이 없습니다.

Tasks

Descriptive

Similar Papers 제목 키워드 기반

Concave Aspects of Submodular Functions

2020-06-27 · Rishabh Iyer, Jeff Bilmes

Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials…

A Parameterized Family of Meta-Submodular Functions

2020-06-23 · Mehrdad Ghadiri, Richard Santiago, Bruce Shepherd

Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of …

Diversity

Learning and Optimization with Submodular Functions

2015-05-07 · Bharath Sankaran, Marjan Ghazvininejad, Xinran He, David Kale 외

In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be comp…

Continuous Submodular Function Maximization

2020-06-24 · Yatao Bian, Joachim M. Buhmann, Andreas Krause

Continuous submodular functions are a category of generally non-convex/non-concave functions with a wide spectrum of applications. The celebrated property of this class of functions - continuous submodularity - enables b…

Learning with Submodular Functions: A Convex Optimization Perspective

2011-11-28 · Francis Bach

Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions…

BIG-bench Machine LearningClusteringCombinatorial OptimizationExperimental Design