Results 91 to 100 of about 9,676,389 (199)
Risk-Sensitive Submodular Optimization
, 2018 The conditional value at risk (CVaR) is a popular risk measure which enables risk-averse decision making under uncertainty. We consider maximizing the CVaR of a continuous submodular function, an extension of submodular set functions to a continuous ...
Wilder, Bryan
core +1 more source
Interactive submodular set cover
, 2010 We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submodular set cover.
Andrew Guillory, Jeff Bilmes
core
Online submodular set cover, ranking, and repeated active learning [PDF]
, 2011 We propose an online prediction version of submodular set cover with connections to ranking and repeated active learning. In each round, the learning algorithm chooses a sequence of items.
Andrew Guillory, Jeff Bilmes
core
On the Initial Set of Constraints for Graph-Based Submodular Function Maximization
Acta CyberneticaA crucial problem in combinatorial optimization is the submodular function maximization (SFM), and in many cases it involves graphs on which the maximization is specified. The problem is well-studied and hence there are several proposed algorithms in the literature.
Eszter Csókás, Tamás Vinkó
openaire +1 more source
On Equivalence of M$^\natural$-concavity of a Set Function and Submodularity of Its Conjugate
, 2017 A fundamental theorem in discrete convex analysis states that a set function is M$^\natural$-concave if and only if its conjugate function is submodular. This paper gives a new proof to this fact.
Kazuo Murota, Akiyoshi Shioura
openaire +2 more sources
Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks
, 2015 —In this paper, we investigate the wireless network deployment problem, which seeks the best deployment of a given limited number of wireless routers.
Ming-jer Tsai +2 more
core
Submodular Function Maximization for Group Elevator Scheduling
, 2017 We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function.
Raghunathan, Arvind +2 more
core +1 more source
Submodular maximization over multiple matroids via generalized exchange properties
, 2009 In this paper, we consider the problem of maximizing a non-negative submodular function f, defined on a (finite) ground set N, subject to matroid constraints.
Jon Lee +5 more
core +1 more source
Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering. [PDF]
Front Big Data, 2023 Zhu Y, Segarra S.
europepmc +1 more source
Sequence independent lifting for a set of submodular maximization problems
We study the polyhedral structure of a mixed 0-1 set arising from the submodular maximization problem, given by P = {(w, x) ∈ R × {0, 1}n : w ≤ f (x), x ∈ X}, where submodular function f (x) is represented by a concave function composed with an affine ...
Shi, Xueyu +2 more
core +1 more source