Simple and Fast Algorithm for Binary Integer and Online Linear Programming. - Xiaocheng Li; Chunlin Sun; Yinyu Ye 001 (NeurIPS, 2020)

The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks. - Xiaocheng Li; Chunlin Sun; Yinyu Ye 001 (ICML, 2021)

Boosting Method in Approximately Solving Linear Programming with Fast Online Algorithm. - Wenzhi Gao; Chunlin Sun; Yuyang Ye; Yinyu Ye 001 (CoRR, 2021)

An Adaptive State Aggregation Algorithm for Markov Decision Processes. - Guanting Chen 001; Johann Demetrio Gaebler; Matt Peng; Chunlin Sun; Yinyu Ye 001 (CoRR, 2021)

Learning from Stochastically Revealed Preference. - John R. Birge; Xiaocheng Li; Chunlin Sun (NeurIPS, 2022)

Solving Linear Programs with Fast Online Learning Algorithms. - Wenzhi Gao; Dongdong Ge; Chunlin Sun; Yinyu Ye 001 (ICML, 2023)

Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming. - Chunlin Sun; Shang Liu; Xiaocheng Li (ICML, 2023)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP. - Chunlin Sun; Linyu Liu; Xiaocheng Li (NeurIPS, 2023)

When No-Rejection Learning is Optimal for Regression with Rejection. - Xiaocheng Li; Shang Liu; Chunlin Sun; Hanzhao Wang (CoRR, 2023)

When No-Rejection Learning is Consistent for Regression with Rejection. - Xiaocheng Li; Shang Liu; Chunlin Sun; Hanzhao Wang (AISTATS, 2024)

Learning to Make Adherence-aware Advice. - Guanting Chen 001; Xiaocheng Li; Chunlin Sun; Hanzhao Wang (ICLR, 2024)

Decoupling Learning and Decision-Making: Breaking the O(T) Barrier in Online Resource Allocation with First-Order Methods. - Wenzhi Gao; Chunlin Sun; Chenyu Xue 001; Yinyu Ye 001 (ICML, 2024)

Beyond O(√T) Regret: Decoupling Learning and Decision-making in Online Linear Programming. - Wenzhi Gao; Dongdong Ge; Chenyu Xue 001; Chunlin Sun; Yinyu Ye 001 (CoRR, 2025)

Learning While Repositioning in On-Demand Vehicle Sharing Networks. - Hansheng Jiang; Chunlin Sun; Zuo-Jun Max Shen; Shunan Jiang (CoRR, 2025)