Related papers: Oracle Tractability of Skew Bisubmodular Functions
Unsupervised rank aggregation on score-based permutations, which is widely used in many applications, has not been deeply explored yet. This work studies the use of submodular optimization for rank aggregation on score-based permutations in…
We study the skew-symmetric prolongation of a Lie subalgebra $\g \subseteq \mathfrak{so}(n)$, in other words the intersection $\Lambda^3 \cap (\Lambda^1 \otimes \g)$.We compute this space in full generality. Applications include uniqueness…
In this note, we discuss a generalization of the well-known implicit function theorem to the time-delay case. We show that the latter problem is closely related to the bicausal changes of coordinates of time-delay systems. An iterative…
The notion of ordinal concavity of utility functions has recently been considered by Hafalir, Kojima, Yenmez, and Yokote in economics while there exist earlier related works in discrete optimization and operations research. In the present…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
A new class of plurisubharmonic functions on the octonionic plane O^2= R^{16} is introduced. An octonionic version of theorems of A.D. Aleksandrov and Chern- Levine-Nirenberg, and Blocki are proved. These results are used to construct new…
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 define the spaces of Schwartz functions, tempered functions and tempered distributions on manifolds definable in polynomially bounded o-minimal structures. We show that all the classical properties that these spaces have in the Nash…
The present work deals with the mathematical investigation of some generalizations of the Sz\'{a}sz operators. In this work, the multiple Sheffer polynomials are introduced. The generalization of Sz\'{a}sz operators involving multiple…
Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Several techniques were proposed to model the Piecewise linear (PWL) functions, including convex combination, incremental and multiple choice methods. Although the incremental method was proved to be very efficient, the attention of the…
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems, in which the objective function is formed by the sum of a possibly nonsmooth nonconvex function and a differentiable function whose gradient is…
We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where…
In this note, we consider the complexity of optimizing a highly smooth (Lipschitz $k$-th order derivative) and strongly convex function, via calls to a $k$-th order oracle which returns the value and first $k$ derivatives of the function at…
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our…
Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…
Submodular functions, defined on continuous or discrete domains, arise in numerous applications. We study the minimization of the difference of two submodular (DS) functions, over both domains, extending prior work restricted to set…
This paper introduces the proper notion of variational quasiconvexity associated to a group of diffeomorphisms. We prove a lower semicontinuity theorem connected to this notion. In the second part of the paper we apply this result to a…