4 citations · 8 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 4 cited
Optimal Query Complexity of Secure Stochastic Convex Optimization
Wei Tang, Chien-Ju Ho, Yang Liu
We study the secure stochastic convex optimization problem. A learner aims to learn the optimal point of a convex function through sequentially querying a (stochastic) gradient ora…
cs.GT2021
Competitive Information Design for Pandora's Box
Bolin Ding, Yiding Feng, Chien-Ju Ho +2
We study a natural competitive-information-design strategic variant for the celebrated Pandora's Box problem (Weitzman, 1979), where each box is associated with a strategic informa…