Related papers: A compact representation for minimizers of $k$-sub…

Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…

Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary…

This paper studies the M\"obius function and related questions about the finiteness of the poset of submodules of semisimple and general modules. We show how to calculate the M\"obius function for semisimple modules based on endomorphism…

Submodularity is one of the most important properties in combinatorial optimization, and $k$-submodularity is a generalization of submodularity. Maximization of a $k$-submodular function requires an exponential number of value oracle…

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 provides a useful…

Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \cite{KZ:PAMI04} has had significant impact in computer vision \cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}.…

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Submodular functions have been studied extensively in machine learning and data mining. In particular, the optimization of submodular functions over the integer lattice (integer submodular functions) has recently attracted much interest,…

This paper continues the study of combinatorial properties of binary functions --- that is, functions $f:2^E\rightarrow\mathbb{C}$ such that $f(\emptyset)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit…

We provide a necessary and sufficient condition for a simple object in a pivotal k-category to be ambidextrous. In turn, these objects imply the existence of nontrivial trace functions in the category. These functions play an important role…

In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…

This article presents a new relation between the basic representation of split real simply-laced affine Kac-Moody algebras and finite dimensional representations of its maximal compact subalgebra $\mathfrak{k}$. We provide infinitely many…

In this paper the problem of finding the sparsest (i.e., minimum cardinality) critical $k$-tuple including one arbitrarily specified measurement is considered. The solution to this problem can be used to identify weak points in the…

Submodular optimization generalizes many classic problems in combinatorial optimization and has recently found a wide range of applications in machine learning (e.g., feature engineering and active learning). For many large-scale…

Let $F$ be a non-archimedean local field of odd residue characteristic $p$. Let $G$ be the unramified unitary group $U(2, 1)(E/F)$, and $K$ be a maximal compact open subgroup of $G$. For an $\overline{\mathbf{F}}_p$-smooth representation…

A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set $K$ described by polynomial inequalities and equations. In its full generality it is a non-convex, multi-extremal,…

We investigate finite sets of rational functions $\{ f_{1},f_{2}, \dots, f_{r} \}$ defined over some number field $K$ satisfying that any $t_{0} \in K$ is a $K_{p}$-value of one of the functions $f_{i}$ for almost all primes $p$ of $K$. We…

It is shown that a piecewise linear function can be represented as a Max-Min polynomial of its linear components.

Define Minimum Soapy Union (MinSU) as the following optimization problem: given a $k$-tuple $(X_1, X_2,..., X_k)$ of finite integer sets, find a $k$-tuple $(t_1, t_2,..., t_k)$ of integers that minimizes the cardinality of $(X_1 + t_1) \cup…

We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent…