Related papers: Submodular Function Minimization and Polarity
We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut. We investigate these problems from the point of view of two possible…
We prove a sharp decay of capacity of sublevel sets of a $(\omega,m)$-subharmonic functions on a $n$-dimensional compact Hermitian manifold $(X,\omega)$ which generalizes the case $m=n$ as well as the case $1\leq m\leq n$ on a compact…
Robust optimization is becoming increasingly important in machine learning applications. In this paper, we study a unified framework of robust submodular optimization. We study this problem both from a minimization and maximization…
We study various regularization operators on plurisubharmonic functions that preserve Lelong classes with growth given by certain compact convex sets. The purpose is to show that the weighted Siciak-Zakharyuta functions associated with…
Functions with uniform sublevel sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used in multicriteria optimization, decision theory, mathematical…
We extend the traditional worst-case, minimax analysis of stochastic convex optimization by introducing a localized form of minimax complexity for individual functions. Our main result gives function-specific lower and upper bounds on the…
The study of combinatorial optimization problems with a submodular objective has attracted much attention in recent years. Such problems are important in both theory and practice because their objective functions are very general. Obtaining…
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
We consider the problem of maximizing a monotone nondecreasing set function under multiple constraints, where the constraints are also characterized by monotone nondecreasing set functions. We propose two greedy algorithms to solve the…
Optimization of DR-submodular functions has experienced a notable surge in significance in recent times, marking a pivotal development within the domain of non-convex optimization. Motivated by real-world scenarios, some recent works have…
Maximization of {\it non-submodular} functions appears in various scenarios, and many previous works studied it based on some measures that quantify the closeness to being submodular. On the other hand, many practical non-submodular…
Several large-scale machine learning tasks, such as data summarization, can be approached by maximizing functions that satisfy submodularity. These optimization problems often involve complex side constraints, imposed by the underlying…
Polar manifolds are Riemannian G-manifolds admitting a "section", i.e., a complete submanifold passing through every orbit and doing so orthogonally. We consider compact simply-connected polar manifolds and achieve an equivariantly…
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our…
Submodular functions have many applications. Matchings have many applications. The bitext word alignment problem can be modeled as the problem of maximizing a nonnegative, monotone, submodular function constrained to matchings in a complete…
In this paper we contribute to the frequently studied question of how to decompose a continuous piecewise linear (CPWL) function into a difference of two convex CPWL functions. Every CPWL function has infinitely many such decompositions,…
We give a complete description of outer functions in the analytic weighted Lipschitz algebras by their moduli in the boundary, with respect to any modulus of continuity.
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…
Submodular setfunctions play an important role in potential theory, and a perhaps even more important role in combinatorial optimization. The analytic line of research goes back to the work of Choquet; the combinatorial, to the work of Rado…
This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…