13,664 research outputs found
A Relaxation result for energies defined on pairs set-function and applications
We consider, in an open subset Ω
of RN, energies depending on the perimeter of a subset
E С Ω
(or some equivalent surface integral) and on a function u which is defined only on
E. We compute the lower semicontinuous envelope of such energies. This relaxation has
to take into account the fact that in the limit, the “holes”
Ω \ E may collapse into a
discontinuity of u, whose surface will be counted twice in the relaxed energy. We discuss
some situations where such energies appear, and give, as an application, a new proof of
convergence for an extension of Ambrosio-Tortorelli’s approximation to the Mumford-Shah
functional
Constrained Monotone Function Maximization and the Supermodular Degree
The problem of maximizing a constrained monotone set function has many
practical applications and generalizes many combinatorial problems.
Unfortunately, it is generally not possible to maximize a monotone set function
up to an acceptable approximation ratio, even subject to simple constraints.
One highly studied approach to cope with this hardness is to restrict the set
function. An outstanding disadvantage of imposing such a restriction on the set
function is that no result is implied for set functions deviating from the
restriction, even slightly. A more flexible approach, studied by Feige and
Izsak, is to design an approximation algorithm whose approximation ratio
depends on the complexity of the instance, as measured by some complexity
measure. Specifically, they introduced a complexity measure called supermodular
degree, measuring deviation from submodularity, and designed an algorithm for
the welfare maximization problem with an approximation ratio that depends on
this measure.
In this work, we give the first (to the best of our knowledge) algorithm for
maximizing an arbitrary monotone set function, subject to a k-extendible
system. This class of constraints captures, for example, the intersection of
k-matroids (note that a single matroid constraint is sufficient to capture the
welfare maximization problem). Our approximation ratio deteriorates gracefully
with the complexity of the set function and k. Our work can be seen as
generalizing both the classic result of Fisher, Nemhauser and Wolsey, for
maximizing a submodular set function subject to a k-extendible system, and the
result of Feige and Izsak for the welfare maximization problem. Moreover, when
our algorithm is applied to each one of these simpler cases, it obtains the
same approximation ratio as of the respective original work.Comment: 23 page
Generalized Budgeted Submodular Set Function Maximization
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the overall cost is at most a given budget, and the profit is maximized. Each bin has its own cost and the cost of each element depends on its associated bin. The profit is measured by a monotone submodular function over the elements.
We first present an algorithm that guarantees an approximation factor of 1/2(1-1/e^alpha), where alpha <= 1 is the approximation factor of an algorithm for a sub-problem. We give two polynomial-time algorithms to solve this sub-problem. The first one gives us alpha=1- epsilon if the costs satisfies a specific condition, which is fulfilled in several relevant cases, including the unitary costs case and the problem of maximizing a monotone submodular function under a knapsack constraint. The second one guarantees alpha=1-1/e-epsilon for the general case. The gap between our approximation guarantees and the known inapproximability bounds is 1/2.
We extend our algorithm to a bi-criterion approximation algorithm in which we are allowed to spend an extra budget up to a factor beta >= 1 to guarantee a 1/2(1-1/e^(alpha beta))-approximation. If we set beta=1/(alpha)ln (1/(2 epsilon)), the algorithm achieves an approximation factor of 1/2-epsilon, for any arbitrarily small epsilon>0
On Equivalence of M-concavity of a Set Function and Submodularity of Its Conjugate
A fundamental theorem in discrete convex analysis states that a set function
is M-concave if and only if its conjugate function is submodular.
This paper gives a new proof to this fact
Performance guarantees for greedy maximization of non-submodular controllability metrics
A key problem in emerging complex cyber-physical networks is the design of
information and control topologies, including sensor and actuator selection and
communication network design. These problems can be posed as combinatorial set
function optimization problems to maximize a dynamic performance metric for the
network. Some systems and control metrics feature a property called
submodularity, which allows simple greedy algorithms to obtain provably
near-optimal topology designs. However, many important metrics lack
submodularity and therefore lack provable guarantees for using a greedy
optimization approach. Here we show that performance guarantees can be obtained
for greedy maximization of certain non-submodular functions of the
controllability and observability Gramians. Our results are based on two key
quantities: the submodularity ratio, which quantifies how far a set function is
from being submodular, and the curvature, which quantifies how far a set
function is from being supermodular
A parametric level-set method for partially discrete tomography
This paper introduces a parametric level-set method for tomographic
reconstruction of partially discrete images. Such images consist of a
continuously varying background and an anomaly with a constant (known)
grey-value. We represent the geometry of the anomaly using a level-set
function, which we represent using radial basis functions. We pose the
reconstruction problem as a bi-level optimization problem in terms of the
background and coefficients for the level-set function. To constrain the
background reconstruction we impose smoothness through Tikhonov regularization.
The bi-level optimization problem is solved in an alternating fashion; in each
iteration we first reconstruct the background and consequently update the
level-set function. We test our method on numerical phantoms and show that we
can successfully reconstruct the geometry of the anomaly, even from limited
data. On these phantoms, our method outperforms Total Variation reconstruction,
DART and P-DART.Comment: Paper submitted to 20th International Conference on Discrete Geometry
for Computer Imager
- …