6 citations · 10 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LG2022★ 2 cited
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles
Yuxuan Han, Jialin Zeng, Yang Wang +2
We study the stochastic contextual bandit with knapsacks (CBwK) problem, where each action, taken upon a context, not only leads to a random reward but also costs a random resource…
cs.IT2022
Performance Analysis of OMP in Super-Resolution
Yuxuan Han, Zhiyi Huang, Yang Wang +1
Given a spectrally sparse signal consisting of complex sinusoids, we consider the super-resolution problem,…
cs.LG2022
On Private Online Convex Optimization: Optimal Algorithms in -Geometry and High Dimensional Contextual Bandits
Yuxuan Han, Zhicong Liang, Zhipeng Liang +3
Differentially private (DP) stochastic convex optimization (SCO) is ubiquitous in trustworthy machine learning algorithm design. This paper studies the DP-SCO problem with streamin…