3 citations · 4 across the 6 of their papers we have counts for
7 papers
Beyond Reward Suppression: Near-Optimal Offline Attacks on Warm-Start Bandits with Bounded Rewards
Qirun Zeng, Manhin Poon, Xiangxiang Dai +2
Adversarial attacks on bandits aim to mislead a learner toward a target arm while keeping the attack cost small. Existing attacks typically achieve this by suppressing non-target a…
Boosting Gradient Ascent for Continuous DR-submodular Maximization
Qixin Zhang, Zongqi Wan, Zengde Deng +4
Projected Gradient Ascent (PGA) is the most commonly used optimization scheme in machine learning and operations research areas. Nevertheless, numerous studies and examples have sh…
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…
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…
MNL-Bandits under Inventory and Limited Switches Constraints
Hongbin Zhang, Yu Yang, Feng Wu +1
Optimizing the assortment of products to display to customers is a key to increasing revenue for both offline and online retailers. To trade-off between exploring customers' prefer…
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function
Qixin Zhang, Zengde Deng, Zaiyi Chen +2
In this paper, we revisit Stochastic Continuous Submodular Maximization in both offline and online settings, which can benefit wide applications in machine learning and operations…
Online Allocation Problem with Two-sided Resource Constraints
Qixin Zhang, Wenbing Ye, Zaiyi Chen +3
In this paper, we investigate the online allocation problem of maximizing the overall revenue subject to both lower and upper bound constraints. Compared to the extensively studied…