1 citations · 1 across the 7 of their papers we have counts for
12 papers
Multi-Agent Reinforcement Learning with Submodular Reward
Wenjing Chen, Chengyuan Qian, Shuo Xing +2
In this paper, we study cooperative multi-agent reinforcement learning (MARL) where the joint reward exhibits submodularity, which is a natural property capturing diminishing margi…
Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
Wenjing Chen, Yixin Chen, Victoria G. Crawford
In many submodular optimization applications, datasets are naturally partitioned into disjoint subsets. These scenarios give rise to submodular optimization problems with partition…
Fair Submodular Cover
Wenjing Chen, Shuo Xing, Samson Zhou +1
Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender…
Linear Submodular Maximization with Bandit Feedback
Wenjing Chen, Victoria G. Crawford
Submodular optimization with bandit feedback has recently been studied in a variety of contexts. In a number of real-world applications such as diversified recommender systems and…
A Threshold Greedy Algorithm for Noisy Submodular Maximization
Wenjing Chen, Shuo Xing, Victoria G. Crawford
We consider the maximization of a submodular objective function , where the objective is not accessed as a value oracle but instead subject to nois…
Bicriteria Approximation Algorithms for the Submodular Cover Problem
Wenjing Chen, Victoria G. Crawford
In this paper, we consider the optimization problem Submodular Cover (SCP), which is to find a minimum cardinality subset of a finite universe such that the value of a submodul…