Related papers: Discrete-to-Continuous Extensions: Lov\'asz extens…

The Lovasz Local Lemma due to Erdos and Lovasz is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events,…

We study the problem of sampling an approximately uniformly random satisfying assignment for atomic constraint satisfaction problems i.e. where each constraint is violated by only one assignment to its variables. Let $p$ denote the maximum…

We are interested in inequalities that bound the Riesz means of the eigenvalues of the Dirichlet and Neumann Laplacians in terms of their semiclassical counterpart. We show that the classical inequalities of Berezin-Li-Yau and Kr\"oger,…

Recently, Brandt et al. [STOC'16] proved a lower bound for the distributed Lov\'asz Local Lemma, which has been conjectured to be tight for sufficiently relaxed LLL criteria by Chang and Pettie [FOCS'17]. At the heart of their result lies a…

We review our recent results on the problem of optimizing Riesz means of Laplace eigenvalues among convex sets of given measure in the regime where the cut-off parameter in the definition of the Riesz means tends to infinity. We show that…

Exact solution of hard combinatorial optimization problems often relies on strong convex relaxations, but solving these relaxations repeatedly inside a branch-and-bound algorithm can be prohibitively expensive. Hence, we consider this…

In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…

We study the small amplitude linearization of the Korteweg de Vries equation on the line with a local defect scattering waves represented by a metric graph domain adjoined at one point. For a representative collection of examples, we derive…

Non-commutative graph theory is an operator space generalization of graph theory. Well known graph parameters such as the independence number and Lov\'asz theta function were first generalized to this setting by Duan, Severini, and Winter.…

This paper provides theoretical consistency results for compressed modes. We prove that as L1 regularization term in certain non-convex variational optimization problems vanishes, the solutions of the optimization problem and the…

Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…

In this paper, we propose the first continuous optimization algorithms that achieve a constant factor approximation guarantee for the problem of monotone continuous submodular maximization subject to a linear constraint. We first prove that…

We study the problem of learning a directed acyclic graph from data generated according to an additive, non-linear structural equation model with Gaussian noise. We express each non-linear function through a basis expansion, and derive a…

We propose two numerical algorithms in the fully nonconvex setting for the minimization of the sum of a smooth function and the composition of a nonsmooth function with a linear operator. The iterative schemes are formulated in the spirit…

In the 1970's, Lov\'asz built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and matrix spaces plays a key role in the recent resolutions…

Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a…

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lov\'asz extension. The polar…

We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…

Using a Hilbert space framework inspired by the methods of orthogonal projections and Hodge decompositions, we study a general class of problems (called Z-problems) that arise in effective media theory, especially within the theory of…

This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the…