Fast non-monotone submodular maximisation subject to a matroid constraint

Simple item page
dc.contributor.authorSegui-Gasco, Pau
dc.contributor.authorShin, Hyo-Sang
dc.date.accessioned2017-04-04T10:05:01Z
dc.date.available2017-04-04T10:05:01Z
dc.date.issued2017-03-21
dc.description.abstractIn this work we present the first practical . 1 e −ǫ . -approximation algorithm to maximise a general non-negative submodular function subject to a matroid constraint. Our algorithm is based on combining the decreasing-threshold procedure of Badanidiyuru and Vondrak (SODA 2014) with a smoother version of the measured continuous greedy algorithm of Feldman et al. (FOCS 2011). This enables us to obtain an algorithm that requires O( nr2 ǫ4 . ¯ d+ ¯ d ¯ d .2 log2 ( n ǫ )) value oracle calls, where n is the cardinality of the ground set, r is the matroid rank, and ¯ d, ¯ d ∈R+ are the absolute values of the minimum and maximum marginal values that the function f can take i.e.: − ¯ d ≤fS(i) ≤ ¯ d, for all i ∈E and S ⊆E, where E is the ground set. The additional value oracle calls with respect to the work of Badanidiyuru and Vondrak come from the greater spread in the sampling of the multilinear extension that the possibility of negative marginal values introduce.en_UK
dc.identifier.citationPau Segui-Gasco and Hyo-Sang Shin. Fast non-monotone submodular maximisation subject to a matroid constrainten_UK
dc.identifier.urihttps://arxiv.org/abs/1703.06053
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/11702
dc.language.isoenen_UK
dc.rightsThis is the Author Accepted Manuscript. This article may be used for personal use only. The final published version (version of record) is available online at https://arxiv.org/abs/1703.06053
dc.titleFast non-monotone submodular maximisation subject to a matroid constrainten_UK
dc.typeReporten_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Fast_non-monotone_submodular_maximisation-2017.pdf
Size:
202.81 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SATM)