A Tighter Problem-Dependent Regret Bound for Risk-Sensitive Reinforcement Learning. - Xiaoyan Hu 003; Ho-fung Leung (AISTATS, 2023)

Provably Efficient Offline RL with Options. - Xiaoyan Hu 003; Ho-fung Leung (AAMAS, 2023)

Provably (More) Sample-Efficient Offline RL with Options. - Xiaoyan Hu 003; Ho-fung Leung (NeurIPS, 2023)

Provably Efficient CVaR RL in Low-rank MDPs. - Yulai Zhao 002; Wenhao Zhan; Xiaoyan Hu 003; Ho-fung Leung; Farzan Farnia; Wen Sun 002; Jason D. Lee (ICLR, 2024)

An Information Theoretic Approach to Interaction-Grounded Learning. - Xiaoyan Hu 003; Farzan Farnia; Ho-fung Leung (ICML, 2024)

An Optimism-based Approach to Online Evaluation of Generative Models. - Xiaoyan Hu 003; Ho-fung Leung; Farzan Farnia (CoRR, 2024)

An Online Learning Approach to Prompt-based Selection of Generative Models. - Xiaoyan Hu 003; Ho-fung Leung; Farzan Farnia (CoRR, 2024)

A Multi-Armed Bandit Approach to Online Selection and Evaluation of Generative Models. - Xiaoyan Hu 003; Ho-fung Leung; Farzan Farnia (AISTATS, 2025)

PromptWise: Online Learning for Cost-Aware Prompt Assignment in Generative Models. - Xiaoyan Hu 003; Lauren Pick; Ho-fung Leung; Farzan Farnia (CoRR, 2025)