Related papers: A compact representation for minimizers of $k$-sub…
This paper considers submodular function minimization (SFM) restricted to a family of subsets. We show that SFM over complements of families with certain hierarchical structures can be solved in polynomial-time. This yields a…
We give a direct proof of an important result of Solynin which says that the Poincar\'e metric is a strongly submultiplicative domain function. This result is then used to define a new capacity for compact subsets of the complex plane…
We study connectivity functions, that is, integer-valued symmetric submodular functions on a finite ground set attaining $0$ on the empty set. For a connectivity function $f$ on an $n$-element set $V$ and an integer $k\ge 0$, we show that…
We study algorithms for the Submodular Multiway Partition problem (SubMP). An instance of SubMP consists of a finite ground set $V$, a subset of $k$ elements $S = \{s_1,s_2,...,s_k\}$ called terminals, and a non-negative submodular set…
Using the matrix representation of Fourier integral operators with respect to a Gabor frame, we study their compactness on weighted modulation spaces. As a consequence, we recover and improve some compactness results for pseudodifferential…
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…
In model selection problems for machine learning, the desire for a well-performing model with meaningful structure is typically expressed through a regularized optimization problem. In many scenarios, however, the meaningful structure is…
We present a general framework of localized operators, i.e., operators whose matrix coefficients with respect to the Gabor frame are concentrated on the diagonal. We show that localized operators are bounded between modulation spaces, and…
Let K be the unit-cube in Rn and f\,: K $\rightarrow$ R^n be a Morse function. We assume that the function f is given by an evaluation program $\Gamma$ in the noisy model, i.e., the evaluation program $\Gamma$ takes an extra parameter…
We study a mixed-integer set $S:=\{(x,t) \in \{0,1\}^n \times \mathbb{R}: f(x) \ge t\}$ arising in the submodular maximization problem, where $f$ is a submodular function defined over $\{0,1\}^n$. We use intersection cuts to tighten a…
In this paper we study complex representations of the factorpower $\fp(G,M)$ of a finite group $G$ acting on a finite set $M$. This includes the finite monoid $\FP$, which can be seen as a kind of a ``balanced'' generalization of the…
Submodular function minimization is a fundamental optimization problem that arises in several applications in machine learning and computer vision. The problem is known to be solvable in polynomial time, but general purpose algorithms have…
The submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible solutions for many instances while guaranteeing…
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…
Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little…
The paper is devoted to a study of the cone $\cop$ of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a subset of the cone $\cop$ and use them…
We consider the maximization problem in the value oracle model of functions defined on $k$-tuples of sets that are submodular in every orthant and $r$-wise monotone, where $k\geq 2$ and $1\leq r\leq k$. We give an analysis of a…
This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…
Following ideas of Geck and Rouquier, we show that there exists a ``canonical basic set'' of Specht modules in bijection with the simple modules of Ariki-Koike algebras at roots of unity. Moreover, we determine the parametrization of this…
Submodularity is one of the most important property of combinatorial optimization, and $k$-submodularity is a generalization of submodularity. Maximization of $k$-submodular function is NP-hard, and approximation algorithms are studied. For…