7 citations · 8 across the 5 of their papers we have counts for
6 papers
PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization
Ziyi Zhang, Shuang Cui, Haotian Zhang +1
While large language models (LLMs) are increasingly deployed in long-context scenarios, lengthy prompts can increase inference costs and latency and exacerbate the ``lost-in-the-mi…
Budget-Feasible Mechanisms for Submodular Welfare Maximization in Procurement Auctions
Shuang Cui, He Huang, Yu-e Sun +1
Budget-feasible procurement auctions play a pivotal role in various AI-driven marketplaces, such as data acquisition and crowdsourcing, where a buyer with a limited budget seeks to…
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Shuang Cui, Kai Han, Jing Tang +3
Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vis…
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising
Kai Han, Benwei Wu, Jing Tang +3
We consider the revenue maximization problem in social advertising, where a social network platform owner needs to select seed users for a group of advertisers, each with a payment…
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization
Kai Han, Shuang Cui, Tianshuai Zhu +3
Submodular optimization has numerous applications such as crowdsourcing and viral marketing. In this paper, we study the fundamental problem of non-negative submodular function max…
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
Kai Han, Zongmai Cao, Shuang Cui +1
We study the problem of maximizing a non-monotone, non-negative submodular function subject to a matroid constraint. The prior best-known deterministic approximation ratio for this…