Timezone: »
Poster
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
Alan Kuhnle · J. Smith · Victoria Crawford · My T. Thai
The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context.
Author Information
Alan Kuhnle (University of Florida)
J. Smith (University of Florida)
Victoria Crawford (University of Florida)
My T. Thai (University of Florida)
Related Events (a corresponding poster, oral, or spotlight)
-
2018 Oral: Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice »
Thu Jul 12th 02:50 -- 03:00 PM Room K11
More from the Same Authors
-
2020 Poster: Scalable Differential Privacy with Certified Robustness in Adversarial Learning »
Hai Phan · My T. Thai · Han Hu · Ruoming Jin · Tong Sun · Dejing Dou -
2020 Poster: Streaming k-Submodular Maximization under Noise subject to Size Constraint »
Lan N. Nguyen · My T. Thai -
2019 Poster: Submodular Cost Submodular Cover with an Approximate Oracle »
Victoria Crawford · Alan Kuhnle · My T Thai -
2019 Oral: Submodular Cost Submodular Cover with an Approximate Oracle »
Victoria Crawford · Alan Kuhnle · My T Thai
