| Competitive online convex optimization with switching costs and ramp constraints M Shi, X Lin, S Fahmy IEEE/ACM Transactions on Networking 29 (2), 876-889, 2021 | 36 | 2021 |
| Power-of-2-arms for bandit learning with switching costs M Shi, X Lin, L Jiao Proceedings of the Twenty-Third International Symposium on Theory …, 2022 | 13 | 2022 |
| Combining regularization with look-ahead for competitive online convex optimization M Shi, X Lin, L Jiao IEEE/ACM Transactions on Networking, 2024 | 12 | 2024 |
| On the Value of Look-Ahead in Competitive Online Convex Optimization M Shi, X Lin, L Jiao Proceedings of the ACM on Measurement and Analysis of Computing Systems 3 (2 …, 2019 | 10 | 2019 |
| A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints M Shi, Y Liang, N Shroff 40th International Conference on Machine Learning (ICML), 2023 | 9 | 2023 |
| Theoretical Hardness and Tractability of POMDPs in RL with Partial Online State Information M Shi, Y Liang, N Shroff arXiv preprint arXiv:2306.08762, 2023 | 4 | 2023 |
| Near-Optimal Adversarial Reinforcement Learning with Switching Costs M Shi, Y Liang, N Shroff 11th International Conference on Learning Representations (ICLR), 2023 | 3 | 2023 |
| Leveraging Synergies Between AI and Networking to Build Next Generation Edge Networks S Lin, M Shi, A Arora, R Bassily, E Bertino, C Caramanis, K Chowdhury, ... 2022 IEEE 8th International Conference on Collaboration and Internet …, 2022 | 1 | 2022 |
| Power-of-2-Arms for Adversarial Bandit Learning With Switching Costs M Shi, X Lin, L Jiao IEEE Transactions on Networking, 2025 | | 2025 |
| Designing Near-Optimal Partially Observable Reinforcement Learning M Shi, Y Liang, N Shroff MILCOM 2024-2024 IEEE Military Communications Conference (MILCOM), 463-468, 2024 | | 2024 |
| Adversarial Online Reinforcement Learning Under Limited Defender Resources M Shi, Y Liang, NB Shroff Network Security Empowered by Artificial Intelligence, 265-301, 2024 | | 2024 |
| On the Value of Prediction and Feedback for Online Decision Making With Switching Costs M Shi Purdue University Graduate School, 2022 | | 2022 |
| Combining regularization with look-ahead for competitive online convex optimization M Shi, X Lin, L Jiao IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, 1-10, 2021 | | 2021 |
| Competitive online convex optimization with switching costs and ramp constraints M Shi, X Lin, S Fahmy, DH Shin IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 1845-1853, 2018 | | 2018 |
Xiaojun LinProfessor of Information Engineering, CUHK, and Professor of ECE, Purdue University (on leave)在 ie.cuhk.edu.hk 的电子邮件经过验证
