Qixin Zhang

Orcid: 0000-0002-0535-3134

Affiliations:
  • Nanyang Technological University (NTU), College of Computing and Data Science, Singapore
  • City University of Hong Kong, School of Data Science, Kowloon Tong, Hong Kong (former)


According to our database1, Qixin Zhang authored at least 18 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Your Reward Function for RL is Your Best PRM for Search: Unifying RL and Search-Based TTS.
CoRR, August, 2025

MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on Large Language Models.
CoRR, June, 2025

GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks.
CoRR, April, 2025

Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning.
CoRR, April, 2025

Refining Adaptive Zeroth-Order Optimization at Ease.
CoRR, February, 2025

Graph convolutional network for traffic incidents duration classification.
Eng. Appl. Artif. Intell., 2025

Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Dynamic Assortment Selection Under Inventory and Limited Switches Constraints.
IEEE Trans. Knowl. Data Eng., March, 2024

Boosting Gradient Ascent for Continuous DR-submodular Maximization.
CoRR, 2024

2023
Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests.
Proceedings of the International Conference on Machine Learning, 2023

Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization.
Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback.
CoRR, 2022

MNL-Bandits under Inventory and Limited Switches Constraints.
CoRR, 2022

Continuous Submodular Maximization: Boosting via Non-oblivious Function.
CoRR, 2022

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function.
Proceedings of the International Conference on Machine Learning, 2022

2021
Online Allocation with Two-sided Resource Constraints.
CoRR, 2021

Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing.
Proceedings of the 38th International Conference on Machine Learning, 2021


  Loading...