Assistant Professor, Peking University
1 paper at NeurIPS 2025
We provide a computational efficient algorithm to achieve $O(H)$ deployment cost with polynomial sample complexity.