Search arXiv⌕ Search

arXiv subjects

Giovanni Spisso

Publications and source records attributed to Giovanni Spisso.

2 recordsLinked to original sources

Transport Less, Solve Faster: Exploiting sparsity in algorithm design for Unbalanced Optimal Transport

In this paper, we study the computational aspects of the Unbalanced Optimal Transport (UOT) problem between two given positive measures $μ$ and $ν$. The UOT is a variant to the classic Optimal Transportation problem in which the linear constraints modeling mass preservation are relaxed and replaced by a convex penalty $\Dphi$ in the objective function. First, we show that any UOT problem admits a discrete solution as long as $μ$ and $ν$ are discrete, allowing us to express the optimality conditions characterizing the solution to the UOT problem in an easy-to-handle form. By exploiting the optimality conditions we provide an upper and lower bound on the marginals of the solution as well as a bound on the mass that any solution assigns to any couple of points. The bounds on the mass assigned to each couple of points reveal that, under suitable conditions, the support of any solution to the UOT is contained within a compact set that does not depend on the measures $μ$ and $ν$, but only on the penalty function $\Dphi$ and the cost function $c$. We then introduce a truncated version of the UOT problem that fully leverages the sparsity of the optimal solution by introducing a parameter $R$ that saturates $c$. We show that any solution to the truncated problem naturally yields an approximation of the optimal solution for the standard UOT problem and bound the primal sub-optimality gap between the real solution and the solution induced by the truncated problem via a decreasing power-like function of $R$. Lastly, we study the convergence speed of the Pairwise Frank-Wolfe algorithm when applied to the truncated UOT problem and show that such routine is able to identify the support of the solution within a finite number of iterations.

math.OC↗

The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach

We analyze the problem of identifying large cliques in graphs that are affected by adversarial uncertainty. More specifically, we consider a new formulation, namely the adversarial maximum clique problem, which extends the classical maximum-clique problem to graphs with edges strategically perturbed by an adversary. The proposed mathematical model is thus formulated as a two-player zero-sum game between a clique seeker and an opposing agent. Inspired by regularized continuous reformulations of the maximum-clique problem, we derive a penalized continuous formulation leading to a nonconvex and nonsmooth optimization problem. We further introduce the notion of stable global solutions, namely points remaining optimal under small perturbations of the penalty parameters, and prove an equivalence between stable global solutions of the continuous reformulation and largest cliques that are common to all the adversarially perturbed graphs. In order to solve the given nonsmooth problem, we develop a first-order and projection-free algorithm based on generalized subdifferential calculus in the sense of Clarke and Goldstein, and establish global sublinear convergence rates for it. Finally, we report numerical experiments on benchmark instances showing that the proposed method efficiently detects large common cliques.

math.OC↗