5 citations · 6 across the 8 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
Zhiming Huang, Bingshan Hu, Jianping Pan
We revisit combinatorial Thompson sampling (CTS) for semi-bandits with sleeping arms, where arm availability varies over time and actions must satisfy combinatorial constraints, as…
cs.CR2026
Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
Matthew Regehr, Bingshan Hu, Ethan Leeman +3
We study privacy filters, which enable privacy accounting for differentially private (DP) mechanisms with adaptively chosen privacy characteristics. We develop a general theory tha…