A test score based approach to stochastic submodular optimization

Sekar, Shreyas, Vojnovic, Milan ORCID: 0000-0003-1382-022X and Yun, Se-Young (2020) A test score based approach to stochastic submodular optimization. Management Science. ISSN 0025-1909

Text (A Test Score Based Approach to Stochastic Submodular Optimization) - Accepted Version Download (668kB)

• Author

Abstract

We study the canonical problem of maximizing a stochastic submodular function subject to a cardinality constraint, where the goal is to select a subset from a ground set of items with uncertain individual perfor- mances to maximize their expected group value. Although near-optimal algorithms have been proposed for this problem, practical concerns regarding scalability, compatibility with distributed implementation, and expensive oracle queries persist in large-scale applications. Motivated by online platforms that rely on indi- vidual item scores for content recommendation and team selection, we study a special class of algorithms that select items based solely on individual performance measures known as test scores. The central contribution of this work is a novel and systematic framework for designing test score based algorithms for a broad class of naturally occurring utility functions. We introduce a new scoring mechanism that we refer to as replication test scores and prove that as long as the objective function satisfies a diminishing returns condition, one can leverage these scores to compute solutions that are within a constant factor of the optimum. We then extend these scoring mechanisms to the more general stochastic submodular welfare maximization problem, where the goal is to partition items into groups to maximize the sum of the expected group values. For this more difficult problem, we show that replication test scores can be used to develop an algorithm that approximates the optimum solution up to a logarithmic factor. The techniques presented in this work bridge the gap between the rigorous theoretical work on submodular optimization and simple, scalable heuristics that are useful in certain domains. In particular, our results establish that in many applications involving the selection and assignment of items, one can design algorithms that are intuitive and practically relevant with only a small loss in performance compared to the state-of-the-art approaches.

Item Type:	Article
Official URL:	https://pubsonline.informs.org/journal/mnsc
Additional Information:	© 2020 INFORMS
Divisions:	Statistics
Subjects:	H Social Sciences > HA Statistics
Date Deposited:	24 Jan 2020 14:39
Last Modified:	01 Nov 2024 19:33
URI:	http://eprints.lse.ac.uk/id/eprint/103176

Actions (login required)

View Item