Search Results for author: Huasen Wu

Found 6 papers, 1 papers with code

Waiting but not Aging: Optimizing Information Freshness Under the Pull Model

no code implementations17 Dec 2019 Fengjiao Li, Yu Sang, Zhongdong Liu, Bin Li, Huasen Wu, Bo Ji

Interestingly, we find that under this new Pull model, replication schemes capture a novel tradeoff between different values of the AoI across the servers (due to the random updating processes) and different response times across the servers, which can be exploited to minimize the expected AoI at the user's side.

Adaptive Exploration-Exploitation Tradeoff for Opportunistic Bandits

no code implementations ICML 2018 Huasen Wu, Xueying Guo, Xin Liu

When the load/price is low, so is the cost/regret of pulling a suboptimal arm (e. g., trying a suboptimal network configuration).

Double Thompson Sampling for Dueling Bandits

1 code implementation NeurIPS 2016 Huasen Wu, Xin Liu

This simple algorithm applies to general Copeland dueling bandits, including Condorcet dueling bandits as its special case.

Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits

no code implementations NeurIPS 2015 Huasen Wu, R. Srikant, Xin Liu, Chong Jiang

To the best of our knowledge, this is the first work that shows how to achieve logarithmic regret in constrained contextual bandits.

Multi-Armed Bandits

Cannot find the paper you are looking for? You can Submit a new open access paper.