1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2023
An Online Algorithm for Chance Constrained Resource Allocation
Yuwei Chen, Zengde Deng, Yinzhi Zhou +3
This paper studies the online stochastic resource allocation problem (RAP) with chance constraints. The online RAP is a 0-1 integer linear programming problem where the resource co…
cs.LG2022
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization
Qixin Zhang, Zengde Deng, Xiangru Jian +3
Maximizing a monotone submodular function is a fundamental task in machine learning, economics, and statistics. In this paper, we present two communication-efficient decentralized…
cs.LG2022★ 1 cited
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback
Qixin Zhang, Zengde Deng, Zaiyi Chen +3
In this paper, we revisit the online non-monotone continuous DR-submodular maximization problem over a down-closed convex set, which finds wide real-world applications in the domai…