Maximizing symmetric submodular functions
WebSymmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Webmonotone submodular maximization problem, which we will describe below. Definition 1. The cardinality constrained monotone submodular maximization problem takes as input a collection of items V, a monotone submodular function f : 2V →R+, and a cardinality constraint b. The goal is to choose a subset of
Maximizing symmetric submodular functions
Did you know?
Web12 nov. 2015 · Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and … WebMatroids and submodular functions are closely related. In particular, each matroid is associated with a submodular rank function. 1.1.2 Maximizing Submodular Functions Let f: 2N!R 0 be a non-negative submodular function. The basic problem we discuss in this chapter is maximizing the function fsubject to a (possibly empty) set of constraints ...
WebSpecifically, the problem is to minimum a sub-additive function c over an integer lattice, under the constraint that the value of a DR-submodular function f is at least \alpha. The paper presents an efficient greedy algorithm, which provides a multiplicative bound on the objective c, and a multiplicative violation of the constraint f. Web26 mei 2024 · Symmetric submodular functions are an important family of submodular functions capturing many interesting cases, including cut functions of graphs and …
Web20 sep. 2014 · Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and … Web10 apr. 2024 · Achieving Long-term Fairness in Submodular Maximization through Randomization. Shaojie Tang, Jing Yuan, Twumasi Mensah-Boateng. Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data …
Web12 apr. 2024 · A k-submodular function is a generalization of a submodular function. The definition domain of a k-submodular function is a collection of k-disjoint subsets instead of simple subsets of ground set. In this paper, we consider the maximization of a k-submodular function with the intersection of a knapsack and m matroid constraints. …
Web3 aug. 2016 · We consider the maximization problem in the value oracle model of functions defined on k -tuples of sets that are submodular in every orthant and r -wise … how to open outlook galWeb16 feb. 2024 · Furthermore, we analyze the performance of the \((1+1)\) EA using \(\mathsf {pmut}_{\beta } \) when maximizing symmetric submodular functions under matroid constraints (Sect. 6). Finally we extend the experimental study on the maximum directed cut problem (Sect. 7.1 ) and perform a new set of experiments on the Maximum Symmetric … how to open outlook in command promptWeb1 nov. 2024 · A submodular function is called symmetric when the value of any set S equals the value of its complement. Symmetric submodular functions form a … how to open outlook in a browserWeb2 sep. 2024 · Many important problems can be regarded as maximizing submodular functions under some constraints. A simple multi-objective evolutionary algorithm called GSEMO has been shown to achieve good approximation for … how to open outlook in microsoft edgeWeb18 mrt. 2024 · Regularized Non-monotone Submodular Maximization. In this paper, we present a thorough study of maximizing a regularized non-monotone submodular function subject to various constraints, i.e., , where is a non-monotone submodular function, is a normalized modular function and is the constraint set. Though the objective function is … murphy business \u0026 financial servicesWebsubmodular maximization problems for which one can get a better approximation for symmetric objectives than the state of the art approximation for general submodular … murphy bus lines exeter ontarioWeb[5] E. Balkanski and Y. Singer. The adaptive complexity of maximizing a submodular function. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2024, Los Angeles, CA, USA, June 25-29, 2024, pages 1138–1151. ACM, 2024. [6] E. Balkanski, A. Rubinstein, and Y. Singer. how to open ovf file in virtualbox