Ming Shi

Orcid: 0000-0001-9941-9095

Affiliations:
  • State University of New York at Buffalo, NY, USA
  • Ohio State University, Columbus, OH, USA (former)
  • Purdue University, West Lafayette, IN, USA (former)


According to our database1, Ming Shi authored at least 15 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences.
CoRR, March, 2026

Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Power-of-2-Arms for Adversarial Bandit Learning With Switching Costs.
IEEE Trans. Netw., 2025

Online Learning for Optimizing AoI-Energy Tradeoff under Unknown Channel Statistics.
Proceedings of the Twenty-sixth International Symposium on Theory, 2025

Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
Designing Near-Optimal Partially Observable Reinforcement Learning.
Proceedings of the IEEE Military Communications Conference, 2024

2023
Theoretical Hardness and Tractability of POMDPs in RL with Partial Hindsight State Information.
CoRR, 2023

A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints.
Proceedings of the International Conference on Machine Learning, 2023

Near-Optimal Adversarial Reinforcement Learning with Switching Costs.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Power-of-2-arms for bandit learning with switching costs.
Proceedings of the MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, Seoul, Republic of Korea, October 17, 2022


2021
Competitive Online Convex Optimization With Switching Costs and Ramp Constraints.
IEEE/ACM Trans. Netw., 2021

Combining Regularization with Look-Ahead for Competitive Online Convex Optimization.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2019
On the Value of Look-Ahead in Competitive Online Convex Optimization.
Proc. ACM Meas. Anal. Comput. Syst., 2019

2018
Competitive Online Convex Optimization with Switching Costs and Ramp Constraints.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018


  Loading...