Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

This letter studies the problem of minimizing increasing set functions, or equivalently, maximizing decreasing set functions, over the base of a matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control theory, multi-robot task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and the reverse greedy algorithms. We provide two novel performance guarantees for the approximate solutions obtained by these heuristics depending on both the submodularity ratio and the curvature.

[1]  J. Oxley.  Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

[2]  Andreas Krause,et al.  Guarantees for Greedy Maximization of Non-submodular Functions with Applications , 2017, ICML.

[3]  Hyo-Sang Shin,et al.  UAV Swarms: Decision‐Making Paradigms , 2014 .

[4]  Pratap Tokekar,et al.  Resilient Active Target Tracking With Multiple Robots , 2018, IEEE Robotics and Automation Letters.

[5]  George J. Pappas,et al.  Minimal Actuator Placement With Bounds on Control Effort , 2014, IEEE Transactions on Control of Network Systems.

[6]  Amin Karbasi,et al.  Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? , 2017, ICML.

[7]  Dominic Welsh,et al.  On Matroid Theorems of Edmonds and Rado , 1970 .

[8]  Victor P. Il'ev,et al.  On Minimizing Supermodular Functions on Hereditary Systems , 2018 .

[9]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[10]  Victor P. Il'ev,et al.  Hereditary systems and greedy-type algorithms , 2003, Discret. Appl. Math..

[11]  Maryam Kamgarpour,et al.  Multi-robot task allocation for safe planning under dynamic uncertainties , 2021, ArXiv.

[12]  Dániel Tihanyi.  Multi-robot extension for safe planning under dynamic uncertainty , 2021 .

[13]  Maryam Kamgarpour,et al.  Exploiting Weak Supermodularity for Coalition-Proof Mechanisms , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[14]  Gérard Cornuéjols,et al.  Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..

[16]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[17]  Maryam Kamgarpour,et al.  Performance guarantees for greedy maximization of non-submodular controllability metrics , 2017, 2019 18th European Control Conference (ECC).

[18]  Marek Chrobak,et al.  The reverse greedy algorithm for the metric k-median problem , 2005, Inf. Process. Lett..

[19]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[20]  Abhimanyu Das,et al.  Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.

[21]  Maryam Kamgarpour,et al.  Actuator Placement for Optimizing Network Performance under Controllability Constraints , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  Basel Alomair,et al.  Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability , 2017, IEEE Control Systems.

[24]  Victor P. Il'ev,et al.  Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid , 2006, Eur. J. Oper. Res..

[25]  Radha Poovendran,et al.  On leader selection for performance and controllability in multi-agent systems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[26]  Alexandros G. Dimakis,et al.  Restricted Strong Convexity Implies Weak Submodularity , 2016, The Annals of Statistics.

[27]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[28]  Jan Vondrák,et al.  Optimal approximation for submodular and supermodular optimization with bounded curvature , 2013, SODA.

[29]  Maryam Kamgarpour,et al.  Actuator Placement Under Structural Controllability Using Forward and Reverse Greedy Algorithms , 2021, IEEE Transactions on Automatic Control.

[30]  Francis R. Bach,et al.  Learning with Submodular Functions: A Convex Optimization Perspective , 2011, Found. Trends Mach. Learn..

[31]  Tong Zhang,et al.  Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations , 2011, IEEE Transactions on Information Theory.

[32]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[33]  Maryam Kamgarpour,et al.  A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid , 2021, Eur. J. Oper. Res..

[34]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

[35]  George J. Pappas,et al.  Resilient Non-Submodular Maximization over Matroid Constraints , 2018, ArXiv.

[36]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[37]  Marco Pavone,et al.  The Matroid Team Surviving Orienteers problem: Constrained routing of heterogeneous teams with risky traversal , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).