Decomposable submodular function minimization: discrete and continuous
Ene, A., Nguyen, H. & Végh, L. A.
(2017).
Decomposable submodular function minimization: discrete and continuous.
In
Guyon, I., Luxburg, U. V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S. & Garnett, R.
(Eds.),
Advances in Neural Information Processing Systems 30 (NIPS 2017) pre-proceedings
.
Neural Information Processing Systems Foundation.
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using combinatorial arguments. We also provide a systematic experimental comparison of the two types of methods, based on a clear distinction between level-0 and level-1 algorithms
| Item Type | Chapter |
|---|---|
| Copyright holders | © 2017 Neural Information Processing Systems Foundation |
| Departments | LSE > Academic Departments > Mathematics |
| Date Deposited | 08 Jan 2018 |
| URI | https://researchonline.lse.ac.uk/id/eprint/86395 |
Explore Further
- https://papers.nips.cc/paper/6880-decomposable-submodular-function-minimization-discrete-and-continuous (Publisher)
- http://www.lse.ac.uk/Mathematics/people/Laszlo-Vegh.aspx (Author)
- https://www.scopus.com/pages/publications/85047020012 (Scopus publication)
- https://papers.nips.cc/book/advances-in-neural-inf... (Official URL)
ORCID: https://orcid.org/0000-0003-1152-200X