相关论文: On the Supremum of Singleton Ratios in Submodular …

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…

We obtain lower bounds for the maximum dimension of a simple FG-module, where G is a finite group and F is an algebraically closed field of characteristic p. The bounds are described in terms of properties of p-subgroups of G. When p is 2…

Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…

We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that…

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

In submodular covering problems, we are given a monotone, nonnegative submodular function $f: 2^N \rightarrow\mathbb{R}_+$ and wish to find the min-cost set $S\subseteq N$ such that $f(S)=f(N)$. This captures SetCover when $f$ is a coverage…

We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$. An…

Let $u$ and $v$ be harmonic in $ \Omega \subset \mathbb{R}^n$ functions with the same zero set $Z$. We show that the ratio $f$ of such functions is always well-defined and is real analytic. Moreover it satisfies the maximum and minimum…

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…

Maximizing submodular objectives under constraints is a fundamental problem in machine learning and optimization. We study the maximization of a nonnegative, non-monotone $\gamma$-weakly DR-submodular function over a down-closed convex…

Let $\Omega\subset \mathbb{R}^n$ be a bounded domain that can be written as $\Omega=\bigcup_{t} \Omega_t$, where $\{\Omega_t\}_{t\in\Gamma}$ is a countable collection of domains with certain properties. In this work, we develop a technique…

Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular…

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

Given a matrix-valued function $\mathcal{F}(\lambda)=\sum_{i=1}^d f_i(\lambda) A_i$, with complex matrices $A_i$ and $f_i(\lambda)$ entire functions for $i=1,\ldots,d$, we discuss a method for the numerical approximation of the distance to…

Let ${\mathfrak F}$ be a category of subanalytic subsets of real analytic manifolds that is closed under basic set-theoretical and basic topological operations. Let $M$ be a real analytic manifold and denote ${\mathfrak F}(M)$ the family of…

For a real-valued function $f$ on a metric measure space $(X,d,\mu)$ the Hardy-Littlewood maximal-function of $f$ is given by the following `supremum-norm':…

We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Our algorithms combine…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…