Related papers: Submodular Function Minimization and Polarity
In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves the running time for constrained submodular maximization but…
Adaptive submodularity is a fundamental concept in stochastic optimization, with numerous applications such as sensor placement, hypothesis identification and viral marketing. We consider the problem of minimum cost cover of…
We provide theory for computing the lower semi-continuous convex envelope of functionals of the type f(x) plus an l2 misfit, and discuss applications to various non-convex optimization problems. The latter term is a data fit term whereas f…
We consider supervised learning problems in which set predictions provide explicit uncertainty estimates. Using Choquet integrals (a.k.a. Lov{\'a}sz extensions), we propose a convex loss function for nondecreasing subset-valued functions…
We study counting functions of planar polygons arising from homological mirror symmetry of elliptic curves. We first analyze the signature and rationality of the quadratic forms corresponding to the signed areas of planar polygons. Then we…
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In…
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower…
In earlier work we studied features of non-holomorphic modular functions associated with Feynman graphs for a conformal scalar field theory on a two-dimensional torus with zero external momenta at all vertices. Such functions, which we will…
We describe a `discretize-then-relax' strategy to globally minimize integral functionals over functions $u$ in a Sobolev space subject to Dirichlet boundary conditions. The strategy applies whenever the integral functional depends…
The Moreau envelope is one of the key convexity-preserving functional operations in convex analysis, and it is central to the development and analysis of many approaches for convex optimization. This paper develops the theory for an…
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…
Using results from theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
We provide a pointwise bipolar theorem for liminf-closed convex sets of positive Borel measurable functions on a sigma-compact metric space without the assumption that the polar is a tight set of measures. As applications we derive a…
We develop a differential theory for the polarity transform parallel to that for the Legendre transform, which is applicable when the functions studied are "geometric convex", namely convex, non-negative and vanish at the origin. This…
We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For a vast range of algorithms, the existence of an oracle to a…
We obtain a complete description of the Riesz measures of almost periodic subharmonic functions with at most of linear growth on the complex plane; as a consequence we get a complete description of zero sets for the class of entire…
This paper is concerned with minimizing a sum of rational functions over a compact set of high-dimension. Our approach relies on the second Lasserre's hierarchy (also known as the upper bounds hierarchy) formulated on the pushforward…
In this paper, we consider a finite-dimensional optimization problem minimizing a continuous objective on a compact domain subject to a multi-dimensional constraint function. For the latter, we assume the availability of a global Lipschitz…