Haoyang Liu

Haoyang Liu

Auto-generated profile, based on publicly available information

Haoyang Liu

University of California 95616 Davis CA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 June 2010 in Design Automation for Embedded Systems
Verified
Journal Article
Closed access
PDF file
EJEric Jung
Eric Jung
FMFrank Maker
Frank Maker
TCTang Lung Cheung
Tang Lung Cheung
XLXin Liu
Xin Liu
VAVenkatesh Akella
Venkatesh Akella

15 February 2011 in arXiv
Verified
Preprint
Open access
PDF file
HLHaoyang Liu
Haoyang Liu
KLKeqin Liu
Keqin Liu
QZQing Zhao
Qing Zhao
We consider decentralized restless multi-armed bandit problems with unknown dynamics and multiple players. The reward state of each arm transits according to an unknown Markovian rule when it is played and evolves according to an arbitrary unknown random process when it is passive. Players activating the same arm at the same time collide and suffer from reward loss. The objective is to maximize the long-term reward by designing a decentralized arm selection policy to address unknown reward models and collisions among players. A decentralized policy is constructed that achieves a regret with logarithmic order when an arbitrary nontrivial bound on certain system parameters is known. When no knowledge about the system is available, we extend the policy to achieve a regret arbitrarily close to the logarithmic order. The result finds applications in communication networks, financial investment, and industrial engineering.

26 December 2011 in arXiv
Verified
Preprint
Open access
PDF file
HLHaoyang Liu
Haoyang Liu
KLKeqin Liu
Keqin Liu
QZQing Zhao
Qing Zhao
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics in which a player chooses M out of N arms to play at each time. The reward state of each arm transits according to an unknown Markovian rule when it is played and evolves according to an arbitrary unknown random process when it is passive. The performance of an arm selection policy is measured by regret, defined as the reward loss with respect to the case where the player knows which M arms are the most rewarding and always plays the M best arms. We construct a policy with an interleaving exploration and exploitation epoch structure that achieves a regret with logarithmic order when arbitrary (but nontrivial) bounds on certain system parameters are known. When no knowledge about the system is available, we show that the proposed policy achieves a regret arbitrarily close to the logarithmic order. We further extend the problem to a decentralized setting where multiple distributed players share the arms without information exchange. Under both an exogenous restless model and an endogenous restless model, we show that a decentralized extension of the proposed policy preserves the logarithmic regret order as in the centralized setting. The results apply to adaptive learning in various dynamic systems and communication networks, as well as financial investment.