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 10 papers between 2018 and 2024.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
1
1
1
1
1
2
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Combining Regularization With Look-Ahead for Competitive Online Convex Optimization.
IEEE/ACM Trans. Netw., June, 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

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...