5 papers
Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids
Shi Fu, Youming Qiao, Dacheng Tao +2
Over the past decade, a growing body of research has shown that -weak submodularity broadly arises in numerous subset selection tasks, including feature selection, neural networ…
Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions
Chengchang Liu, Zongqi Wan, Haishan Ye +1
We study stochastic zeroth-order optimization with decision-dependent distributions, where the sampling law depends on the current decision and only noisy function values are avail…
Searching for Optimal Prices in Two-Sided Markets
Yiding Feng, Mengfan Ma, Bo Peng +1
We investigate online pricing in two-sided markets where a platform repeatedly posts prices based on binary accept/reject feedback to maximize gains-from-trade (GFT) or profit. We…
Contextual Search in Principal-Agent Games: The Curse of Degeneracy
Yiding Feng, Mengfan Ma, Bo Peng +1
In this work, we introduce and study contextual search in general principal-agent games, where a principal repeatedly interacts with agents by offering contracts based on contextua…
Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency
Qixin Zhang, Zongqi Wan, Yu Yang +2
Coordinating multiple agents to collaboratively maximize submodular functions in unpredictable environments is a critical task with numerous applications in machine learning, robot…