7 citations · 8 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CL2026
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…
cs.GT2026
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…