# Finding the Submodularity Hidden in Symmetric Difference

A fundamental property of convex functions in continuous space is that the convexity is preserved under affine transformations. A set function f on a finite set V is submodular if f(X) + f(Y) ≥ f(X ∪ Y) - f(X ∩ Y) for any pair X, Y ⊆ V. The symmetric difference transformation ( SD-transformation) of f by a canonical set S ⊆ V is a set function g given by g(X) = f(X S) for X ⊆ V, where X S = (X ∖ S) ∪ (S ∖ X) is the symmetric difference between X and S. Despite that submodular functions and SD-transformations are regarded as counterparts of convex functions and affine transformations in finite discrete space, not all SD-transformations do not preserve the submodularity. Starting with a characterization of SD-stransformations that preserve the submodularity, this paper investigates the problem of discovering a canonical set S, given the SD-transformation g of a submodular function f by S, provided that g(X) is given by an oracle. A submodular function f on V is said to be strict if f(X) + f(Y) > f(X ∪ Y) - f(X ∩ Y) holds whenever both X ∖ Y and Y ∖ X are nonempty. We show that the problem is solvable by using O(|V|) oracle calls when f is strictly submodular, although it requires exponentially many oracle calls in general.

• 2 publications
• 10 publications
• 5 publications
• 8 publications
research
12/23/2017

### Finding Submodularity Hidden in Symmetric Difference

A set function f on a finite set V is submodular if f(X) + f(Y) ≥ f(X ∪...
research
03/20/2019

### Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M^-Concave Set Function

Submodularity is an important concept in combinatorial optimization, and...
research
05/31/2019

### Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions

We consider the problem of minimising functions represented as a differe...
research
06/22/2017

### Efficient Convex Optimization with Membership Oracles

We consider the problem of minimizing a convex function over a convex se...
research
08/01/2019

### Submodular Cost Submodular Cover with an Approximate Oracle

In this work, we study the Submodular Cost Submodular Cover problem, whi...
research
08/23/2023

### Balanced Submodular Flows

This paper examines the Balanced Submodular Flow Problem, that is the pr...
research
10/05/2020

### Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method

We consider the classical setting of optimizing a nonsmooth Lipschitz co...