Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Hellerstein, Lisa"'
Autor:
Witter, R. Teal, Hellerstein, Lisa
Restless Multi-Armed Bandits (RMABs) offer a powerful framework for solving resource constrained maximization problems. However, the formulation can be inappropriate for settings where the limiting constraint is a reward threshold rather than a budge
Externí odkaz:
http://arxiv.org/abs/2409.03071
This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the voters have
Externí odkaz:
http://arxiv.org/abs/2401.10476
We consider the problem of solving the Min-Sum Submodular Cover problem using local search. The Min-Sum Submodular Cover problem generalizes the NP-complete Min-Sum Set Cover problem, replacing the input set cover instance with a monotone submodular
Externí odkaz:
http://arxiv.org/abs/2209.03054
We consider the Stochastic Boolean Function Evaluation (SBFE) problem where the task is to efficiently evaluate a known Boolean function $f$ on an unknown bit string $x$ of length $n$. We determine $f(x)$ by sequentially testing the variables of $x$,
Externí odkaz:
http://arxiv.org/abs/2208.03810
Publikováno v:
Discrete Applied Mathematics 309 (2022), 269-277
We give two approximation algorithms solving the Stochastic Boolean Function Evaluation (SBFE) problem for symmetric Boolean functions. The first is an $O(\log n)$-approximation algorithm, based on the submodular goal-value approach of Deshpande, Hel
Externí odkaz:
http://arxiv.org/abs/2111.08793
Autor:
Hellerstein, Lisa, Lidbetter, Thomas
We consider the problem of maximizing the minimum (weighted) value of all components of a vector over a polymatroid. This is a special case of the lexicographically optimal base problem introduced and solved by Fujishige. We give an alternative formu
Externí odkaz:
http://arxiv.org/abs/2104.10236
Publikováno v:
Journal of Artificial Intelligence Research 71(2021) 347 - 370
We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) achieves an approximation bound of $(\ln (Q/\eta)+1)$ for Stochastic Submodular Cover: here $Q$ is the "goal value" and $\eta$ is the smallest non-zero marginal increase in utili
Externí odkaz:
http://arxiv.org/abs/2102.01149
We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several schedulin
Externí odkaz:
http://arxiv.org/abs/2004.05954
Consider the following Stochastic Score Classification Problem. A doctor is assessing a patient's risk of developing a certain disease, and can perform $n$ tests on the patient. Each test has a binary outcome, positive or negative. A positive test re
Externí odkaz:
http://arxiv.org/abs/1806.10660
We present efficient algorithms for computing optimal or approximately optimal strategies in a zero-sum game for which Player I has n pure strategies and Player II has an arbitrary number of pure strategies. We assume that for any given mixed strateg
Externí odkaz:
http://arxiv.org/abs/1704.02657