A Note on Isolating Cut Lemma for Submodular Function Minimization

03/29/2021
by   Sagnik Mukhopadhyay, et al.
0

It has been observed independently by many researchers that the isolating cut lemma of Li and Panigrahi [FOCS 2020] can be easily extended to obtain new algorithms for finding the non-trivial minimizer of a symmetric submodular function and solving the hypergraph minimum cut problem. This note contains these observations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2019

New Query Lower Bounds for Submodular Function MInimization

We consider submodular function minimization in the oracle model: given ...
research
03/05/2021

Decomposable Submodular Function Minimization via Maximum Flow

This paper bridges discrete and continuous optimization approaches for d...
research
11/08/2017

Computing exact minimum cuts without knowing the graph

We give query-efficient algorithms for the global min-cut and the s-t cu...
research
10/28/2021

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

Minimizing a sum of simple submodular functions of limited support is a ...
research
09/06/2018

Yes, IoU loss is submodular - as a function of the mispredictions

This note is a response to [7] in which it is claimed that [13, Proposit...
research
03/24/2021

Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems

Li and Panigrahi, in recent work, obtained the first deterministic algor...
research
09/17/2023

On the Connection Between Riemann Hypothesis and a Special Class of Neural Networks

The Riemann hypothesis (RH) is a long-standing open problem in mathemati...

Please sign up or login with your details

Forgot password? Click here to reset