Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing. - Kaixin Wang; Kuangqi Zhou; Qixin Zhang 001; Jie Shao 006; Bryan Hooi; Jiashi Feng (ICML, 2021)

Online Allocation with Two-sided Resource Constraints. - Qixin Zhang 001; Wenbing Ye; Zaiyi Chen; Haoyuan Hu; Enhong Chen; Yang Yu 001 (CoRR, 2021)

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function. - Qixin Zhang 001; Zengde Deng; Zaiyi Chen; Haoyuan Hu; Yu Yang 001 (ICML, 2022)

Continuous Submodular Maximization: Boosting via Non-oblivious Function. - Qixin Zhang 001; Zengde Deng; Zaiyi Chen; Yu Yang 001 (CoRR, 2022)

MNL-Bandits under Inventory and Limited Switches Constraints. - Hongbin Zhang; Yu Yang 001; Feng Wu; Qixin Zhang 001 (CoRR, 2022)

Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback. - Qixin Zhang 001; Zengde Deng; Zaiyi Chen; Kuangqi Zhou; Haoyuan Hu; Yu Yang 001 (CoRR, 2022)

Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback. - Qixin Zhang 001; Zengde Deng; Zaiyi Chen; Kuangqi Zhou; Haoyuan Hu; Yu Yang 001 (AISTATS, 2023)

Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization. - Qixin Zhang 001; Zengde Deng; Xiangru Jian; Zaiyi Chen; Haoyuan Hu; Yu Yang 001 (CIKM, 2023)

Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests. - Qixin Zhang 001; Wenbing Ye; Zaiyi Chen; Haoyuan Hu; Enhong Chen; Yu Yang 001 (ICML, 2023)

Boosting Gradient Ascent for Continuous DR-submodular Maximization. - Qixin Zhang 001; Zongqi Wan; Zengde Deng; Zaiyi Chen; Xiaoming Sun 001; Jialin Zhang 001; Yu Yang 001 (CoRR, 2024)

Dynamic Assortment Selection Under Inventory and Limited Switches Constraints. - Hongbin Zhang; Qixin Zhang 001; Feng Wu; Yu Yang 001 (IEEE Trans. Knowl. Data Eng., 2024)

Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency. - Qixin Zhang 001; Zongqi Wan; Yu Yang 001; Li Shen 008; Dacheng Tao (ICLR, 2025)

Graph convolutional network for traffic incidents duration classification. - Lyuyi Zhu; Qixin Zhang 001; Xiangru Jian; Yu Yang 001 (Eng. Appl. Artif. Intell., 2025)

Refining Adaptive Zeroth-Order Optimization at Ease. - Yao Shu; Qixin Zhang 001; Kun He 001; Zhongxiang Dai (CoRR, 2025)

Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning. - Can Jin; Hongwu Peng; Qixin Zhang 001; Yujin Tang; Dimitris N. Metaxas; Tong Che (CoRR, 2025)

GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks. - Hao Xu; Xiangru Jian; Xinjian Zhao; Wei Pang; Chao Zhang 045; Suyuchen Wang; Qixin Zhang 001; Joao Monteiro; Qiuzhuang Sun; Tianshu Yu 001 (CoRR, 2025)

MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on Large Language Models. - Yan Sun; Qixin Zhang 001; Zhiyuan Yu 004; Xikun Zhang 007; Li Shen 008; Dacheng Tao (CoRR, 2025)

Your Reward Function for RL is Your Best PRM for Search: Unifying RL and Search-Based TTS. - Can Jin; Yang Zhou 019; Qixin Zhang 001; Hongwu Peng; Di Zhang; Marco Pavone 001; Ligong Han; Zhang-Wei Hong; Tong Che; Dimitris N. Metaxas (CoRR, 2025)