activity
20222026
most citedDouble Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coverage

2 citations · 4 across the 9 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

stat.ML2025

Learning an Optimal Assortment Policy under Observational Data

Yuxuan Han, Han Zhong, Miao Lu +2

We study the fundamental problem of offline assortment optimization under the Multinomial Logit (MNL) model, where sellers must determine the optimal subset of the products to offe…