Qingsong Liu

Orcid: 0009-0003-5016-4281

Affiliations:
  • University of Massachusetts (UMass) Amherst, Manning College of Information and Computer Sciences, Amherst, MA, USA
  • Tsinghua University, Institute for Interdisciplinary Information Sciences (IIIS), Beijing, China


According to our database1, Qingsong Liu authored at least 17 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Online Fair Allocation of Reusable Resources.
Proc. ACM Meas. Anal. Comput. Syst., 2025

Learning to Optimize Resource Utilization with QoS Guarantees.
Proceedings of the IEEE INFOCOM 2025, 2025

2024
Online Task Scheduling and Termination With Throughput Constraint.
IEEE/ACM Trans. Netw., December, 2024

Optimal Caching for Partial-Observation Regime and Beyond.
IEEE Trans. Serv. Comput., 2024

Learning the Optimal Control for Evolving Systems with Converging Dynamics.
Proc. ACM Meas. Anal. Comput. Syst., 2024

Learning-based Scheduling for Information Gathering with QoS Constraints.
Proceedings of the IEEE INFOCOM 2024, 2024

Adversarial Combinatorial Bandits with Switching Cost and Arm Selection Constraints.
Proceedings of the IEEE INFOCOM 2024, 2024

Online Caching With Switching Cost and Operational Long-Term Constraints: An Online Learning Approach.
Proceedings of the IEEE International Conference on Acoustics, 2024

Decentralized Scheduling with QoS Constraints: Achieving O(1) QoS Regret of Multi-Player Bandits.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Learning to Schedule Tasks with Deadline and Throughput Constraints.
Proceedings of the IEEE INFOCOM 2023, 2023

Learning To Regularized Resource Allocation with Budget Constraints.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Online Convex Optimization with Switching Costs: Algorithms and Performance.
Proceedings of the 20th International Symposium on Modeling and Optimization in Mobile, 2022

Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Learning to Caching Under the Partial-feedback Regime.
Proceedings of the 18th International Conference on Network and Service Management, 2022

Optimal Dynamic Regret for Online Convex Optimization with Squared l2 Norm Switching Cost.
Proceedings of the American Control Conference, 2022

2021
Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints.
Perform. Evaluation, 2021

HyperNAT: Scaling Up Network Address Translation with SmartNICs for Clouds.
Proceedings of the IEEE Global Communications Conference, 2021


  Loading...