paper-with-me

Papers

Adaptive Sequence Submodularity

2019-02-15 · NeurIPS 2019 12 · Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, Amin Karbasi

In many machine learning applications, one needs to interactively select a sequence of items (e.g., recommending movies based on a user's feedback) or make sequential decisions in a certain order (e.g., guiding an agent through a series of states). Not only do sequences already pose a dauntingly large search space, but we must also take into account past observations, as well as the uncertainty of future outcomes. Without further structure, finding an optimal sequence is notoriously challenging, if not completely intractable. In this paper, we view the problem of adaptive and sequential decision making through the lens of submodularity and propose an adaptive greedy policy with strong theoretical guarantees. Additionally, to demonstrate the practical utility of our results, we run experiments on Amazon product recommendation and Wikipedia link prediction tasks.

📄 PDF Abstract BibTeX arXiv:1902.05981

Code (1)

ehsankazemi/adaptiveSubseq 공식 구현

Tasks

Decision MakingLink PredictionProduct RecommendationSequential Decision Making

Similar Papers 제목 키워드 기반

Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio

2019-04-24 · Kaito Fujii, Shinsaku Sakaue

We propose a new concept named adaptive submodularity ratio to study the greedy policy for sequential decision making. While the greedy policy is known to perform well for a wide variety of adaptive stochastic optimizati…

Decision Makingfeature selectionSequential Decision MakingStochastic Optimization

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

2010-03-21 · Daniel Golovin, Andreas Krause

Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously difficult challenge. In this paper, we introduc…

Active LearningMarketingStochastic Optimization

Budgeted stream-based active learning via adaptive submodular maximization

2016-12-01 · NeurIPS 2016 12 · Kaito Fujii, Hisashi Kashima

Active learning enables us to reduce the annotation cost by adaptively selecting unlabeled instances to be labeled. For pool-based active learning, several effective methods with theoretical guarantees have been develope…

Active Learning

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

2017-01-24 · Sze Zheng Yong, Lingyun Gao, Necmiye Ozay

In this paper, we consider adaptive decision-making problems for stochastic state estimation with partial observations. First, we introduce the concept of weak adaptive submodularity, a generalization of adaptive submodu…

Decision MakingMedical DiagnosisState Estimation

Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization in Linear Time

2020-08-11 · Shaojie Tang

In this paper, we study the non-monotone adaptive submodular maximization problem subject to a cardinality constraint. We first revisit the adaptive random greedy algorithm proposed in \citep{gotovos2015non}, where they …