| Towards better laplacian representation in reinforcement learning with generalized graph drawing K Wang, K Zhou, Q Zhang, J Shao, B Hooi, J Feng International Conference on Machine Learning, 11003-11012, 2021 | 24 | 2021 |
| Stochastic continuous submodular maximization: Boosting via non-oblivious function Q Zhang, Z Deng, Z Chen, H Hu, Y Yang International Conference on Machine Learning, 26116-26134, 2022 | 21 | 2022 |
| Online learning for non-monotone DR-submodular maximization: From full information to bandit feedback Q Zhang, Z Deng, Z Chen, K Zhou, H Hu, Y Yang International Conference on Artificial Intelligence and Statistics, 3515-3537, 2023 | 11 | 2023 |
| Communication-efficient decentralized online continuous dr-submodular maximization Q Zhang, Z Deng, X Jian, Z Chen, H Hu, Y Yang Proceedings of the 32nd ACM International Conference on Information and …, 2023 | 5 | 2023 |
| Boosting Gradient Ascent for Continuous DR-submodular Maximization Q Zhang, Z Wan, Z Deng, Z Chen, X Sun, J Zhang, Y Yang arXiv preprint arXiv:2401.08330, 2024 | 3 | 2024 |
| Nearly optimal competitive ratio for online allocation problems with two-sided resource constraints and finite requests Q Zhang, W Ye, Z Chen, H Hu, E Chen, Y Yang International Conference on Machine Learning, 41786-41818, 2023 | 2 | 2023 |
| Dynamic Assortment Selection under Inventory and Limited Switches Constraints H Zhang, Q Zhang, F Wu, Y Yang IEEE Transactions on Knowledge and Data Engineering, 2023 | 1* | 2023 |
| Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency Q Zhang, Z Wan, Y Yang, L Shen, D Tao International Conference on Learning Representations (Spotlight), 2025 | | 2025 |
| Refining Adaptive Zeroth-Order Optimization at Ease Y Shu, Q Zhang, K He, Z Dai arXiv preprint arXiv:2502.01014, 2025 | | 2025 |
