Comments on the proof of adaptive submodular function minimization

05/10/2017
by   Feng Nan, et al.
0

We point out an issue with Theorem 5 appearing in "Group-based active query selection for rapid diagnosis in time-critical situations". Theorem 5 bounds the expected number of queries for a greedy algorithm to identify the class of an item within a constant factor of optimal. The Theorem is based on correctness of a result on minimization of adaptive submodular functions. We present an example that shows that a critical step in Theorem A.11 of "Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization" is incorrect.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2010

Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization

Solving stochastic optimization problems under partial observability, wh...
research
07/20/2018

Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity

As a generalization of many classic problems in combinatorial optimizati...
research
01/24/2017

Weak Adaptive Submodularity and Group-Based Active Diagnosis with Applications to State Estimation with Persistent Sensor Faults

In this paper, we consider adaptive decision-making problems for stochas...
research
02/01/2021

A Tight Bound for Stochastic Submodular Cover

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) ...
research
10/30/2016

Active Learning from Imperfect Labelers

We study active learning where the labeler can not only return incorrect...
research
02/14/2012

Active Diagnosis via AUC Maximization: An Efficient Approach for Multiple Fault Identification in Large Scale, Noisy Networks

The problem of active diagnosis arises in several applications such as d...
research
08/09/2018

Few Cuts Meet Many Point Sets

We study the problem of how to breakup many point sets in R^d into small...

Please sign up or login with your details

Forgot password? Click here to reset